Study on Tabu Search Algorithm for Min-Max Vehicle Routing Problem


Article Preview

The paper is focused on the Min-Max Vehicle Routing Problem (MMVRP). Tabu search algorithm is an algorithm based on neighborhood search. According to the features of the problem, the essay centered the longest route to construct neighborhood structure. For the operation, 1-move and 2-opt were applied, it can also fasten the speed of convergence, and boost the search efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples.



Edited by:

Helen Zhang and David Jin






C. Y. Ren "Study on Tabu Search Algorithm for Min-Max Vehicle Routing Problem", Applied Mechanics and Materials, Vols. 63-64, pp. 160-163, 2011

Online since:

June 2011





[1] Liu Xia. Research on Vehicle Routing Problem. PhD thesis of Huazhong University of Science and Technology, (2007), pp.24-44.

[2] Chawathe, S.S. Organizing Hot-Spot Police Patrol Routes. 2007 IEEE International Conference on Intelligence and Security Informatics, (2007), pp.79-86.

DOI: 10.1109/isi.2007.379538

[3] Applegate D., Cook W., Dash S. Solution of a min-max vehicle routing problem. Informs Journal on Computing, Vol. 14(2002), pp.132-143.

DOI: 10.1287/ijoc.

[4] Michael Molloy, Bruce Reed. A Bound on the Strong Chromatic Index of a Graph [J]. Journal of Combinatorial Theory, Series B, Vol. 69(1997), pp.103-109.

DOI: 10.1006/jctb.1997.1724

[5] Arkin E.M., Hassin R., Levin A. Approximations for minimum and min-max vehicle routing problems. Algorithms archive, Vol. 59(2006), pp.1-18.

DOI: 10.1016/j.jalgor.2005.01.007

[6] Esther M. Arkin, Refael Hassin, Asaf Levin. Approximations for Minimum and Min-max Vehicle Routing Problems. Journal of Algorithms, Vol. 59(2005), pp.1-16.

DOI: 10.1016/j.jalgor.2005.01.007

In order to see related information, you need to Login.