메뉴 건너뛰기




Volumn 31, Issue 7-8, 2007, Pages 805-814

Industrial applications of the ant colony optimization algorithm

Author keywords

Ant colony optimization; Combinatorial optimization; Hybrid algorithms; Job shop scheduling problem; Node arc graphs; Traveling salesperson problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INDUSTRIAL APPLICATIONS; SCHEDULING; TRAVELING SALESMAN PROBLEM;

EID: 33845735022     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-005-0254-z     Document Type: Article
Times cited : (63)

References (28)
  • 1
    • 0033084695 scopus 로고    scopus 로고
    • Ant algorithms for discrete optimization
    • Cambridge: MIT Press, Cambridge
    • Dorigo M, Di Caro G, Gambardella LM (1999) Ant algorithms for discrete optimization, Artificial life, Cambridge: MIT Press, Cambridge 5(2):137-172
    • (1999) Artificial Life , vol.5 , Issue.2 , pp. 137-172
    • Dorigo, M.1    Di Caro, G.2    Gambardella, L.M.3
  • 2
    • 9544220684 scopus 로고    scopus 로고
    • Beam-ACO - Hybridizing ant colony optimization with beam search: An application to open shop scheduling
    • Blum C (2005) Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput Oper Res 32(6):1565-1591
    • (2005) Comput Oper Res , vol.32 , Issue.6 , pp. 1565-1591
    • Blum, C.1
  • 3
    • 1842483279 scopus 로고    scopus 로고
    • The hyper-cube framework for ant colony optimization
    • Blum C, Dorigo M (2004) The hyper-cube framework for ant colony optimization. IEEE Trans Syst, Man Cybern Part B 34 (2):1161-1172
    • (2004) IEEE Trans Syst, Man Cybern Part B , vol.34 , Issue.2 , pp. 1161-1172
    • Blum, C.1    Dorigo, M.2
  • 4
    • 0345671714 scopus 로고    scopus 로고
    • Ant colony optimization for FOP shop scheduling: A case study on different pheromone representations
    • Blum C, Sampels M (2002) Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations. Proc 2002 Congress on Evolutionary Computation (CEC'02), pp 1558-1563
    • (2002) Proc 2002 Congress on Evolutionary Computation (CEC'02) , pp. 1558-1563
    • Blum, C.1    Sampels, M.2
  • 5
    • 18744404504 scopus 로고    scopus 로고
    • An ant colony optimization algorithm for shop scheduling problems
    • Blum C, Sampels M (2004) An ant colony optimization algorithm for shop scheduling problems. J Math Model Algorithms 3(3):285-308
    • (2004) J Math Model Algorithms , vol.3 , Issue.3 , pp. 285-308
    • Blum, C.1    Sampels, M.2
  • 11
    • 0030212629 scopus 로고    scopus 로고
    • The job shop scheduling problem: Conventional and new solution techniques
    • Blazewicz J, Domschke W, Pesch E (1996) The job shop scheduling problem: conventional and new solution techniques. Eur J Operl Res 93:1-33
    • (1996) Eur J Operl Res , vol.93 , pp. 1-33
    • Blazewicz, J.1    Domschke, W.2    Pesch, E.3
  • 13
    • 0000131281 scopus 로고
    • Algorithms for solving production-scheduling problems
    • Giffler B, Thompson GL (1960) Algorithms for solving production- scheduling problems. Oper Res 8:487-503
    • (1960) Oper Res , vol.8 , pp. 487-503
    • Giffler, B.1    Thompson, G.L.2
  • 17
    • 0026126118 scopus 로고
    • A computational study of the job-shop scheduling problem
    • Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. Oper Res Soc Am J Comput 3 (2):149-156
    • (1991) Oper Res Soc Am J Comput , vol.3 , Issue.2 , pp. 149-156
    • Applegate, D.1    Cook, W.2
  • 18
    • 0009665224 scopus 로고    scopus 로고
    • Job-shop scheduling by simulated annealing combined with deterministic local search
    • Osman IH, Kelly JP (eds.). Kluwer, Boston
    • Yamada T, Nakano R (1996) Job-shop scheduling by simulated annealing combined with deterministic local search. In: Osman IH, Kelly JP (eds.). Meta-heuristics: theory & applications. Kluwer, Boston, pp 237-248
    • (1996) Meta-heuristics: Theory & Applications , pp. 237-248
    • Yamada, T.1    Nakano, R.2
  • 21
    • 0001822278 scopus 로고    scopus 로고
    • A new rank based version of the ant system - A computational study
    • Bullnheimer B, Hartl RF, and Strauss C (1997) A new rank based version of the ant system - a computational study. Central Eur J Oper Res Econ 7(1):25-38
    • (1997) Central Eur J Oper Res Econ , vol.7 , Issue.1 , pp. 25-38
    • Bullnheimer, B.1    Hartl, R.F.2    Strauss, C.3
  • 22
    • 33845782720 scopus 로고
    • TSPLIB
    • TSPLIB (1995) http://www.iwr.uni-heidelberg.de/groups/comopt/software/ TSPLIB95/
    • (1995)
  • 25
    • 0026153980 scopus 로고
    • Maintenance scheduling by using simulated annealing
    • Satoh T, Nara K (1991) Maintenance scheduling by using simulated annealing. IEEE Trans Power Syst 6(2):850-857
    • (1991) IEEE Trans Power Syst , vol.6 , Issue.2 , pp. 850-857
    • Satoh, T.1    Nara, K.2
  • 26
    • 0020914923 scopus 로고
    • Optimization by simulated annealing: A preliminary computational study for the TSP
    • Roberts S, Banks J, Schmeiser B (eds.). IEEE
    • Skiscim CC, Golden BL (1983) Optimization by simulated annealing: a preliminary computational study for the TSP. In: Roberts S, Banks J, Schmeiser B (eds.). Proc 1983 Winter Simulation Conference. IEEE pp 523-535
    • (1983) Proc 1983 Winter Simulation Conference , pp. 523-535
    • Skiscim, C.C.1    Golden, B.L.2
  • 27
    • 0001947856 scopus 로고
    • Probabilistic learning combination of local job-shop scheduling rules
    • Muth JF, Thompson GL (eds.). Prentice-Hall, Englewood Cliffs, NJ
    • Fisher H Thompson GL (1963) Probabilistic learning combination of local job-shop scheduling rules. In: Muth JF, Thompson GL (eds.). Industrial scheduling. Prentice-Hall, Englewood Cliffs, NJ pp 236-237
    • (1963) Industrial Scheduling , pp. 236-237
    • Fisher, H.1    Thompson, G.L.2
  • 28
    • 34249973653 scopus 로고
    • A survey of priority rule-based scheduling
    • Haupt R (1989) A survey of priority rule-based scheduling. OR Spektrum. 11:3-16
    • (1989) OR Spektrum. , vol.11 , pp. 3-16
    • Haupt, R.1


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