Program > By author > Villegas Juan G.

Thursday 27
Logistics, localisation, transport and air control
Christelle Guéret
› 12:00 - 12:30 (30min)
› Bât. A - TD 37
A route-first cluster-second heuristic for the Green Vehicle Routing Problem
Jose A. Montoya  1, 2, *@  , Christelle Guéret  2@  , Jorge E. Mendoza  3@  , Juan G. Villegas  4@  
1 : Departamento de Ingenieria de Producción, Universidad Eafit
Carrera 49 N° 7 Sur - 50, Medellin -  Colombie
2 : Laboratoire angevins de recherche en ingénierie des systèmes (EA 7315)  (LARIS)
LUNAM Université, Université d’Angers
4 boulevard lavoisier 49016 Angers -  France
3 : Laboratoire angevins de recherche en ingénierie des systèmes (EA 7315)  (LARIS)
LUNAM Université, Université Catholique de l’Ouest
3 Place André Leroy, 49008 Angers -  France
4 : Departamento de Ingeniería Industrial, Universidad de Antioquia
Calle 67 No. 53 - 108, Medellin -  Colombie
* : Corresponding author

The global warming phenomenon and other environmental concerns have motivated the use of zero emission vehicles (ZEV) in different transportation operations ranging from postal delivery to grocery distribution. The use of ZEV leads to new optimization problems. One of these problems is the green vehicle routing problem (Green-VRP): an extension of the well-known vehicle routing problem arising when a fleet of ZEV based at a central depot services the demand of a set of geographically-spread customers. The particular feature of the Green VRP comes from the limited autonomy of ZEV. Indeed, to assure the feasible completion of trips, alternative fuel stations (AFS) have to be visited en-route in order to refill the tank (or recharge the battery). Additionally, a maximum duration constraint is also imposed to the routes in a Green-VRP.

In this work we propose a route-first cluster-second metaheuristic that explores the space of giant tours (where all customers are visited ignoring the autonomy and maximum duration constraints) using a simulated annealing mechanism. To extract a Green-VRP solution from a given giant tour we use an optimal splitting procedure that solves a shortest path problem in an auxiliary graph which arcs represent feasible routes. Moreover, infeasible routes with respect to the autonomy constraint are repaired by inserting the visits to AFS using a heuristic procedure.

Computational experiments, on a set of standard instances, show that the proposed metaheuristic obtains competitive results when compared to state-of-the-art methods that include: a modified Clarke and Wright savings heuristic, a density-based clustering algorithm, and a hybrid variable neighborhood search/tabu search.

Online user: 1