메뉴 건너뛰기




Volumn 32, Issue 3, 2005, Pages 583-598

An ant algorithm for the single row layout problem in flexible manufacturing systems

Author keywords

Ant colony optimization; Facility layout; Heuristics; Single row layout

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; INFORMATION TECHNOLOGY; MACHINE COMPONENTS; MACHINE SHOP PRACTICE; MATERIALS HANDLING; NONLINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; PRODUCTION ENGINEERING;

EID: 4744374111     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2003.08.005     Document Type: Article
Times cited : (158)

References (27)
  • 2
    • 0023978605 scopus 로고
    • Machine layout problem in flexible manufacturing systems
    • Heragu S.S., Kusiak A. Machine layout problem in flexible manufacturing systems. Operations Research. 36(2):1988;258-268.
    • (1988) Operations Research , vol.36 , Issue.2 , pp. 258-268
    • Heragu, S.S.1    Kusiak, A.2
  • 5
    • 0031236990 scopus 로고    scopus 로고
    • Heuristics for single-row layout problems in flexible manufacturing systems
    • Braglia M. Heuristics for single-row layout problems in flexible manufacturing systems. Production Planning & Control. 8(6):1997;558-567.
    • (1997) Production Planning & Control , vol.8 , Issue.6 , pp. 558-567
    • Braglia, M.1
  • 8
    • 0016059755 scopus 로고
    • An efficient equipment layout algorithm
    • Neghabat F. An efficient equipment layout algorithm. Operations Research. 22:1974;622-628.
    • (1974) Operations Research , vol.22 , pp. 622-628
    • Neghabat, F.1
  • 9
    • 0023386457 scopus 로고
    • A heuristic procedure for the layout of a large number of facilities
    • Drezner Z. A heuristic procedure for the layout of a large number of facilities. Management Science. 33(7):1987;907-915.
    • (1987) Management Science , vol.33 , Issue.7 , pp. 907-915
    • Drezner, Z.1
  • 11
    • 0026826080 scopus 로고
    • Experimental analysis of simulated annealing based algorithms for the layout problem
    • Heragu S.S., Alfa A.S. Experimental analysis of simulated annealing based algorithms for the layout problem. European Journal of Operational Research. 57(2):1992;190-202.
    • (1992) European Journal of Operational Research , vol.57 , Issue.2 , pp. 190-202
    • Heragu, S.S.1    Alfa, A.S.2
  • 13
    • 4744362240 scopus 로고    scopus 로고
    • Optimization of a simulated-annealing-based heuristic for single row machine layout problem by genetic algorithm
    • Braglia M. Optimization of a simulated-annealing-based heuristic for single row machine layout problem by genetic algorithm. International Transactions in Operational Research. 3(1):1996;37-49.
    • (1996) International Transactions in Operational Research , vol.3 , Issue.1 , pp. 37-49
    • Braglia, M.1
  • 14
    • 0002529867 scopus 로고    scopus 로고
    • ACO algorithms for the quadratic assignment problem
    • Corne D, Dorigo M, Glover F, editors, New York: McGraw-Hill
    • Stützle T, Dorigo M. ACO algorithms for the quadratic assignment problem. In: Corne D, Dorigo M, Glover F, editors. New ideas in optimization, New York: McGraw-Hill; 1999.
    • (1999) New Ideas in Optimization
    • Stützle, T.1    Dorigo, M.2
  • 16
    • 0037891981 scopus 로고    scopus 로고
    • Adaptive memories for the quadratic assignment problem
    • IDSIA, Lugano, Switzerland
    • Taillard ED, Gambardella LM. Adaptive memories for the quadratic assignment problem. Technical Report IDSIA-87-97, IDSIA, Lugano, Switzerland, 1997.
    • (1997) Technical Report , vol.IDSIA-87-97
    • Taillard, E.D.1    Gambardella, L.M.2
  • 18
    • 0000127689 scopus 로고    scopus 로고
    • Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
    • Maniezzo V. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal on Computing. 11:1999;358-369.
    • (1999) INFORMS Journal on Computing , vol.11 , pp. 358-369
    • Maniezzo, V.1
  • 21
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • Dorigo M., Gambardella L.M. Ant colony system. a cooperative learning approach to the traveling salesman problem IEEE Transactions on Evolutionary Computation. 1(1):1997;53-66.
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 23
    • 0000965291 scopus 로고
    • An experimental comparison of techniques for the assignment of facilities to locations
    • Nugent C.E., Vollman T.E., Ruml J. An experimental comparison of techniques for the assignment of facilities to locations. Operations Research. 16:1968;150-173.
    • (1968) Operations Research , vol.16 , pp. 150-173
    • Nugent, C.E.1    Vollman, T.E.2    Ruml, J.3
  • 25
    • 0016969488 scopus 로고
    • On solving a one-dimensional space allocation problem with integer programming
    • Love R.F., Wong J.Y. On solving a one-dimensional space allocation problem with integer programming. INFOR. 14(2):1976;139-143.
    • (1976) INFOR , vol.14 , Issue.2 , pp. 139-143
    • Love, R.F.1    Wong, J.Y.2
  • 26
    • 0012491085 scopus 로고
    • One-dimensional space allocation: An ordering algorithm
    • Simmons D.M. One-dimensional space allocation. an ordering algorithm Operations Research. 17(5):1969;812-826.
    • (1969) Operations Research , vol.17 , Issue.5 , pp. 812-826
    • Simmons, D.M.1
  • 27
    • 0014869120 scopus 로고
    • An r-dimensional quadratic placement algorithm
    • Hall K.M. An r-dimensional quadratic placement algorithm. Management Science. 17(3):1970;219-229
    • (1970) Management Science , vol.17 , Issue.3 , pp. 219-229
    • Hall, K.M.1


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