Hybrid algorithm for solving the multi-compartment vehicle routing problem with time windows and profit

This paper presents a new variant of the well-known vehicle routing problem with time windows (VRPTW). More precisely, this paper addresses a multi-compartment vehicle routing problem with time windows and profit (MCVRPTW with profit). The aim of this problem is to serve a set of customers by using a set of vehicles with multiple compartments, under a minimum traveling cost. The vehicles, starting and ending at the depot, have a limited capacity and each compartment is dedicated to one product. A customer is served only within a given time windows and, when it is visited a profit is collected (i.e. a profit not low than a preset profit bound). To solve this problem, an hybrid approach combining the genetic algorithm (GA) and the iterated local search (ILS) is used.

[1]  Andrea Grosso,et al.  Finding maximin latin hypercube designs by Iterated Local Search heuristics , 2009, Eur. J. Oper. Res..

[2]  Michel Gendreau,et al.  TRAVELING SALESMAN PROBLEMS WITH PROFITS: AN OVERVIEW , 2001 .

[3]  Luc Muyldermans,et al.  On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm , 2010, Eur. J. Oper. Res..

[4]  Francisco Herrera,et al.  Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis , 1998, Artificial Intelligence Review.

[5]  Abdellah El-Fallahi,et al.  A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem , 2008, Comput. Oper. Res..

[6]  Necati Aras,et al.  Selective multi-depot vehicle routing problem with pricing , 2011 .

[7]  Gilbert Laporte,et al.  A heuristic for the multi-period petrol station replenishment problem , 2008, Eur. J. Oper. Res..

[8]  Kjetil Fagerholt,et al.  Tank allocation problems in maritime bulk shipping , 2009, Comput. Oper. Res..

[9]  Jacques Renaud,et al.  Production , Manufacturing and Logistics Heuristics for the multi-depot petrol station replenishment problem with time windows , 2012 .

[10]  Bassem Jarboui,et al.  Genetic algorithm with iterated local search for solving a location-routing problem , 2012, Expert Syst. Appl..

[11]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[12]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[13]  Emmanuel D. Chajakis,et al.  Scheduling Deliveries in Vehicles with Multiple Compartments , 2003, J. Glob. Optim..

[14]  Gilbert Laporte,et al.  The petrol station replenishment problem with time windows , 2009, Comput. Oper. Res..

[15]  Arne Løkketangen,et al.  A tabu search approach for the livestock collection problem , 2008, Comput. Oper. Res..

[16]  Roxanne Evering,et al.  An ant colony algorithm for the multi-compartment vehicle routing problem , 2014, Appl. Soft Comput..

[17]  Ana Paula Barbosa-Póvoa,et al.  Integrated scheduling and inventory management of an oil products distribution system , 2013 .

[18]  Alexandre Salles da Cunha,et al.  Heuristic and exact algorithms for a min-max selective vehicle routing problem , 2011, Comput. Oper. Res..

[19]  Kjetil Fagerholt,et al.  A construction and improvement heuristic for a liquefied natural gas inventory routing problem , 2012, Comput. Ind. Eng..