Abstract
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigated. Whereas in a prior publication, theoretical convergence of S-ACO to the globally optimal solution has been demonstrated, the present article is concerned with an experimental study of S-ACO on two stochastic problems of fixed-routes type: First, a pre-test is carried out on the probabilistic traveling salesman problem. Then, more comprehensive tests are performed for a traveling salesman problem with time windows (TSPTW) in the case of stochastic service times. As a yardstick, a stochastic simulated annealing (SSA) algorithm has been implemented for comparison. Both approaches are tested at randomly generated problem instances of different size. It turns out that S-ACO outperforms the SSA approach on the considered test instances. Some conclusions for fine-tuning S-ACO are drawn.
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
Alrefaei, M.H., Andradóttir, S.: A simulated annealing algorithm with constant temperature for discrete stochastic optimization. Management Sci. 45, 748–764 (1999)
Alrefaei, M.H., Andradóttir, S.: A modification of the stochastic ruler method for discrete stochastic optimization. European J. of Operational Research 133, 160–182 (2001)
Bauer, A., Bullnheimer, B., Hartl, R.F., Strauss, C.: Minimizing Total Tardiness on a Single Machine Using Ant Colony Optimization. Central European Journal of Operations Research 8, 125–141 (2000)
Bianchi, L., Gambardella, L.M., Dorigo, M.: Solving the homogeneous probabilistic travelling salesman problem by the ACO metaheuristic. In: Proc. ANTS 2002, 3rd Int. Workshop on Ant Algorithms (2002), pp. 177–187 (2002)
Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Sounis, F.: VRP with TimeWindows. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 157–194. SIAM Monographs, Philadelphia (2002)
Dorigo, M., Di Caro, G.: The Ant Colony Optimization metaheuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 11–32. McGraw– Hill, New York (1999)
Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a colony of cooperating agents. IEEE Trans. on Systems, Man, and Cybernetics 26, 1–13 (1996)
Fu, M.C.: Optimization for simulation: theory vs. practice. INFORMS J. on Computing 14, 192–215 (2002)
Fitzpatrick, J.M., Grefenstette, J.J.: Genetic algorithms in noisy environments. Machine Learning 3, 101–120 (1988)
Gutjahr, W.J.: A graph–based Ant System and its convergence. Future Generation Computer Systems 16, 873–888 (2000)
Gutjahr, W.J.: A converging ACO algorithm for stochastic combinatorial optimization. In: Albrecht, A.A., Steinhöfel, K. (eds.) SAGA 2003. LNCS, vol. 2827, pp. 10–25. Springer, Heidelberg (2003)
Gutjahr, W.J., Pflug, G.: Simulated annealing for noisy cost functions. J. of Global Optimization 8, 1–13 (1996)
Hadjiconstantinou, E., Roberts, D.: Routing Under Uncertainty: An Application in the Scheduling of Field Service Engineers. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 331–352. SIAM Monographs, Philadelphia (2002)
Homem-de Mello, T.: Variable-sample methods for stochastic optimization. ACM Trans. on Modeling and Computer Simulation 13, 108–133 (2003)
Jaillet, P.: Probabilistic Travelling Salesman Problems, PhD thesis, MIT, Cambridge, MA (1985)
Kleywegt, A., Shapiro, A., Homem-de-Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12, 479–502 (2001)
Merkle, D., Middendorf, M.: Modelling the Dynamics of Ant Colony Optimization Algorithms. Evolutionary Computation 10, 235–262 (2002)
Norkin, V.I., Ermoliev, Y.M., Ruszczynski, A.: On optimal allocation of indivisibles under uncertainty. Operations Research 46, 381–395 (1998)
Shi, L., Olafsson, S.: Nested partition method for global optimization. Operations Reseacrh 48, 390–407
Stützle, T., Hoos, H.H.: The MAX-MIN Ant system and local search for the travelling salesman problem. In: Baeck, T., Michalewicz, Z., Yao, X. (eds.) Proc. ICEC 1997 (Int. Conf. on Evolutionary Computation), pp. 309–314 (1997)
Zlochin, M., Dorigo, M.: Model-based search for combinatorial optimization: a comparative study. In: Proc. PPSN (Parallel Problem Solving from Nature) 2002, pp. 651–664 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gutjahr, W.J. (2004). S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2004. Lecture Notes in Computer Science, vol 3172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28646-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-28646-2_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22672-7
Online ISBN: 978-3-540-28646-2
eBook Packages: Springer Book Archive