S-ACO: An ant-based approach to combinatorial optimization under uncertainty

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3172 LNCS, Issue , 2004, Pages 238-249

  Gutjahr, Walter J ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; SIMULATED ANNEALING; STOCHASTIC SYSTEMS; SWARM INTELLIGENCE; TRAVELING SALESMAN PROBLEM; ALGORITHMS; ARTIFICIAL INTELLIGENCE; OPTIMIZATION; VEHICLE ROUTING;

ANT COLONY OPTIMIZATION (ACO); OPTIMIZATION UNDER UNCERTAINTY; PROBABILISTIC TRAVELING SALESMAN PROBLEM; PROBLEM INSTANCES; SIMULATION-BASED ALGORITHMS; STOCHASTIC COMBINATORIAL OPTIMIZATION; STOCHASTIC PROBLEMS; TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS; OPTIMAL SOLUTIONS;

ANT COLONY OPTIMIZATION;

EID: 77049108477     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28646-2_21     Document Type: Conference Paper

References (21)

1. Alrefaei, M.H., Andradóttir, S., "A simulated annealing algorithm with constant temperature for discrete stochastic optimization", Management Sci. 45 (1999), pp. 748-764.
2. Alrefaei, M.H., Andradóttir, S., "A modification of the stochastic ruler method for discrete stochastic optimization", European J. of Operational Research 133 (2001), pp. 160-182.
3. 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 (2000), pp. 125-141.
4. Bianchi, L., Gambardella. L.M., Dorigo, M., "Solving the homogeneous probabilistic travelling salesman problem by the ACO metaheuristic", Proc. ANTS '02, 3rd Int. Workshop on Ant Algorithms (2002), pp. 177-187.
5. Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Sounis, F., "VRP with TimeWindows", in: The Vehicle Routing Problem, P. Toth and D. Vigo (eds.), SIAM Monographs: Philadelphia (2002), pp. 157-194.
6. Dorigo, M., Di Caro, G., "The Ant Colony Optimization metaheuristic", in: New Ideas in Optimization, D. Corne, M. Dorigo, F. Glover (eds.), pp. 11-32, McGraw-Hill (1999).
7. Dorigo, M., Maniezzo, V., Colorni, A., "The Ant System: Optimization by a colony of cooperating agents", IEEE Trans. on Systems, Man, and Cybernetics 26 (1996), pp. 1-13.
8. Fu, M.C., "Optimization for simulation: theory vs. practice", INFORMS J. on Computing 14 (2002), pp. 192-215.
9. Fitzpatrick, J.M., Grefenstette, J.J., "Genetic algorithms in noisy environments", Machine Learning 3 (1988), pp. 101-120.
10. Gutjahr, W.J., "A graph-based Ant System and its convergence", Future Generation Computer Systems 16 (2000), pp. 873-888.
11. Gutjahr, W.J., "A converging ACO algorithm for stochastic combinatorial optimization", Proc. SAGA 2003 (Stochastic Algorithms: Foundations and Applications), eds.: A. Albrecht and K. Steinhöfl, Springer LNCS 2827 (2003), pp. 10-25.
12. Gutjahr, W.J., Pflug, G., "Simulated annealing for noisy cost functions", J. of Global Optimization, 8 (1996), pp. 1-13.
13. Hadjiconstantinou, E., Roberts, D., "Routing Under Uncertainty: An Application in the Scheduling of Field Service Engineers", in: The Vehicle Routing Problem, P. Toth and D. Vigo (eds.), SIAM Monographs: Philadelphia (2002), pp. 331-352.
14. Homem-de Mello, T., "Variable-sample methods for stochastic optimization", ACM Trans. on Modeling and Computer Simulation 13 (2003), pp. 108-133.
15. Jaillet, P., Probabilistic Travelling Salesman Problems, PhD thesis, MIT, Cambridge, MA (1985).
16. Kleywegt, A., Shapiro, A., Homem-de-Mello, T., "The sample average approximation method for stochastic discrete optimization", SIAM J. Optim. 12 (2001), pp. 479-502.
17. Merkle, D., Middendorf, M., "Modelling the Dynamics of Ant Colony Optimization Algorithms", Evolutionary Computation 10 (2002), pp. 235-262.
18. Norkin, V.I., Ermoliev, Y.M., Ruszczynski, A., "On optimal allocation of indivisibles under uncertainty", Operations Research 46 (1998), pp. 381-395.
19. Shi, L., Olafsson, S., "Nested partition method for global optimization", Operations Reseacrh 48, pp. 390-407.
20. Stützle, T., Hoos, H.H., "The MAX-MIN Ant system and local search for the travelling salesman problem", in: T. Baeck, Z. Michalewicz and X. Yao (eds.), Proc. ICEC '97 (Int. Conf. on Evolutionary Computation) (1997), pp. 309-314.
21. Zlochin, M., Dorigo, M., "Model-based search for combinatorial optimization: a comparative study", Proc. PPSN (Parallel Problem Solving from Nature) '02 (2002), pp. 651-664.