Abstract
In emergent airdropping, there are some special requirements for the vehicle routing problem. The airdropping personnel and equipment, geographically scattered, should be delivered simultaneously to an assigned place by a fleet of vehicles as soon as possible. In this case the objective is not to minimize the total distance traveled or the number of vehicles as usual, but to minimize the time of all personnel and equipment delivered with a given vehicle number. Ant colony system with maximum-minimum limit is adopted to solve these problems. The distance of each route is computed and the route with maximum distance is chosen. The objective is to minimize the maximum distance. The algorithm is implemented and tested on some instances. The results demonstrate the effectiveness of the method.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, X., Qi, H., Chen, Y. (2006). Optimization of Special Vehicle Routing Problem Based on Ant Colony System. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence. ICIC 2006. Lecture Notes in Computer Science(), vol 4114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-37275-2_153
Download citation
DOI: https://doi.org/10.1007/978-3-540-37275-2_153
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37274-5
Online ISBN: 978-3-540-37275-2
eBook Packages: Computer ScienceComputer Science (R0)