Abstract
The paper is focused on the Min-Max Vehicle Routing Problem. According to the features of the problem, fast taboo search algorithm is used to get the optimization solution from the overall situation. Firstly, it applies newly improved insertion method to construct initial solution in order to improve the feasibility of the solution. Secondly, it centers the longest route to design three operations for fastening the speed of convergence and efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples for solving practical problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chawathe, S.S.: Organizing Hot-Spot Police Patrol Routes. In: International Conference on Intelligence and Security Informatics, vol. 1, pp. 79–86 (2007)
Han, Y., Guan, X., Shi, L.: Optimal supply location selection and routing for emergency material delivery with uncertain demands. In: International Conference on Information Networking and Automation, vol. 1, pp. 87–92 (2010)
Applegate, D., Cook, W., Dash, S.: Solution of a min-max vehicle routing problem. Informs Journal on Computing 14, 132–143 (2002)
Xia, L.: Research on Vehicle Routing Problem. PhD thesis of Huazhong University of Science and Technology, p. 24-44 (2007)
Molloy, M., Reed, B.: A Bound on the Strong Chromatic Index of a Graph. Journal of Combinatorial Theory, Series B 69, 103–109 (1997)
Arkin, E.M., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems. Algorithms archive 59, 1–18 (2006)
Ozdamar, L., Yi, W.: Greedy Neighborhood Search for Disaster Relief and Evacuation Logistics. Intelligent Systems 23, 14–23 (2008)
Corberan, A., Fernandez, E., Laguna, M., Marti, R.: Heuristic solutions to the problem of routing school buses with multiple objectives. Journal of the Operational Research Society 53, 427–435 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ren, C. (2011). Fast Taboo Search Algorithm for Solving Min-Max Vehicle Routing Problem. In: Zhu, M. (eds) Information and Management Engineering. ICCIC 2011. Communications in Computer and Information Science, vol 236. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24097-3_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-24097-3_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24096-6
Online ISBN: 978-3-642-24097-3
eBook Packages: Computer ScienceComputer Science (R0)