Cooperative Ant Colonies for Optimizing Resource Allocation in Transportation
In this paper we propose an ACO approach, where two colonies of ants aim to optimize total costs in a transportation network. This main objective consists of two sub goals, namely fleet size minimization and minimization of the vehicle movement costs, which are conflicting for some regions of the solution space. Thus, our two ant colonies optimize one of these sub-goals each and communicate information concerning solution quality. Our results show the potential of the proposed method.
KeywordsPriority Rule Vehicle Movement Slave Population Pheromone Information Full Truckload
Unable to display preview. Download preview PDF.
- 5.Stützle, T. and Dorigo, M.: ACO Algorithms for the Quadratic Assignment Problem. In: Corne, D., Dorigo, M. and Glover, F. (Eds.): New Ideas in Optimization. Mc Graw-Hill, London (1999)Google Scholar
- 6.Colorni, A., Dorigo, M. and Maniezzo, V.: Distributed Optimization by Ant Colonies. In: Varela, F. and Bourgine, P. (Eds.): Proc. Europ. Conf. Artificial Life. Elsevier, Amsterdam (1991)Google Scholar
- 7.Dorigo, M.: Optimization, Learning and Natural Algorithms. Doctoral Dissertation. Politecnico di Milano, Italy (1992)Google Scholar
- 10.Gambardella, L.M., Taillard, E. and Agazzi, G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In: Corne, D., Dorigo, M. and Glover, F. (Eds.): New Ideas in Optimization. McGraw-Hill, London (1999)Google Scholar
- 12.Doerner, K.F., Gronalt, M., Hartl, R.F., and Reimann, M.: Optimizing Pickup and Delivery Operations in a Hub Network with Ant Systems. POM Working Paper 07/2000Google Scholar