A time-based pheromone approach for the ant system
- First Online:
- 181 Downloads
The ant system (AS) is a metaheuristic approach originally developed for solving the traveling salesman problem. AS has been successfully applied to various hard combinatorial optimization problems and different variants have been proposed in the literature. In this paper, we introduce a time-based pheromone approach for AS (TbAS). Due to this nature TbAS is applicable to routing problems involving time-windows. The novelty in TbAS is the multi-layer pheromone network structure which implicitly utilizes the service time information associated with the customers as a heuristic information. To investigate the performance of TbAS, we use the well-known vehicle routing problem with time-windows as our testbed and we conduct an extensive computational study using the Solomon (Algorithms for the vehicle routing and scheduling problems with time window constraints 35:254–265, 1987) instances. Our results reveal that the proposed time-based pheromone approach is effective in obtaining good quality solutions.
KeywordsAnt systems Vehicle routing Time windows Metaheuristics Ant colony optimization
Unable to display preview. Download preview PDF.
- 11.Dorigo M., Stützle T.: Ant Coloy Optimization. The MIT Press, London (2004)Google Scholar
- 16.Gambardella L.M., Taillard E., Agazzi G.: MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: Corne, D., Dorigo, M., Glover, F. (eds) New Ideas in Optimization., pp. 63–76. McGraw-Hill, London (1999)Google Scholar
- 18.Jung, S., Moon, B-R.: A hybrid genetic algorithm for the vehicle routing problem with time windows. In: Proceedings of the 2002 Genetic and Evolutionary Computation Conference (GECCO 2002), pp. 1309–1316. Morgan Kaufmann Publishers, San Francisco (2002)Google Scholar
- 26.Rousseau, L.M., Gendreau, M., Pesant, G.: Using constraint-based operators with variable neighborhood search to solve the vehicle routing problem with time windows. In: Proceedings of the 1999 Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR’99), pp. 43–58. Ferrara (1999)Google Scholar
- 28.Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.F. (eds.) Principles and Practice of Constraint Programming (CP’98). Lect. Notes Comput. Sci. Springer, Berlin, pp. 417–431 (1998)Google Scholar
- 30.Stützle, T., Hoos, H.H.: The MAX-MIN ant system and local search for the traveling salesman problem. In: Bäck, T., Michalewicz, Z., Yao, X. (eds.) Proceedings of the 1997 IEEE International Conference on Evolutionary Computation (ICEC’97), pp. 309–314. IEEE Press, Piscataway (1997)Google Scholar
- 33.Zufferey, N.: Optimization by ant algorithms: possible roles for an individual ant. Optim. Lett. (2011). doi:10.1007/s11590-011-0327-x