Abstract
The travelling salesman problem with time windows is a difficult optimization problem that appears, for example, in logistics. Among the possible objective functions we chose the optimization of the makespan. For solving this problem we propose a so-called Beam-ACO algorithm, which is a hybrid method that combines ant colony optimization with beam search. In general, Beam-ACO algorithms heavily rely on accurate and computationally inexpensive bounding information for differentiating between partial solutions. In this work we use stochastic sampling as an alternative to bounding information. Our results clearly demonstrate that the proposed algorithm is currently a state-of-the-art method for the tackled problem.
This work was supported by grant TIN2007-66523 (FORMALISM) of the Spanish government. Moreover, Christian Blum acknowledges support from the Ramón y Cajal program of the Spanish Ministry of Science and Innovation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ohlmann, J.W., Thomas, B.W.: A compressed-annealing heuristic for the traveling salesman problem with time windows. INFORMS J. Comput. 19(1), 80–90 (2007)
Savelsbergh, M.W.P.: Local search in routing problems with time windows. Annals of Operations Research 4(1), 285–305 (1985)
Cheng, C.B., Mao, C.P.: A modified ant colony system for solving the travelling salesman problem with time windows. Mathematical and Computer Modelling 46, 1225–1235 (2007)
Gambardella, L., Taillard, E.D., 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)
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. Comp. & Op. Res. 32, 1565–1591 (2005)
Blum, C.: Beam-ACO for simple assembly line balancing. INFORMS J. Comput. 20(4), 618–627 (2008)
Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. Int. J. Prod. Res. 26, 297–307 (1988)
López-Ibáñez, M., Blum, C.: Beam-ACO based on stochastic sampling: A case study on the TSP with time windows. In: Battiti, R., et al. (eds.) Proceedings of LION3. LNCS. Springer, Berlin (2009)
Juillé, H., Pollack, J.B.: A sampling-based heuristic for tree search applied to grammar induction. In: Proceedings of AAAI 1998, pp. 776–783. MIT press, Cambridge (1998)
Ruml, W.: Incomplete tree search using adaptive probing. In: Proceedings of IJCAI 2001, pp. 235–241. IEEE press, Los Alamitos (2001)
Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE T. Syst. Man Cyb. – Part B 34(2), 1161–1172 (2004)
Potvin, J.Y., Bengio, S.: The vehicle routing problem with time windows part II: Genetic search. INFORMS J. Comput. 8, 165–172 (1996)
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., Thiruvady, D., Ernst, A.T., Meyer, B. (2009). Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows. In: Cotta, C., Cowling, P. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2009. Lecture Notes in Computer Science, vol 5482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01009-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-01009-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01008-8
Online ISBN: 978-3-642-01009-5
eBook Packages: Computer ScienceComputer Science (R0)