New Tabu Search Algorithm with Applied Technology for Capacitated Vehicle Routing Problem

Article Preview

Abstract:

This paper studies the vehicle routing problem. According to the characteristics of model, new tabu search algorithm is used to get the optimization solution. It applies newly improved insertion method to construct initial solution, to improve the feasibility of the solution; designs dual layered random operation to construct its neighborhood; applies auto adaptive tabu length to control the searching capability dynamically. At last, it uses simulated experiments to prove the effectiveness and feasibility of this algorithm, and provides clues for massively solving practical problems.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

395-398

Citation:

Online since:

December 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Fisher M L, Jaikumar R. A generalized assignment heuristic for vehicle routing. Networks, Vol. 11(1981), P. 109-124.

DOI: 10.1002/net.3230110205

Google Scholar

[2] Laporte G, Nobert Y, Desrocher M. Optimal routing under capacity and distance restrictions. Operations Research, Vol. 33(1985), P. 1050-1073.

DOI: 10.1287/opre.33.5.1050

Google Scholar

[3] Ergun, J. Orlin, A. Steele Feldman. Creating very large scale neighborhoods out of smaller ones by compounding move. Journal of Heuristics, Vol. 12(2006), P. 115-140.

DOI: 10.1007/s10732-006-5561-5

Google Scholar

[4] Lysgaard J, Letchford A N, Eglese R W. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming, Vol. 100(2004), P. 423-445.

DOI: 10.1007/s10107-003-0481-8

Google Scholar

[5] ZHAO Yan-wei, PENG Dian-jun, ZHANG Jing-ling, WU Bin. Quantum evolutionary algorithm for capacitated vehicle routing problem. Systems Engineering-Theory & Practice, Vol. 29(2009), P. 159-166.

Google Scholar

[6] Wu B, Wang W L, Zhao Y W, Xu X L, Yang F Y. A novel real number encoding method of particle swarm optimization for vehicle routing problem. The 6th World Congress on Intelligent Control and Automation, VOLS1-12, Conference Processing, Vol. (2006).

DOI: 10.1109/wcica.2006.1712972

Google Scholar

[7] Ali Haghania, Soojung Jung. A dynamic vehicle routing problem with time dependent travel times, Computers & Operations Research, Vol. 32(2005), P. 2959-2986.

DOI: 10.1016/j.cor.2004.04.013

Google Scholar

[8] Doris Seza, Cristian E Comes, Alfredo Nueza. Hybrid adaptive predictive control for the multi-vehicle dynamic pick up and delivery problem based on genetic algorithms and fuzzy clustering. Computers and Operations Research, Vol. 35(20048, P. 3412-3438.

DOI: 10.1016/j.cor.2007.01.025

Google Scholar

[9] Bent, R, P. Van Hentenryck. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science, Vol. 38(2004), P. 515-530.

DOI: 10.1287/trsc.1030.0049

Google Scholar

[10] Ganesh K, Narendran T T. A cluster and search heuristic to solve the vehicle routing problem with delivery and pick up. European Journal of Operational Research, Vol. 17(2007), P. 699-717.

DOI: 10.1016/j.ejor.2006.01.037

Google Scholar