Fast Taboo Search Algorithm for Solving Min-Max Vehicle Routing Problem

  • Chunyu Ren
Part of the Communications in Computer and Information Science book series (CCIS, volume 236)


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.


Fast taboo search algorithm Min-Max Vehicle Routing Problem Insertion method three operations 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chawathe, S.S.: Organizing Hot-Spot Police Patrol Routes. In: International Conference on Intelligence and Security Informatics, vol. 1, pp. 79–86 (2007)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Applegate, D., Cook, W., Dash, S.: Solution of a min-max vehicle routing problem. Informs Journal on Computing 14, 132–143 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Xia, L.: Research on Vehicle Routing Problem. PhD thesis of Huazhong University of Science and Technology, p. 24-44 (2007)Google Scholar
  5. 5.
    Molloy, M., Reed, B.: A Bound on the Strong Chromatic Index of a Graph. Journal of Combinatorial Theory, Series B 69, 103–109 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Arkin, E.M., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems. Algorithms archive 59, 1–18 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Ozdamar, L., Yi, W.: Greedy Neighborhood Search for Disaster Relief and Evacuation Logistics. Intelligent Systems 23, 14–23 (2008)CrossRefGoogle Scholar
  8. 8.
    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)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Chunyu Ren
    • 1
  1. 1.School of Information science and technologyHeilongjiang UniversityHarbinChina

Personalised recommendations