A Hybrid Genetic Algorithm-Simulated Annealing Approach for the Multi-Objective Vehicle Routing Problem with Time Windows

In this study, the vehicle routing problem with time windows (VRPTW) is investigated and formulated as a multi-objective model. As a solution approach, a hybrid meta-heuristic algorithm is proposed. Proposed algorithm consists of two meta-heuristics: Genetic Algorithm (GA) and Simulated Annealing (SA). In this algorithm, SA is used as an improvement operator in GA. Besides, a hypothetical application is presented to foster the better understanding of the proposed model and algorithm. The validity of the algorithm is tested via some well-known benchmark problems from the literature.

[1]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

[2]  Wen-Chyuan Chiang,et al.  Scatter search for the vehicle routing problem with time windows , 2006, Eur. J. Oper. Res..

[3]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[4]  Jean-Yves Potvin,et al.  Clustering for vehicle routing with a competitive neural network , 1995, Neurocomputing.

[5]  Rong-Song He,et al.  Damage detection by an adaptive real-parameter simulated annealing genetic algorithm , 2006 .

[6]  Serap Ulusam Seçkiner,et al.  A simulated annealing approach to the solution of job rotation scheduling problems , 2007, Appl. Math. Comput..

[7]  Rym M'Hallah,et al.  Minimizing total earliness and tardiness on a single machine using a hybrid heuristic , 2007, Comput. Oper. Res..

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

[9]  Michel Gendreau,et al.  A PARALLEL TABU SEARCH HEURISTIC FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 1997 .

[10]  Herman R. Leep,et al.  A vehicle routing problem solved by using a hybrid genetic algorithm , 2007, Comput. Ind. Eng..

[11]  Nicolas Jozefowiez,et al.  Multi-objective vehicle routing problems , 2008, Eur. J. Oper. Res..

[12]  Dag Haugland,et al.  A tabu search heuristic for the vehicle routing problem with time windows and split deliveries , 2004, Comput. Oper. Res..

[13]  Hongmei Yu,et al.  A combined genetic algorithm/simulated annealing algorithm for large scale system energy integration , 2000 .

[14]  Robert A. Russell,et al.  Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..

[15]  R. Tavakkoli-Moghaddam,et al.  A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length , 2006, Appl. Math. Comput..

[16]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[17]  Toshihide Ibaraki,et al.  The vehicle routing problem with flexible time windows and traveling times , 2006, Discret. Appl. Math..

[18]  Michel Gendreau,et al.  An exact algorithm for a single-vehicle routing problem with time windows and multiple routes , 2007, Eur. J. Oper. Res..

[19]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[20]  Chi-Bin Cheng,et al.  A modified ant colony system for solving the travelling salesman problem with time windows , 2007, Math. Comput. Model..

[21]  Jean-Yves Potvin,et al.  Heuristic approaches to vehicle routing with backhauls and time windows , 1996, Comput. Oper. Res..

[22]  Gülfem Tuzkaya,et al.  A methodology for the strategic design of reverse logistics networks and its application in the Turkish white goods industry , 2011 .

[23]  Loo Hay Lee,et al.  Heuristic methods for vehicle routing problem with time windows , 2001, Artif. Intell. Eng..

[24]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[25]  Chih-Wen Liu,et al.  Large-scale optimal VAR planning by hybrid simulated annealing/genetic algorithm , 1999 .

[26]  Gülfem Tuzkaya,et al.  Reverse Logistics Network Design Using a Hybrid Genetic Algorithm and Simulated Annealing Methodology , 2011 .

[27]  Mitsuo Gen,et al.  Scheduling algorithm for real-time tasks using multiobjective hybrid genetic algorithm in heterogeneous multiprocessors system , 2007, Comput. Oper. Res..

[28]  Mahmoud A. Abo-Sinna,et al.  An effective genetic algorithm approach to multiobjective routing problems (MORPs) , 2005, Appl. Math. Comput..

[29]  Juliane Müller,et al.  Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows , 2010, Eur. J. Oper. Res..

[30]  Alex Van Breedam,et al.  Improvement heuristics for the Vehicle Routing Problem based on simulated annealing , 1995 .

[31]  Abel García-Nájera,et al.  Bi-objective Optimization for the Vehicle Routing Problem with Time Windows: Using Route Similarity to Enhance Performance , 2009, EMO.

[32]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[33]  Richard Y. K. Fung,et al.  Vehicle routing problem with fuzzy time windows , 2009, Fuzzy Sets Syst..

[34]  Brian Kallehauge,et al.  Formulations and exact algorithms for the vehicle routing problem with time windows , 2008, Comput. Oper. Res..

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

[36]  Timon C. Du,et al.  Dynamic vehicle routing for online B2C delivery , 2004 .

[37]  Jörg Homberger,et al.  A two-phase hybrid metaheuristic for the vehicle routing problem with time windows , 2005, Eur. J. Oper. Res..

[38]  Mei-Shiang Chang,et al.  The real-time time-dependent vehicle routing problem , 2006 .

[39]  Fanxu Meng,et al.  Kinetics research for the synthesis of branch ether using genetic-simulated annealing algorithm with multi-pattern evolution , 2003 .

[40]  Jean-Yves Potvin,et al.  An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .

[41]  Timon C. Du,et al.  A real-time vehicle-dispatching system for consolidating milk runs , 2007 .

[42]  Moshe Dror,et al.  A vehicle routing improvement algorithm comparison of a "greedy" and a matching implementation for inventory routing , 1986, Comput. Oper. Res..

[43]  Heung-Suk Hwang,et al.  An improved model for vehicle routing problem with time constraint based on genetic algorithm , 2002 .

[44]  Jonathan F. Bard,et al.  A GRASP for the Vehicle Routing Problem with Time Windows , 1995, INFORMS J. Comput..

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