Abstract
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive bounding information for choosing between different partial solutions during the solution construction process. In this work we present the use of stochastic sampling as a useful alternative to bounding information in cases were computing accurate bounding information is too expensive. As a case study we choose the well-known travelling salesman problem with time windows. Our results clearly demonstrate that Beam-ACO, even when bounding information is replaced by stochastic sampling, may have important advantages over standard ACO algorithms.
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.
References
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Blum, C.: Beam-ACO–hybridizing ant colony optimization with beam search: an application to open shop scheduling. Computers & Operations Research 32, 1565–1591 (2005)
Blum, C.: Beam-ACO for simple assembly line balancing. INFORMS Journal on Computing 20(4), 618–627 (2008)
Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. International Journal of Production Research 26, 297–307 (1988)
Juillé, H., Pollack, J.B.: A sampling-based heuristic for tree search applied to grammar induction. In: Proceedings of AAAI 1998 – Fifteenth National Conference on Artificial Intelligence, pp. 776–783. MIT Press, Cambridge (1998)
Ruml, W.: Incomplete tree search using adaptive probing. In: Proceedings of IJCAI 2001 – Seventeenth International Joint Conference on Artificial Intelligence, pp. 235–241. IEEE Press, Los Alamitos (2001)
Savelsbergh, M.W.P.: Local search in routing problems with time windows. Annals of Operations Research 4(1), 285–305 (1985)
Ohlmann, J.W., Thomas, B.W.: A compressed-annealing heuristic for the traveling salesman problem with time windows. INFORMS Journal on Computing 19(1), 80–90 (2007)
Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics – Part B 34(2), 1161–1172 (2004)
Potvin, J.Y., Bengio, S.: The vehicle routing problem with time windows part II: Genetic search. INFORMS Journal on Computing 8, 165–172 (1996)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time windows. Operations Research 35, 254–265 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López-Ibáñez, M., Blum, C. (2009). Beam-ACO Based on Stochastic Sampling: A Case Study on the TSP with Time Windows. In: Stützle, T. (eds) Learning and Intelligent Optimization. LION 2009. Lecture Notes in Computer Science, vol 5851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11169-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-11169-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11168-6
Online ISBN: 978-3-642-11169-3
eBook Packages: Computer ScienceComputer Science (R0)