Applying hybrid meta-heuristics for capacitated vehicle routing problem

The capacitated vehicle routing problem (CVRP) is one of the most important problems in the optimization of distribution networks. The objective of CVRP, known demands on the cost of originating and terminating at a delivery depot, is to determine the optimal set of routes for a set of vehicles to deliver customers. CVRP is known to be NP-hard problem, and then it is difficult to solve this problem directly when the problem size is large. In this paper, a hybrid algorithm of simulated annealing and tabu search is applied to solve CVRP. It takes the advantages of simulated annealing and tabu search for solving CVRP. Simulation results are reported on classical fourteen instances and twenty large-scale benchmark instances. From simulation results, the proposed algorithm finds eight best solutions of classical fourteen instances. Additionally, the solutions of the proposed algorithm have also admirable performance for twenty large-scale benchmark instances. It shows that the proposed algorithm is competitive with other existing algorithms for solving CVRP.

[1]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[2]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

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

[4]  B. Gillett,et al.  Multi-terminal vehicle-dispatch algorithm , 1976 .

[5]  Alexander H. G. Rinnooy Kan,et al.  Bounds and Heuristics for Capacitated Routing Problems , 1985, Math. Oper. Res..

[6]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[7]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[8]  Chou-Yuan Lee,et al.  Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics , 2003, IEEE Trans. Syst. Man Cybern. Part B.

[9]  Chou-Yuan Lee,et al.  A hybrid search algorithm with heuristics for resource allocation problem , 2005, Inf. Sci..

[10]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[11]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[12]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[13]  Wout Dullaert,et al.  A multi-parametric evolution strategies algorithm for vehicle routing problems , 2007, Expert Syst. Appl..

[14]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[15]  R. H. Mole,et al.  A Sequential Route-building Algorithm Employing a Generalised Savings Criterion , 1976 .

[16]  Nicos Christofides,et al.  Combinatorial optimization , 1979 .

[17]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[18]  H. L. Ong,et al.  An Assignment-Based Local Search Method for Solving Vehicle Routing Problems , 2005, Asia Pac. J. Oper. Res..

[19]  P. C. Yellow,et al.  A Computational Modification to the Savings Method of Vehicle Scheduling , 1970 .

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

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

[22]  Attahiru Sule Alfa,et al.  A 3-OPT based simulated annealing algorithm for vehicle routing problems , 1991 .

[23]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[24]  Chou-Yuan Lee,et al.  An immunity-based ant colony optimization algorithm for solving weapon-target assignment problem , 2002, Appl. Soft Comput..

[25]  I H Osman,et al.  Meta-Heuristics Theory and Applications , 2011 .

[26]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[27]  Catherine Roucairol,et al.  A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .

[28]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[29]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

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

[31]  Reginald R. Souleyrette,et al.  Implementing Vehicle Routing Models , 1990 .

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

[33]  Michel Gendreau,et al.  Path relinking for the vehicle routing problem , 2004, J. Heuristics.

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

[35]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[36]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[37]  James P. Kelly,et al.  A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem , 1996, Transp. Sci..