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

Article Preview

Abstract:

The paper is focused on the Min-Max Vehicle Routing Problem. And solve this type of problems utilizing improved tabu search algorithm from the overall situation. According to the features of the problem, the essay centered the longest route to construct neighborhood structure. For the operation, 1-exchange 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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

178-181

Citation:

Online since:

August 2011

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Yunjun Han, Xiaohong Guan, Leyuan Shi . Optimal supply location selection and routing for emergency material delivery with uncertain demands. 2010 International Conference on Information Networking and Automation, Vol. 1(2010), pp.87-92.

DOI: 10.1109/icina.2010.5636428

Google Scholar

[2] Serna C R D, Bonrostro J P. Minmax vehicle routing problems: application to school transport in the province of Burgos. International Conference on Computer-aided Scheduling of Public Transport, Vol. 505(2000), pp.297-317.

DOI: 10.1007/978-3-642-56423-9_17

Google Scholar

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

Google Scholar

[4] 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

Google Scholar

[5] Ozdamar, L., Wei Yi. Greedy Neighborhood Search for Disaster Relief and Evacuation Logistics . Intelligent Systems, Vol. 23(2008), pp.14-23.

DOI: 10.1109/mis.2008.7

Google Scholar

[6] David Applegate; William Cook; Sanjeeb Dash; Andre Rohe. Solution of a min-max vehicle routing problem. INFORMS Journal on Computing, Vol. 14(2002), pp.132-143.

DOI: 10.1287/ijoc.14.2.132.118

Google Scholar