메뉴 건너뛰기




Volumn 39, Issue , 2007, Pages 189-203

The ACO/F-Race algorithm for combinatorial optimization under uncertainty

Author keywords

Ant colony optimization; Combinatorial optimization under uncertainty

Indexed keywords


EID: 84888618661     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-71921-4_10     Document Type: Article
Times cited : (26)

References (19)
  • 3
    • 84974719224 scopus 로고    scopus 로고
    • 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, Berlin, Germany, 2002. Springer-Verlag
    • 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.
    • LNCS , pp. 176-187
    • Bianchi, L.1    Gambardella, L.M.2    Dorigo, M.3
  • 6
    • 14644421108 scopus 로고    scopus 로고
    • 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, San Francisco, CA, USA, 2002. Morgan Kaufmann
    • 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.
    • Proceedings of the Genetic and Evolutionary Computation Conference , pp. 11-18
    • Birattari, M.1    Stützle, T.2    Paquete, L.3    Varrentrapp, K.4
  • 9
    • 35248846073 scopus 로고    scopus 로고
    • A converging ACO algorithm for stochastic combinatorial optimization
    • In A. Albrecht, and T. Steinhöfl, editors, Proc. SAGA 2003, volume 2827 of, Berlin, Germany, 2003. Springer-Verlag
    • 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.
    • LNCS , pp. 10-25
    • Gutjahr, W.J.1
  • 10
    • 77049108477 scopus 로고    scopus 로고
    • 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, Berlin, Germany, 2004. 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.
    • LNCS , pp. 238-249
    • Gutjahr, W.J.1
  • 11
    • 0003408281 scopus 로고
    • PhD thesis, The Massachusetts Institute of Technology, Cambridge, MA, USA
    • P. Jaillet. Probabilistic Travelling Salesman Problems. PhD thesis, The Massachusetts Institute of Technology, Cambridge, MA, USA, 1995.
    • (1995) Probabilistic Travelling Salesman Problems
    • Jaillet, P.1
  • 13
    • 0001923944 scopus 로고    scopus 로고
    • Hoeffding races: Accelerating model selection search for classification and function approximation
    • In J.D. Cowan, G. Tesauro, and J. Alspector, editors, volume 6, San Francisco, CA, USA, 1994. Morgan Kaufmann
    • 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.
    • Advances in Neural Information Processing Systems , pp. 59-66
    • Maron, O.1    Moore, A.W.2
  • 17
    • 0002294347 scopus 로고
    • A simple sequentially rejective multiple test procedure
    • S. Holm. A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics, volume 6, 65-70, 1979.
    • (1979) Scandinavian Journal of Statistics , vol.6 , pp. 65-70
    • Holm, S.1
  • 18
    • 0242454495 scopus 로고
    • Aspects of heuristic methods in the probabilistic traveling salesman problem
    • World Scientific, Hackensack, NJ, USA
    • 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.
    • (1987) Advanced School on Stochastics in Combinatorial Optimization , pp. 214-227
    • Rossi, F.1    Gavioli, I.2


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