The paper introduces ACO/F-Race, an algorithm for tackling combinatorial optimization problems under uncertainty. The algorithm is based on ant colony optimization and on F-Race. The latter is a general method for the comparison of a number of candidates and for the selection of the best one according to a given criterion. Some experimental results on the PROBABILISTIC TRAVELING SALESMAN PROBLEM are presented.
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.
Reference
D. J. Bertsimas, P. Jaillet, and A. Odoni. A priori optimization. Operations Research, 38:1019–1033, 1990.
L. Bianchi. Ant Colony Optimization and Local Search for the Probabilistic Traveling Salesman Problem: A Case Study in Stochastic Combinatorial Optimization. PhD thesis, Universit’e Libre de Bruxelles, Brussels, Belgium, 2006.
L. Bianchi, L. M. Gambardella, and M. Dorigo. Solving the homogeneous probabilistic travelling salesman problem by the ACO metaheuristic. In M. Dorigo, G. Di Caro, and M. Sampels, editors, Ant Algorithms, 3rd International Workshop, ANTS 2002, volume 2463 of LNCS, pages 176–187, Berlin, Germany, 2002. Springer-Verlag.
M. Birattari. Race. R package, 2003. http://cran.r-project.org.
M. Birattari. The Problem of Tuning Metaheuristics as Seen from a Machine Learning Perspective. PhD thesis, Universit’e Libre de Bruxelles, Brussels, Belgium, 2004.
M. Birattari, T. Stützle, L. Paquete, and K. Varrentrapp. A racing algorithm for configuring metaheuristics. In W. B. Langdon, E. Cantú-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M. A. Potter, A. C. Schultz, J. F. Miller, E. Burke, and N. Jonoska, editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 11–18, San Francisco, CA, USA, 2002. Morgan Kaufmann.
W. J. Conover. Practical Nonparametric Statistics. John Wiley & Sons, New York, NY, USA, third edition, 1999.
M. Dorigo and T. Stützle. Ant Colony Optimization. MIT Press, Cambridge, MA, USA, 2004.
W. J. Gutjahr. A converging ACO algorithm for stochastic combinatorial optimization In A. Albrecht, and T. Steinhöfl, editors, Proc. SAGA 2003, volume 2827 of LNCS, pages 10–25, Berlin, Germany, 2003. Springer-Verlag.
W. J. Gutjahr. S-ACO: An ant based approach to combinatorial optimization under uncertainity. In M. Dorigo, M. Birattari, C. Blum, L. M. Gambardella, F. Mondada, and T. Stützle, editors, Ant Colony Optimization and Swarm Intelligence, 4th International Workshop, ANTS 2004, volume 3172 of LNCS, pages 238–249, Berlin, Germany, 2004. Springer-Verlag.
P. Jaillet. Probabilistic Travelling Salesman Problems. PhD thesis, The Massachusetts Institute of Technology, Cambridge, MA, USA, 1995.
D. S. Johnson, L. A. McGeoch, C. Rego, and F. Glover. 8th DIMACS implementation challenge. http://www.research.att.com/ dsj/chtsp/, 2001.
O. Maron and A. W. Moore. Hoeffding races: Accelerating model selection search for classification and function approximation. In J. D. Cowan, G. Tesauro, and J. Alspector, editors, Advances in Neural Information Processing Systems, volume 6, pages 59–66, San Francisco, CA, USA, 1994. Morgan Kaufmann.
A. W. Moore and M. S. Lee. Efficient algorithms for minimizing cross validation error. In Proceedings of the Eleventh International Conference on Machine Learning, pages 190–198, San Francisco, CA, USA, 1994. Morgan Kaufmann.
T. Stützle. ACOTSP, version 1.0. http://www.aco-metaheuristic.org/aco-code/, 2002.
T. Stützle and H. H. Hoos. MAX–MIN ant system. Future Generation Computer Systems, 16(8):889–914, 2000.
S. Holm. A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics, volume 6, 65–70,1979.
F. Rossi and I. Gavioli. Aspects of heuristic methods in the probabilistic traveling salesman problem. Advanced School on Stochastics in Combinatorial Optimization. pages 214–227. World Scientific, Hackensack, NJ, USA, 1987.
S. M. Weiss and C. Kulikowski Computer systems that learn. Classification and prediction methods from statistics neural nets machine learning and expert systems. Morgan Kaufmann, San Mateo, CA, USA, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Birattari, M., Balaprakash, P., Dorigo, M. (2007). The ACO/F-Race Algorithm for Combinatorial Optimization Under Uncertainty. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R.F., Reimann, M. (eds) Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 39. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-71921-4_10
Download citation
DOI: https://doi.org/10.1007/978-0-387-71921-4_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-71919-1
Online ISBN: 978-0-387-71921-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)