Fast Taboo Search Algorithm for Solving Min-Max Vehicle Routing Problem
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.
KeywordsFast taboo search algorithm Min-Max Vehicle Routing Problem Insertion method three operations
Unable to display preview. Download preview PDF.
- 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.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
- 4.Xia, L.: Research on Vehicle Routing Problem. PhD thesis of Huazhong University of Science and Technology, p. 24-44 (2007)Google Scholar