메뉴 건너뛰기




Volumn 344, Issue 2-3, 2005, Pages 243-278

Ant colony optimization theory: A survey

Author keywords

Ant colony optimization; Approximate algorithms; Combinatorial optimization; Convergence; Metaheuristics; Model based search; Stochastic gradient descent

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; RANDOM PROCESSES;

EID: 27644543634     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.05.020     Document Type: Article
Times cited : (1962)

References (67)
  • 1
    • 84972571328 scopus 로고
    • Growth transformations for functions on manifolds
    • L.E. Baum, and G.R. Sell Growth transformations for functions on manifolds Pacific J. Math. 27 2 1968 211 227
    • (1968) Pacific J. Math. , vol.27 , Issue.2 , pp. 211-227
    • Baum, L.E.1    Sell, G.R.2
  • 2
    • 84974695644 scopus 로고    scopus 로고
    • Toward the formal foundation of ant programming
    • M. Dorigo, G. Di Caro, M. Sampels (Eds.), Ant Algorithms, Proc. ANTS 2002, Third Internat. Workshop Springer, Berlin, Germany
    • M. Birattari, G. Di Caro, M. Dorigo, Toward the formal foundation of ant programming, in: M. Dorigo, G. Di Caro, M. Sampels (Eds.), Ant Algorithms, Proc. ANTS 2002, Third Internat. Workshop, Lecture Notes in Computer Science, Vol. 2463, Springer, Berlin, Germany, 2002, pp. 188-201.
    • (2002) Lecture Notes in Computer Science , vol.2463 , pp. 188-201
    • Birattari, M.1    Di Caro, G.2    Dorigo, M.3
  • 3
    • 17644389026 scopus 로고    scopus 로고
    • Theoretical and practical aspects of ant colony optimization
    • Akademische Verlagsgesellschaft Aka GmbH, Berlin, Germany
    • C. Blum, Theoretical and Practical Aspects of Ant Colony Optimization, Dissertations in Artificial Intelligence, Vol. 282, Akademische Verlagsgesellschaft Aka GmbH, Berlin, Germany, 2004.
    • (2004) Dissertations in Artificial Intelligence , vol.282
    • Blum, C.1
  • 4
    • 9544220684 scopus 로고    scopus 로고
    • Beam-ACO - Hybridizing ant colony optimization with beam search: An application to open shop scheduling
    • C. Blum Beam-ACO - Hybridizing ant colony optimization with beam search: an application to open shop scheduling Comput. Oper. Res. 32 6 2005 1565 1591
    • (2005) Comput. Oper. Res. , vol.32 , Issue.6 , pp. 1565-1591
    • Blum, C.1
  • 5
    • 17644419860 scopus 로고    scopus 로고
    • Deception in ant colony optimization
    • M. Dorigo, M. Birattari, C. Blum, L.M. Gambardella, F. Mondada, T. Stützle (Eds.), Proc. ANTS 2004, Fourth Internat. Workshop on Ant Colony Optimization and Swarm Intelligence Springer, Berlin, Germany
    • C. Blum, M. Dorigo, Deception in ant colony optimization, in: M. Dorigo, M. Birattari, C. Blum, L.M. Gambardella, F. Mondada, T. Stützle (Eds.), Proc. ANTS 2004, Fourth Internat. Workshop on Ant Colony Optimization and Swarm Intelligence, Lecture Notes in Computer Science, Vol. 3172, Springer, Berlin, Germany, 2004, pp. 119-130.
    • (2004) Lecture Notes in Computer Science , vol.3172 , pp. 119-130
    • Blum, C.1    Dorigo, M.2
  • 6
    • 1842483279 scopus 로고    scopus 로고
    • The hyper-cube framework for ant colony optimization
    • C. Blum, and M. Dorigo The hyper-cube framework for ant colony optimization IEEE Trans. Systems, Man, Cybernet.-Part B 34 2 2004 1161 1172
    • (2004) IEEE Trans. Systems, Man, Cybernet.-Part B , vol.34 , Issue.2 , pp. 1161-1172
    • Blum, C.1    Dorigo, M.2
  • 7
    • 17644402086 scopus 로고    scopus 로고
    • Search bias in ant colony optimization: On the role of competition-balanced systems
    • C. Blum, and M. Dorigo Search bias in ant colony optimization: on the role of competition-balanced systems IEEE Trans. Evol. Comput. 9 2 2005 159 174
    • (2005) IEEE Trans. Evol. Comput. , vol.9 , Issue.2 , pp. 159-174
    • Blum, C.1    Dorigo, M.2
  • 8
    • 0344236266 scopus 로고    scopus 로고
    • Metaheuristics in combinatorial optimization: Overview and conceptual comparison
    • C. Blum, and A. Roli Metaheuristics in combinatorial optimization: overview and conceptual comparison ACM Comput. Surveys 35 3 2003 268 308
    • (2003) ACM Comput. Surveys , vol.35 , Issue.3 , pp. 268-308
    • Blum, C.1    Roli, A.2
  • 9
    • 0345671714 scopus 로고    scopus 로고
    • Ant Colony Optimization for FOP shop scheduling: A case study on different pheromone representations
    • IEEE Computer Society Press Los Alamitos, CA
    • C. Blum, and M. Sampels Ant Colony Optimization for FOP shop scheduling: a case study on different pheromone representations Proc. 2002 Congr. on Evolutionary Computation (CEC'02) Vol. 2 2002 IEEE Computer Society Press Los Alamitos, CA 1558 1563
    • (2002) Proc. 2002 Congr. on Evolutionary Computation (CEC'02) , vol.2 , pp. 1558-1563
    • Blum, C.1    Sampels, M.2
  • 10
    • 84944315692 scopus 로고    scopus 로고
    • When model bias is stronger than selection pressure
    • J.J. Merelo Guervós et al. (Eds.), Proc. PPSN-VII, Seventh Internat. Conf. on Parallel Problem Solving from Nature Springer, Berlin, Germany
    • C. Blum, M. Sampels, When model bias is stronger than selection pressure, in: J.J. Merelo Guervós et al. (Eds.), Proc. PPSN-VII, Seventh Internat. Conf. on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Vol. 2439, Springer, Berlin, Germany, 2002, pp. 893-902.
    • (2002) Lecture Notes in Computer Science , vol.2439 , pp. 893-902
    • Blum, C.1    Sampels, M.2
  • 11
    • 18744404504 scopus 로고    scopus 로고
    • An ant colony optimization algorithm for shop scheduling problems
    • C. Blum, and M. Sampels An ant colony optimization algorithm for shop scheduling problems J. Math. Model. Algorithms 3 3 2004 285 308
    • (2004) J. Math. Model. Algorithms , vol.3 , Issue.3 , pp. 285-308
    • Blum, C.1    Sampels, M.2
  • 13
    • 0021819411 scopus 로고
    • A thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
    • V. Černý A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm J. Optim. Theory Appl. 45 1985 41 51
    • (1985) J. Optim. Theory Appl. , vol.45 , pp. 41-51
    • Černý, V.1
  • 15
    • 78049265488 scopus 로고    scopus 로고
    • MIMIC: Finding optima by estimating probability densities
    • M.C. Mozer, M.I. Jordan, T. Petsche (Eds.) MIT Press, Cambridge, MA
    • J.S. de Bonet, C.L. Isbell Jr., P. Viola, MIMIC: finding optima by estimating probability densities, in: M.C. Mozer, M.I. Jordan, T. Petsche (Eds.), Adv. Neural Inform. Process. Systems, Vol. 7 (NIPS7), MIT Press, Cambridge, MA, 1997, pp. 424-431.
    • (1997) Adv. Neural Inform. Process. Systems , vol.7 , Issue.NIPS7 , pp. 424-431
    • De Bonet, J.S.1    Isbell Jr., C.L.2    Viola, P.3
  • 16
    • 0002671561 scopus 로고
    • Analyzing deception in trap functions
    • L.D. Whitley Morgan Kaufmann San Mateo, CA
    • K. Deb, and D.E. Goldberg Analyzing deception in trap functions L.D. Whitley Foundations of Genetic Algorithms Vol. 2 1993 Morgan Kaufmann San Mateo, CA 93 108
    • (1993) Foundations of Genetic Algorithms , vol.2 , pp. 93-108
    • Deb, K.1    Goldberg, D.E.2
  • 17
    • 84947905083 scopus 로고    scopus 로고
    • Ant colony optimization for the total weighted tardiness problem
    • M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J.J. Merelo, H.-P. Schwefel (Eds.), Proc. PPSN-VI, Sixth Internat. Conf. on Parallel Problem Solving from Nature Springer, Berlin, Germany
    • M.L. den Besten, T. Stützle, M. Dorigo, Ant colony optimization for the total weighted tardiness problem, in: M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J.J. Merelo, H.-P. Schwefel (Eds.), Proc. PPSN-VI, Sixth Internat. Conf. on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Vol. 1917, Springer, Berlin, Germany, 2000, pp. 611-620.
    • (2000) Lecture Notes in Computer Science , vol.1917 , pp. 611-620
    • Den Besten, M.L.1    Stützle, T.2    Dorigo, M.3
  • 19
    • 0000873984 scopus 로고    scopus 로고
    • AntNet: Distributed stigmergetic control for communications networks
    • G. Di Caro, and M. Dorigo AntNet: distributed stigmergetic control for communications networks J. Artif. Intel. Res. 9 1998 317 365
    • (1998) J. Artif. Intel. Res. , vol.9 , pp. 317-365
    • Di Caro, G.1    Dorigo, M.2
  • 21
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • M. Dorigo, and L.M. Gambardella Ant colony system: a cooperative learning approach to the traveling salesman problem IEEE Trans. Evol. Comput. 1 1 1997 53 66
    • (1997) IEEE Trans. Evol. Comput. , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 22
    • 0004061426 scopus 로고
    • Positive feedback as a search strategy
    • Dipartimento di Elettronica, Politecnico di Milano, Italy
    • M. Dorigo, V. Maniezzo, A. Colorni, Positive feedback as a search strategy, Tech. Report 91-016, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1991.
    • (1991) Tech. Report , vol.91 , Issue.16
    • Dorigo, M.1    Maniezzo, V.2    Colorni, A.3
  • 25
    • 84878633359 scopus 로고    scopus 로고
    • Updating ACO pheromones using stochastic gradient ascent and cross-entropy methods
    • S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, G.R. Raidl (Eds.), Applications of Evolutionary Computing Springer, Berlin, Germany
    • M. Dorigo, M. Zlochin, N. Meuleau, M. Birattari, Updating ACO pheromones using stochastic gradient ascent and cross-entropy methods, in: S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, G.R. Raidl (Eds.), Applications of Evolutionary Computing, Proc. EvoWorkshops 2002, Lecture Notes in Computer Science, Vol. 2279, Springer, Berlin, Germany, 2002, pp. 21-30.
    • (2002) Proc. EvoWorkshops 2002 , vol.2279 , pp. 21-30
    • Dorigo, M.1    Zlochin, M.2    Meuleau, N.3    Birattari, M.4
  • 27
    • 0036682205 scopus 로고    scopus 로고
    • Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
    • C. Gagné, W.L. Price, and M. Gravel Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times J. Oper. Res. Soc. 53 2002 895 906
    • (2002) J. Oper. Res. Soc. , vol.53 , pp. 895-906
    • Gagné, C.1    Price, W.L.2    Gravel, M.3
  • 28
    • 0038546313 scopus 로고    scopus 로고
    • Ant colony system hybridized with a new local search for the sequential ordering problem
    • L.M. Gambardella, and M. Dorigo Ant colony system hybridized with a new local search for the sequential ordering problem INFORMS J. Comput. 12 3 2000 237 255
    • (2000) INFORMS J. Comput. , vol.12 , Issue.3 , pp. 237-255
    • Gambardella, L.M.1    Dorigo, M.2
  • 29
    • 0001834106 scopus 로고    scopus 로고
    • MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows
    • D. Corne M. Dorigo F. Glover McGraw-Hill London, UK
    • L.M. Gambardella, É.D. Taillard, and G. Agazzi MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows D. Corne M. Dorigo F. Glover New Ideas in Optimization 1999 McGraw-Hill London, UK 63 76
    • (1999) New Ideas in Optimization , pp. 63-76
    • Gambardella, L.M.1    Taillard, É.D.2    Agazzi, G.3
  • 30
    • 0000411214 scopus 로고
    • Tabu search - Part i
    • F. Glover Tabu search - Part I ORSA J. Comput. 1 3 1989 190 206
    • (1989) ORSA J. Comput. , vol.1 , Issue.3 , pp. 190-206
    • Glover, F.1
  • 31
    • 0001724713 scopus 로고
    • Tabu search - Part II
    • F. Glover Tabu search - Part II ORSA J. Comput. 2 1 1990 4 32
    • (1990) ORSA J. Comput. , vol.2 , Issue.1 , pp. 4-32
    • Glover, F.1
  • 33
    • 0004215426 scopus 로고    scopus 로고
    • Kluwer Academic Publishers Dordrecht
    • F. Glover, and M. Laguna Tabu Search 1997 Kluwer Academic Publishers Dordrecht
    • (1997) Tabu Search
    • Glover, F.1    Laguna, M.2
  • 34
    • 0002076808 scopus 로고
    • Simple genetic algorithms and the minimal deceptive problem
    • L. Davis Pitman London, UK
    • D.E. Goldberg Simple genetic algorithms and the minimal deceptive problem L. Davis Genetic Algorithms and Simulated Annealing 1987 Pitman London, UK 74 88
    • (1987) Genetic Algorithms and Simulated Annealing , pp. 74-88
    • Goldberg, D.E.1
  • 35
    • 84892004674 scopus 로고    scopus 로고
    • Pheromone modification strategies for ant algorithms applied to dynamic TSP
    • E.J.W. Boers, J. Gottlieb, P.L. Lanzi, R.E. Smith, S. Cagnoni, E. Hart, G.R. Raidl, H. Tijink (Eds.), Applications of Evolutionary Computing: Proc. EvoWorkshops 2001 Springer, Berlin, Germany
    • M. Guntsch, M. Middendorf, Pheromone modification strategies for ant algorithms applied to dynamic TSP, in: E.J.W. Boers, J. Gottlieb, P.L. Lanzi, R.E. Smith, S. Cagnoni, E. Hart, G.R. Raidl, H. Tijink (Eds.), Applications of Evolutionary Computing: Proc. EvoWorkshops 2001, Lecture Notes in Computer Science, Vol. 2037, Springer, Berlin, Germany, 2001, pp. 213-222.
    • (2001) Lecture Notes in Computer Science , vol.2037 , pp. 213-222
    • Guntsch, M.1    Middendorf, M.2
  • 36
    • 0005311385 scopus 로고    scopus 로고
    • A generalized convergence result for the graph-based ant system metaheuristic
    • Department of Statistics and Decision Support Systems, University of Vienna, Austria
    • W.J. Gutjahr, A generalized convergence result for the graph-based ant system metaheuristic, Tech. Report 99-09, Department of Statistics and Decision Support Systems, University of Vienna, Austria, 1999.
    • (1999) Tech. Report , vol.99 , Issue.9
    • Gutjahr, W.J.1
  • 37
    • 0033738317 scopus 로고    scopus 로고
    • A graph-based ant system and its convergence
    • W.J. Gutjahr A graph-based ant system and its convergence Future Gen. Comput. Systems 16 9 2000 873 888
    • (2000) Future Gen. Comput. Systems , vol.16 , Issue.9 , pp. 873-888
    • Gutjahr, W.J.1
  • 38
    • 0037118189 scopus 로고    scopus 로고
    • ACO algorithms with guaranteed convergence to the optimal solution
    • W.J. Gutjahr ACO algorithms with guaranteed convergence to the optimal solution Inform. Process. Lett. 82 3 2002 145 153
    • (2002) Inform. Process. Lett. , vol.82 , Issue.3 , pp. 145-153
    • Gutjahr, W.J.1
  • 41
    • 0003155122 scopus 로고
    • Fitness distance correlation as a measure of problem difficulty for genetic algorithms
    • L.J. Eshelman Kaufman, LosAltos, CA
    • T. Jones, and S. Forrest Fitness distance correlation as a measure of problem difficulty for genetic algorithms L.J. Eshelman Proc. 6th Internat. Conf. on Genetic Algorithms Kaufman, LosAltos, CA 1995 184 192
    • (1995) Proc. 6th Internat. Conf. on Genetic Algorithms , pp. 184-192
    • Jones, T.1    Forrest, S.2
  • 43
    • 84879523147 scopus 로고    scopus 로고
    • Theoretical aspects of evolutionary computing
    • Springer, Berlin, Germany
    • L. Kallel, B. Naudts, A. Rogers (Eds.), Theoretical Aspects of Evolutionary Computing, Natural Computing Series, Springer, Berlin, Germany, 2001.
    • (2001) Natural Computing Series
    • Kallel, L.1    Naudts, B.2    Rogers, A.3
  • 44
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi Optimization by simulated annealing Science 220 4598 1983 671 680
    • (1983) Science , vol.220 , Issue.4598 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.D.2    Vecchi, M.P.3
  • 46
    • 0000127689 scopus 로고    scopus 로고
    • Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
    • V. Maniezzo Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem INFORMS J. Comput. 11 4 1999 358 369
    • (1999) INFORMS J. Comput. , vol.11 , Issue.4 , pp. 358-369
    • Maniezzo, V.1
  • 47
    • 0033312934 scopus 로고    scopus 로고
    • The ant system applied to the quadratic assignment problem
    • V. Maniezzo, and A. Colorni The ant system applied to the quadratic assignment problem IEEE Trans. Data Knowledge Eng. 11 5 1999 769 778
    • (1999) IEEE Trans. Data Knowledge Eng. , vol.11 , Issue.5 , pp. 769-778
    • Maniezzo, V.1    Colorni, A.2
  • 48
    • 84898000703 scopus 로고    scopus 로고
    • Modelling ACO: Composed permutation problems
    • M. Dorigo, G. Di Caro, M. Sampels (Eds.), Ant Algorithms, Proc. ANTS 2002, Third Internat. Workshop Springer, Berlin, Germany
    • D. Merkle, M. Middendorf, Modelling ACO: composed permutation problems, in: M. Dorigo, G. Di Caro, M. Sampels (Eds.), Ant Algorithms, Proc. ANTS 2002, Third Internat. Workshop, Lecture Notes in Computer Science, Vol. 2463, Springer, Berlin, Germany, 2002, pp. 149-162.
    • (2002) Lecture Notes in Computer Science , vol.2463 , pp. 149-162
    • Merkle, D.1    Middendorf, M.2
  • 49
    • 0036715610 scopus 로고    scopus 로고
    • Modelling the dynamics of ant colony optimization algorithms
    • D. Merkle, and M. Middendorf Modelling the dynamics of ant colony optimization algorithms Evol. Comput. 10 3 2002 235 262
    • (2002) Evol. Comput. , vol.10 , Issue.3 , pp. 235-262
    • Merkle, D.1    Middendorf, M.2
  • 50
    • 77049119750 scopus 로고    scopus 로고
    • Competition controlled pheromone update for ant colony optimization
    • M. Dorigo, M. Birattari, C. Blum, L.M. Gambardella, F. Mondada, T. Stützle (Eds.), Proc. ANTS 2004, Fourth Internat. Workshop on Ant Colony Optimization and Swarm Intelligence Springer, Berlin, Germany
    • D. Merkle, M. Middendorf, Competition controlled pheromone update for ant colony optimization, in: M. Dorigo, M. Birattari, C. Blum, L.M. Gambardella, F. Mondada, T. Stützle (Eds.), Proc. ANTS 2004, Fourth Internat. Workshop on Ant Colony Optimization and Swarm Intelligence, Lecture Notes in Computer Science, Vol. 3172, Springer, Berlin, Germany, 2004, pp. 95-105.
    • (2004) Lecture Notes in Computer Science , vol.3172 , pp. 95-105
    • Merkle, D.1    Middendorf, M.2
  • 51
    • 0036672003 scopus 로고    scopus 로고
    • Ant colony optimization for resource-constrained project scheduling
    • D. Merkle, M. Middendorf, and H. Schmeck Ant colony optimization for resource-constrained project scheduling IEEE Trans. Evol. Comput. 6 4 2002 333 346
    • (2002) IEEE Trans. Evol. Comput. , vol.6 , Issue.4 , pp. 333-346
    • Merkle, D.1    Middendorf, M.2    Schmeck, H.3
  • 52
    • 0036369544 scopus 로고    scopus 로고
    • Ant colony optimization and stochastic gradient descent
    • N. Meuleau, and M. Dorigo Ant colony optimization and stochastic gradient descent Artif. Life 8 2 2002 103 121
    • (2002) Artif. Life , vol.8 , Issue.2 , pp. 103-121
    • Meuleau, N.1    Dorigo, M.2
  • 54
    • 26944450617 scopus 로고    scopus 로고
    • Search bias in constructive metaheuristics and implications for ant colony optimization
    • M. Dorigo, M. Birattari, C. Blum, L.M. Gambardella, F. Mondada, T. Stützle (Eds.), Proc. ANTS 2004, Fourth Internat. Workshop on Ant Colony Optimization and Swarm Intelligence Springer, Berlin, Germany
    • J. Montgomery, M. Randall, T. Hendtlass, Search bias in constructive metaheuristics and implications for ant colony optimization, in: M. Dorigo, M. Birattari, C. Blum, L.M. Gambardella, F. Mondada, T. Stützle (Eds.), Proc. ANTS 2004, Fourth Internat. Workshop on Ant Colony Optimization and Swarm Intelligence, Lecture Notes in Computer Science, Vol. 3172, Springer, Berlin, Germany, 2004, pp. 391-398.
    • (2004) Lecture Notes in Computer Science , vol.3172 , pp. 391-398
    • Montgomery, J.1    Randall, M.2    Hendtlass, T.3
  • 55
    • 84958959530 scopus 로고    scopus 로고
    • From recombination of genes to the estimation of distributions
    • H.-M. Voigt, W. Ebeling, I. Rechenberg, H.-P. Schwefel (Eds.), Proc. 4th Conf. on Parallel Problem Solving from Nature, PPSN IV Springer, Berlin
    • H. Mühlenbein, G. Paaß. From recombination of genes to the estimation of distributions, in: H.-M. Voigt, W. Ebeling, I. Rechenberg, H.-P. Schwefel (Eds.), Proc. 4th Conf. on Parallel Problem Solving from Nature, PPSN IV, Lecture Notes in Computer Science, Vol. 1411, Springer, Berlin, 1996, pp. 178-187.
    • (1996) Lecture Notes in Computer Science , vol.1411 , pp. 178-187
    • Mühlenbein, H.1    Paaß, G.2
  • 59
    • 0346009088 scopus 로고    scopus 로고
    • D-ants: Savings based ants divide and conquer the vehicle routing problems
    • M. Reimann, K. Doerner, and R.F. Hartl D-ants: savings based ants divide and conquer the vehicle routing problems Comput. Oper. Res. 31 4 2004 563 591
    • (2004) Comput. Oper. Res. , vol.31 , Issue.4 , pp. 563-591
    • Reimann, M.1    Doerner, K.2    Hartl, R.F.3
  • 60
    • 0000016172 scopus 로고
    • A stochastic approximation method
    • G.E. Robbins, and H. Monroe A stochastic approximation method Ann. Math. Statist. 22 1951 400 407
    • (1951) Ann. Math. Statist. , vol.22 , pp. 400-407
    • Robbins, G.E.1    Monroe, H.2
  • 61
    • 0012307417 scopus 로고    scopus 로고
    • Combinatorial optimization, cross-entropy, ants and rare events
    • Kluwer Academic Publishers Dordrecht, The Netherlands
    • R.Y. Rubinstein Combinatorial optimization, cross-entropy, ants and rare events Stochastic Optimization: Algorithms and Applications 2001 Kluwer Academic Publishers Dordrecht, The Netherlands 303 364
    • (2001) Stochastic Optimization: Algorithms and Applications , pp. 303-364
    • Rubinstein, R.Y.1
  • 62
    • 77049083677 scopus 로고    scopus 로고
    • ACO for continuous and mixed-variable optimization
    • M. Dorigo, M. Birattari, C. Blum, L.M. Gambardella, F. Mondada, T. Stützle (Eds.), Proc. ANTS 2004, Fourth Internat. Workshop on Ant Colony Optimization and Swarm Intelligence Springer, Berlin, Germany
    • K. Socha, ACO for continuous and mixed-variable optimization, in: M. Dorigo, M. Birattari, C. Blum, L.M. Gambardella, F. Mondada, T. Stützle (Eds.), Proc. ANTS 2004, Fourth Internat. Workshop on Ant Colony Optimization and Swarm Intelligence, Lecture Notes in Computer Science, Vol. 3172, Springer, Berlin, Germany, 2004, pp. 25-36.
    • (2004) Lecture Notes in Computer Science , vol.3172 , pp. 25-36
    • Socha, K.1
  • 63
    • 35248838786 scopus 로고    scopus 로고
    • Ant algorithms for the university course timetabling problem with regard to the state-of-the-art
    • G. Raidl et al. (Ed.), Applications of Evolutionary Computing
    • K. Socha, M. Sampels, M. Manfrin, Ant algorithms for the university course timetabling problem with regard to the state-of-the-art, in: G. Raidl et al. (Ed.), Applications of Evolutionary Computing, Proc. EvoWorkshops 2003, Vol. 2611, 2003, pp. 334-345.
    • (2003) Proc. EvoWorkshops 2003 , vol.2611 , pp. 334-345
    • Socha, K.1    Sampels, M.2    Manfrin, M.3
  • 65
    • 0036670452 scopus 로고    scopus 로고
    • A short convergence proof for a class of ACO algorithms
    • T. Stützle, and M. Dorigo A short convergence proof for a class of ACO algorithms IEEE Trans. Evol. Comput. 6 4 2002 358 365
    • (2002) IEEE Trans. Evol. Comput. , vol.6 , Issue.4 , pp. 358-365
    • Stützle, T.1    Dorigo, M.2
  • 67
    • 0344644472 scopus 로고    scopus 로고
    • Model-based search for combinatorial optimization: A critical survey
    • M. Zlochin, M. Birattari, N. Meuleau, and M. Dorigo Model-based search for combinatorial optimization: a critical survey Ann. Oper. Res. 131 1-4 2004 373 395
    • (2004) Ann. Oper. Res. , vol.131 , Issue.1-4 , pp. 373-395
    • Zlochin, M.1    Birattari, M.2    Meuleau, N.3    Dorigo, M.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.