Research on New Tabu Search Algorithm for Min-Max Vehicle Routing Problem - Advanced Research on Computer Education, Simulation and Modeling - page 84

5 Conclusions
Therefore, it is more practical significance and value so as to reduce operating cost
and improve economic benefit.
Acknowledgment
This paper is supported by project of Heilongjiang Provincial Education Department
of Science & Technology (No. 11551332).
References
1. Gajpal, Y., Abad, P.L.: Multi-ant colony system (MACS) for a vehicle routing problem with
backhauls. European Journal of Operational Research 196, 102-117 (2009)
2. Ai, T.J., Kachitvichyanukul, V.: A particle swarm optimization for the vehicle routing prob-
lem with simultaneous pickup and delivery. Computers and Operations Research 36, 1693-
1702 (2009)
3. Serna, C.R.D., Bonrostro, J.P.: Minmax vehicle routing problems: application to school
transport in the province of Burgos (Spain). In: International Conference on Computer-
aided Scheduling of Public Transport, vol. 505, pp. 297-317 (2000)
4. Molloy, M., Reed, B.: A Bound on the Strong Chromatic Index of a Graph. Journal of
Combinatorial Theory, Series B 69, 103-109 (1997)
5. Arkin, E.M., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle
routing problems. Algorithms Archive 59, 1-18 (2006)
6. Xia, L.: Research on Vehicle Routing Problem. PhD thesis of Huazhong University of Sci-
ence and Technology, pp. 24-44 (2007)