메뉴 건너뛰기




Volumn 2, Issue , 2004, Pages 1916-1923

Heuristics for ant colony optimisation using the generalised assignment problem

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION; EJECTION CHAINS; LOCAL SEARCH OPERATORS; TRANSITION OPERATORS;

EID: 4344608505     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (16)

References (20)
  • 1
    • 33751381295 scopus 로고    scopus 로고
    • Online
    • J Beasley. OR-Library. Online at http://www.ms.ic.ac.uk/info.html, 2004.
    • OR-library
    • Beasley, J.1
  • 3
    • 0030735527 scopus 로고    scopus 로고
    • A genetic algorithm for the generalised assignment problem
    • P. Chu and J. Beasley. A genetic algorithm for the generalised assignment problem. Computers and Operations Research, 24:17-23, 1997.
    • (1997) Computers and Operations Research , vol.24 , pp. 17-23
    • Chu, P.1    Beasley, J.2
  • 5
    • 84947905083 scopus 로고    scopus 로고
    • Ant colony optimization for the total weighted tardiness problem
    • M. den Besten, T. Stützle, and M. Dorigo. Ant colony optimization for the total weighted tardiness problem. In Lecture Notes in Computer Science, volume 1917, pages 611-620, 2000.
    • (2000) Lecture Notes in Computer Science , vol.1917 , pp. 611-620
    • Den Besten, M.1    Stützle, T.2    Dorigo, M.3
  • 6
    • 0002012598 scopus 로고    scopus 로고
    • The ant colony optimization meta-heuristic
    • D. Come, M. Dorigo, and F. Glover, editors. McGraw-Hill, London
    • M. Dorigo and G. Di Caro. The ant colony optimization meta-heuristic. In D. Come, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11-32. McGraw-Hill, London, 1999.
    • (1999) New Ideas in Optimization , pp. 11-32
    • Dorigo, M.1    Di Caro, G.2
  • 7
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • M. Dorigo and L. Gambardella. Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53-66, 1997.
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.2
  • 8
    • 33846295159 scopus 로고    scopus 로고
    • The ant colony optimization metaheuristic: Algorithms, applications and advances
    • F. Glover and G. Kochen-berger, editors. Kluwer Academic Publishers, Norwell, MA
    • M. Dorigo and T. Stützle. The ant colony optimization metaheuristic: Algorithms, applications and advances. In F. Glover and G. Kochen-berger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, pages 251-285. Kluwer Academic Publishers, Norwell, MA, 2002.
    • (2002) Handbook of Metaheuristics, Volume 57 of International Series in Operations Research & Management Science , vol.57 , pp. 251-285
    • Dorigo, M.1    Stützle, T.2
  • 10
    • 56149117630 scopus 로고    scopus 로고
    • Ant colony optimisation and local search for bin packing and cutting stock problems
    • submitted
    • J. Levine and F. Ducatelle. Ant colony optimisation and local search for bin packing and cutting stock problems. Journal of the Operational Research Society (submitted), 2002.
    • (2002) Journal of the Operational Research Society
    • Levine, J.1    Ducatelle, F.2
  • 11
    • 4344574820 scopus 로고    scopus 로고
    • Adapative search heuristics for the generalized assignment problem
    • European Chapter on Metaheuristics
    • H. Lourenco and D. Serra. Adapative search heuristics for the generalized assignment problem. Working Paper 2002-01, European Chapter on Metaheuristics, 2002.
    • (2002) Working Paper 2002-01
    • Lourenco, H.1    Serra, D.2
  • 14
    • 34249754951 scopus 로고
    • Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
    • I. Osman. Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches. OR Spektrum, 17:211-225, 1995.
    • (1995) OR Spektrum , vol.17 , pp. 211-225
    • Osman, I.1
  • 15
    • 23044531918 scopus 로고    scopus 로고
    • Feasibility restoration for iterative meta-heuristic search algorithms
    • Springer-Verlag, Berlin
    • M. Randall. Feasibility restoration for iterative meta-heuristic search algorithms. In Lecture Notes in Artificial Intelligence, volume 2358, pages 168-178. Springer-Verlag, Berlin, 2002.
    • (2002) Lecture Notes in Artificial Intelligence , vol.2358 , pp. 168-178
    • Randall, M.1
  • 16
    • 4344610009 scopus 로고    scopus 로고
    • A systematic strategy to incorporate intensification and diversification into ant colony optimisation
    • Canberra, Australia
    • M. Randall. A systematic strategy to incorporate intensification and diversification into ant colony optimisation. In Proceedings of the Australian Conference on Artificial Life, Canberra, Australia, 2003.
    • (2003) Proceedings of the Australian Conference on Artificial Life
    • Randall, M.1
  • 20
    • 0003386121 scopus 로고    scopus 로고
    • The MAX - MIN Ant System and local search for combinatorial optimization problems
    • S. Voss, S. Martello, I. Osman, and C. Roucairol, editors, Kluwer Academic Publishers, Boston, MA
    • T. Stützte and H. Hoos. The MAX - MIN Ant System and local search for combinatorial optimization problems. In S. Voss, S. Martello, I. Osman, and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 313-329, Kluwer Academic Publishers, Boston, MA, 1998.
    • (1998) Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization , pp. 313-329
    • Stützte, T.1    Hoos, H.2


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