메뉴 건너뛰기




Volumn 10, Issue 3, 2002, Pages 235-262

Modeling the dynamics of ant colony optimization

Author keywords

ACO algorithms; ACO model; Ant colony optimization; Dynamic behavior; Fixed points

Indexed keywords

PHEROMONE;

EID: 0036715610     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/106365602760234090     Document Type: Article
Times cited : (76)

References (20)
  • 1
    • 1542352666 scopus 로고    scopus 로고
    • Evolution Determined by Trajectory of Expected Populations: Sufficient Conditions, with Application to Crossover
    • Bruce, I. D. and Simpson, R. J. (1999). Evolution Determined by Trajectory of Expected Populations: Sufficient Conditions, with Application to Crossover. Evolutionary Computation, 7(2):151-171.
    • (1999) Evolutionary Computation , vol.7 , Issue.2 , pp. 151-171
    • Bruce, I.D.1    Simpson, R.J.2
  • 3
    • 0002012598 scopus 로고    scopus 로고
    • The ant colony optimization meta-heuristic
    • Corne, D., Dorigo, M., and Glover, F., editors, McGraw-Hill, London, UK
    • Dorigo, M. and Di Caro, G. (1999). The ant colony optimization meta-heuristic. In Corne, D., Dorigo, M., and Glover, F., editors, New Ideas in Optimization, pages 11-32, McGraw-Hill, London, UK.
    • (1999) New Ideas in Optimization , pp. 11-32
    • Dorigo, M.1    Di Caro, G.2
  • 5
    • 0033738317 scopus 로고    scopus 로고
    • A graph-based Ant System and its convergence
    • Gutjahr, W. (2000). A graph-based Ant System and its convergence, Future Generation Computer Systems, 16:873-888.
    • (2000) Future Generation Computer Systems , vol.16 , pp. 873-888
    • Gutjahr, W.1
  • 6
    • 0037118189 scopus 로고    scopus 로고
    • ACO algorithms with guaranteed convergence to the optimal solution
    • Gutjahr, W. (2002). ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters, 82:145-153.
    • (2002) Information Processing Letters , vol.82 , pp. 145-153
    • Gutjahr, W.1
  • 7
    • 84958631637 scopus 로고    scopus 로고
    • An Ant Algorithm with a new Pheromone Evaluation Rule for Total Tardiness Problems
    • Cagrioni, S. et al., editors, Springer Verlag, Berlin, Germany
    • Merkle, D. and Middendorf, M. (2000). An Ant Algorithm with a new Pheromone Evaluation Rule for Total Tardiness Problems. In Cagrioni, S. et al., editors, Real-World Applications of Evolutionary Computing, Proceedings of EvoWorkshops 2000, LNCS, 1803:287-296, Springer Verlag, Berlin, Germany.
    • (2000) Real-World Applications of Evolutionary Computing, Proceedings of EvoWorkshops 2000, LNCS , vol.1803 , pp. 287-296
    • Merkle, D.1    Middendorf, M.2
  • 8
    • 84958047331 scopus 로고    scopus 로고
    • A New Approach to Solve Permutation Scheduling Problems with Ant Colony Optimization
    • Boers, E. J. W. et al., editors, Springer Verlag, Berlin, Germany
    • Merkle, D. and Middendorf, M. (2001a). A New Approach to Solve Permutation Scheduling Problems with Ant Colony Optimization. In Boers, E. J. W. et al., editors, Applications of Evolutionary Computing: Proceedings of EvoWorkshops 2001, LNCS, 2037:213-222, Springer Verlag, Berlin, Germany.
    • (2001) Applications of Evolutionary Computing: Proceedings of EvoWorkshops 2001, LNCS , vol.2037 , pp. 213-222
    • Merkle, D.1    Middendorf, M.2
  • 11
    • 2442466419 scopus 로고    scopus 로고
    • Royal Road Functions
    • Back, T., Fogel, D., and Michalewicz, Z., editors, Oxford University Press, Oxford, UK
    • Mitchell, M. and Forrest, S. (1997). Royal Road Functions. In Back, T., Fogel, D., and Michalewicz, Z., editors, Handbook of Evolutionary Computation. Oxford University Press, Oxford, UK.
    • (1997) Handbook of Evolutionary Computation
    • Mitchell, M.1    Forrest, S.2
  • 14
    • 4344704995 scopus 로고    scopus 로고
    • Modelling GA Dynamics
    • Kallel, L., Naudts, B., and Rogers, A., editors. Springer, Berlin, Germany
    • Prügel-Bennett, A. and Rogers, A. (2001). Modelling GA Dynamics. In Kallel, L., Naudts, B., and Rogers, A., editors. Theoretical Aspects of Evolutionary Computing, pages 59-86, Springer, Berlin, Germany.
    • (2001) Theoretical Aspects of Evolutionary Computing , pp. 59-86
    • Prügel-Bennett, A.1    Rogers, A.2
  • 15
    • 0347858792 scopus 로고
    • An Analysis of Genetic Algorithms Using Statistical Mechanics
    • Prügel-Bennett, A. and Shapiro, J. L. (1994). An Analysis of Genetic Algorithms Using Statistical Mechanics. Physical Review Letters, 72:1305-1309.
    • (1994) Physical Review Letters , vol.72 , pp. 1305-1309
    • Prügel-Bennett, A.1    Shapiro, J.L.2
  • 17
    • 0008438750 scopus 로고    scopus 로고
    • A short convergence proof for a class of ACO algorithms
    • IRIDIA, Universitè Libre de Bruxelles, Belgium
    • Stützle, T. and Dorigo, M. (2000). A short convergence proof for a class of ACO algorithms. Technical Report IRIDIA/2000-35, IRIDIA, Universitè Libre de Bruxelles, Belgium.
    • (2000) Technical Report IRIDIA/2000-35
    • Stützle, T.1    Dorigo, M.2
  • 18
    • 2642545291 scopus 로고    scopus 로고
    • A new Ant Colony Algorithm for the Job Shop Scheduling Problem
    • Morgan Kaufmann, San Francisco, California
    • Teich, T. et al. (2001). A new Ant Colony Algorithm for the Job Shop Scheduling Problem. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), page 803, Morgan Kaufmann, San Francisco, California.
    • (2001) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001) , pp. 803
    • Teich, T.1
  • 20
    • 0002817882 scopus 로고
    • Punctuated equilibria in genetic search
    • Vose, M. D. and Liepins, G. E. (1991). Punctuated equilibria in genetic search. Complex Systems, 5:31-44.
    • (1991) Complex Systems , vol.5 , pp. 31-44
    • Vose, M.D.1    Liepins, G.E.2


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