메뉴 건너뛰기




Volumn 42, Issue 19, 2004, Pages 4055-4067

Genetic algorithm for facilities layout problems based on slicing tree structure

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; INDUSTRIAL MANAGEMENT; OPTIMIZATION; PROBLEM SOLVING; STRATEGIC PLANNING;

EID: 5144223230     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540410001716471     Document Type: Article
Times cited : (60)

References (30)
  • 1
    • 0034691901 scopus 로고    scopus 로고
    • On solving facility layout problems using genetic algorithms
    • AL-HAKIM, L. A., 2000, On solving facility layout problems using genetic algorithms. International Journal of Production Research, 38, 2573-2582.
    • (2000) International Journal of Production Research , vol.38 , pp. 2573-2582
    • Al-Hakim, L.A.1
  • 2
    • 0036454519 scopus 로고    scopus 로고
    • Solving quadratic assignment problems using convex quadratic programming relaxations
    • ANSTREICHER, K. M. and BRIXIUS, N. W., 2001, Solving quadratic assignment problems using convex quadratic programming relaxations. Optimization Methods and Software, 16, 49-68.
    • (2001) Optimization Methods and Software , vol.16 , pp. 49-68
    • Anstreicher, K.M.1    Brixius, N.W.2
  • 3
    • 0034694502 scopus 로고    scopus 로고
    • Dynamic facility layout design using simulation and genetic algorithms
    • AZADIVIR, F. and WANG, J., 2000, Dynamic facility layout design using simulation and genetic algorithms. International Journal of Production Research, 38, 4369-4383.
    • (2000) International Journal of Production Research , vol.38 , pp. 4369-4383
    • Azadivir, F.1    Wang, J.2
  • 4
    • 0016638023 scopus 로고
    • Computerized layout design: A branch-and-bound approach
    • BAZARAA, M. S., 1975, Computerized layout design: a branch-and-bound approach. AIIE Transactions, 7, 432-438.
    • (1975) AIIE Transactions , vol.7 , pp. 432-438
    • Bazaraa, M.S.1
  • 5
    • 0000504963 scopus 로고    scopus 로고
    • Adaptive penalty methods for Genetic optimization of constrained combinatorial problems
    • COIT, D. W., SMITH, A. E. and TATE, D. M., 1996, Adaptive penalty methods for Genetic optimization of constrained combinatorial problems. INFORMS Journal on Computing, 8, 173-182.
    • (1996) INFORMS Journal on Computing , vol.8 , pp. 173-182
    • Coit, D.W.1    Smith, A.E.2    Tate, D.M.3
  • 7
    • 0024622632 scopus 로고
    • New approaches for heuristic search: A bilateral linkage with artificial intelligence
    • GLOVER, F. and GREENBERG, H. J., 1989, New approaches for heuristic search: A bilateral linkage with artificial intelligence. European Journal of Operational Research, 39, 119-130.
    • (1989) European Journal of Operational Research , vol.39 , pp. 119-130
    • Glover, F.1    Greenberg, H.J.2
  • 9
    • 5144226485 scopus 로고    scopus 로고
    • An efficient genetic algorithm based approach for the facility layout problem
    • paper PO68 CD-ROM, Prague
    • HANAFI, R., AL-HAKIM, L. and SHAYAN, E., 2001, An efficient genetic algorithm based approach for the facility layout problem. In Proceedings of the ICPR-16, paper PO68 CD-ROM, Prague.
    • (2001) Proceedings of the ICPR-16
    • Hanafi, R.1    Al-Hakim, L.2    Shayan, E.3
  • 11
    • 0026826080 scopus 로고
    • Experimental analysis of simulated annealing based algorithms for the layout problem
    • HERAGU, S. S. and ALFA, A. S., 1992, Experimental analysis of simulated annealing based algorithms for the layout problem. European Journal of Operational Research, 57, 190-202.
    • (1992) European Journal of Operational Research , vol.57 , pp. 190-202
    • Heragu, S.S.1    Alfa, A.S.2
  • 13
    • 0027628210 scopus 로고
    • Automated layout of facilities of unequal areas
    • IMAM, M. H. and MIR, M., 1993, Automated layout of facilities of unequal areas. Computers and Industrial Engineering, 24, 355-366.
    • (1993) Computers and Industrial Engineering , vol.24 , pp. 355-366
    • Imam, M.H.1    Mir, M.2
  • 14
    • 0032098010 scopus 로고    scopus 로고
    • A genetic algorithm approach for multiple criteria facility layout design
    • ISLIER, A. A., 1998, A genetic algorithm approach for multiple criteria facility layout design. International Journal of Production Research, 36, 1549-1569.
    • (1998) International Journal of Production Research , vol.36 , pp. 1549-1569
    • Islier, A.A.1
  • 16
    • 0037061440 scopus 로고    scopus 로고
    • A shape based block layout approach to facility layout problems using hybrid genetic algorithm
    • LEE, Y. H. and LEE, M. H., 2002, A shape based block layout approach to facility layout problems using hybrid genetic algorithm. Computers and Industrial Engineering, 42, 237-248.
    • (2002) Computers and Industrial Engineering , vol.42 , pp. 237-248
    • Lee, Y.H.1    Lee, M.H.2
  • 18
    • 0000965291 scopus 로고
    • An experimental comparison of techniques for the assignment of facilities to locations
    • NUGENT, E., VOLLMAN, T. E. and RUML, J., 1968, An experimental comparison of techniques for the assignment of facilities to locations. Operations Research, 16, 150-173.
    • (1968) Operations Research , vol.16 , pp. 150-173
    • Nugent, E.1    Vollman, T.E.2    Ruml, J.3
  • 24
    • 0026189990 scopus 로고
    • Robust tabu search for the quadratic assignment problem
    • TAILLARD, E. D., 1991, Robust tabu search for the quadratic assignment problem. Parallel Computing, 17, 443-455.
    • (1991) Parallel Computing , vol.17 , pp. 443-455
    • Taillard, E.D.1
  • 25
    • 0026979059 scopus 로고
    • Genetic algorithms, function optimization and facility layout design
    • TAM, K. Y., 1992, Genetic algorithms, function optimization and facility layout design. European Journal of Operational Research, 63, 3253-3272.
    • (1992) European Journal of Operational Research , vol.63 , pp. 3253-3272
    • Tam, K.Y.1
  • 26
    • 0032294137 scopus 로고    scopus 로고
    • Solving facility layout problems with geometric constraints using parallel genetic algorithms: Experimentation and findings
    • TAM, K. Y. and CHAN, S. K., 1998, Solving facility layout problems with geometric constraints using parallel genetic algorithms: experimentation and findings. International Journal of Production Research, 36, 3411-3423.
    • (1998) International Journal of Production Research , vol.36 , pp. 3411-3423
    • Tam, K.Y.1    Chan, S.K.2
  • 28
    • 5144233366 scopus 로고
    • A genetic approach to the quadratic assignment problem
    • TATE, D. M. and SMITH, A. E., 1995b, A genetic approach to the quadratic assignment problem. IIE Transactions, 27.
    • (1995) IIE Transactions , vol.27
    • Tate, D.M.1    Smith, A.E.2
  • 30
    • 0036466945 scopus 로고    scopus 로고
    • The optimization of block layout and aisle structure by a genetic algorithm
    • WU, Y. and APPLETON, E., 2002, The optimization of block layout and aisle structure by a genetic algorithm. Computers and Industrial Engineering, 41, 371-387.
    • (2002) Computers and Industrial Engineering , vol.41 , pp. 371-387
    • Wu, Y.1    Appleton, E.2


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