A heuristic approach for solving a rich min-max vehicle routing problem with mixed fleet and mixed demand

Abstract We propose a new heuristic approach for a new variant of vehicle routing problem with a min-max objective function and mixed types of service demands satisfied by a mixed fleet. It is assumed that vehicles with unlimited service capacity, which have different service and transfer speeds, operate on demand points grouped in regions with boundaries that cannot be passed. The proposed solution method is based on swarm intelligence. A numerical study is carried out to evaluate the performance of the proposed method.

[1]  Ertan Yakici,et al.  A min–max vehicle routing problem with split delivery and heterogeneous demand , 2013, Optim. Lett..

[2]  Pinar Keskinocak,et al.  Pre-Positioning of Emergency Items for CARE International , 2011, Interfaces.

[3]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

[4]  Serhan Duran,et al.  Pre-Positioning Disaster Response Facilities and Relief Items , 2015 .

[5]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[6]  Marshall L. Fisher,et al.  Chapter 1 Vehicle routing , 1995 .

[7]  Athanasios Migdalas,et al.  Heuristic Solutions of Vehicle Routing Problems in Supply Chain Management , 2002 .

[8]  Athanasios Migdalas,et al.  Annotated bibliography in vehicle routing , 2007, Oper. Res..

[9]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[10]  Ann Melissa Campbell,et al.  Routing for Relief Efforts , 2008, Transp. Sci..

[11]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[12]  Xiangyong Li,et al.  An Ant Colony System for the Open Vehicle Routing Problem , 2006, ANTS Workshop.

[13]  Richard F. Hartl,et al.  D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..

[14]  John Gunnar Carlsson,et al.  Solving Min-Max Multi-Depot Vehicle Routing Problem ⁄ , 2007 .

[15]  Michel Gendreau,et al.  The m-Traveling Salesman Problem with Minmax Objective , 1995, Transp. Sci..

[16]  Irene Loiseau,et al.  An Ant Colony Algorithm for the Capacitated Vehicle Routing , 2004, Electron. Notes Discret. Math..

[17]  Nicos Christofides,et al.  A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations , 1995, Ann. Oper. Res..

[18]  Chunyu Ren,et al.  Solving Min-Max Vehicle Routing Problem , 2011, J. Softw..

[19]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[20]  Gilbert Laporte,et al.  Classical and modern heuristics for the vehicle routing problem , 2000 .

[21]  Frédéric Semet,et al.  Rich vehicle routing problems: From a taxonomy to a definition , 2015, Eur. J. Oper. Res..

[22]  Gilbert Laporte,et al.  Routing problems: A bibliography , 1995, Ann. Oper. Res..

[23]  William J. Cook,et al.  Solution of a Min-Max Vehicle Routing Problem , 2002, INFORMS Journal on Computing.

[24]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[25]  Gilbert Laporte,et al.  An adaptive memory heuristic for a class of vehicle routing problems with minmax objective , 1997, Comput. Oper. Res..

[26]  Paolo Toth,et al.  An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.

[27]  Patrick R. McMullen,et al.  Ant colony optimization techniques for the vehicle routing problem , 2004, Adv. Eng. Informatics.

[28]  Chung-Lun Li,et al.  Approximation results for min‐max path cover problems in vehicle routing , 2010 .