메뉴 건너뛰기




Volumn 37, Issue , 2015, Pages 303-310

Solving dynamic double row layout problem via combining simulated annealing and mathematical programming

Author keywords

Double row layout problem; Dynamic layout problem; Mathematical programming; Simulated annealing algorithm

Indexed keywords

INTEGER PROGRAMMING; MATHEMATICAL PROGRAMMING;

EID: 84941136003     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2015.08.023     Document Type: Article
Times cited : (48)

References (41)
  • 1
    • 0242301563 scopus 로고    scopus 로고
    • Layout design in dynamic environments: Strategies and quantitative indices
    • M. Braglia, S. Zanoni, and L. Zavanella Layout design in dynamic environments: strategies and quantitative indices Int. J. Prod. Res. 41 5 2003 995 1016
    • (2003) Int. J. Prod. Res. , vol.41 , Issue.5 , pp. 995-1016
    • Braglia, M.1    Zanoni, S.2    Zavanella, L.3
  • 2
    • 38849134090 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for the continuous facility layout problem
    • W. Xie, and N.V. Sahinidis A branch-and-bound algorithm for the continuous facility layout problem Comput. Chem. Eng. 32 4-5 2008 1016 1028
    • (2008) Comput. Chem. Eng. , vol.32 , Issue.4-5 , pp. 1016-1028
    • Xie, W.1    Sahinidis, N.V.2
  • 3
    • 84882868264 scopus 로고    scopus 로고
    • The single row facility layout problem: State of the art
    • R. Kothari, and D. Ghosh The single row facility layout problem: state of the art Opsearch 49 4 2012 442 462
    • (2012) Opsearch , vol.49 , Issue.4 , pp. 442-462
    • Kothari, R.1    Ghosh, D.2
  • 5
    • 33646499690 scopus 로고    scopus 로고
    • On the exact solution of a facility layout problem
    • A.R.S. Amaral On the exact solution of a facility layout problem Eur. J. Oper. Res. 173 2 2006 508 518
    • (2006) Eur. J. Oper. Res. , vol.173 , Issue.2 , pp. 508-518
    • Amaral, A.R.S.1
  • 6
    • 61349094800 scopus 로고    scopus 로고
    • An exact approach to the one-dimensional facility layout problem
    • A.R.S. Amaral An exact approach to the one-dimensional facility layout problem Oper. Res. 56 4 2008 1026 1033
    • (2008) Oper. Res. , vol.56 , Issue.4 , pp. 1026-1033
    • Amaral, A.R.S.1
  • 7
    • 57649191297 scopus 로고    scopus 로고
    • Computing globally optimal solutions for single-row layout problems using semidenite programming and cutting planes
    • M.F. Anjos, and A. Vannelli Computing globally optimal solutions for single-row layout problems using semidenite programming and cutting planes INFORMS J. Comput. 20 4 2008 611 617
    • (2008) INFORMS J. Comput. , vol.20 , Issue.4 , pp. 611-617
    • Anjos, M.F.1    Vannelli, A.2
  • 8
    • 56349117947 scopus 로고    scopus 로고
    • A new lower bound for the single row facility layout problem
    • A.R.S. Amaral A new lower bound for the single row facility layout problem Discret. Appl. Math. 157 1 2009 183 190
    • (2009) Discret. Appl. Math. , vol.157 , Issue.1 , pp. 183-190
    • Amaral, A.R.S.1
  • 9
    • 79955885772 scopus 로고    scopus 로고
    • Single row facility layoutproblem using a permutation-based genetic algorithm
    • D. Datta, A.R.S. Amaral, and J.R. Figueira Single row facility layoutproblem using a permutation-based genetic algorithm Eur. J. Oper. Res. 213 2 2011 388 394
    • (2011) Eur. J. Oper. Res. , vol.213 , Issue.2 , pp. 388-394
    • Datta, D.1    Amaral, A.R.S.2    Figueira, J.R.3
  • 10
    • 84867367697 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for the single row layout problem
    • F. Ozcelik A hybrid genetic algorithm for the single row layout problem Int. J. Prod. Res. 50 20 2012 5872 5886
    • (2012) Int. J. Prod. Res. , vol.50 , Issue.20 , pp. 5872-5886
    • Ozcelik, F.1
  • 11
    • 75849148444 scopus 로고    scopus 로고
    • An efficient tabu algorithm for the single row facility layout problem
    • H. Samarghandi, and K. Eshghi An efficient tabu algorithm for the single row facility layout problem Eur. J. Oper. Res. 205 1 2010 98 105
    • (2010) Eur. J. Oper. Res. , vol.205 , Issue.1 , pp. 98-105
    • Samarghandi, H.1    Eshghi, K.2
  • 12
    • 84866735210 scopus 로고    scopus 로고
    • Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
    • R. Kothari, and D. Ghosh Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods Eur. J. Oper. Res. 224 2013 93 100
    • (2013) Eur. J. Oper. Res. , vol.224 , pp. 93-100
    • Kothari, R.1    Ghosh, D.2
  • 13
    • 77950595893 scopus 로고    scopus 로고
    • A particle swarm optimization for the single row facility layout problem
    • H. Samarghandi, P. Taabayan, and F.F. Jahantigh A particle swarm optimization for the single row facility layout problem Comput. Ind. Eng. 58 4 2010 529 534
    • (2010) Comput. Ind. Eng. , vol.58 , Issue.4 , pp. 529-534
    • Samarghandi, H.1    Taabayan, P.2    Jahantigh, F.F.3
  • 14
    • 84880558219 scopus 로고    scopus 로고
    • Hybrid estimation of distribution algorithm for solving single row facility layout problem
    • O.Y. Chao, and U. Amalia Hybrid estimation of distribution algorithm for solving single row facility layout problem Comput. Ind. Eng. 66 2013 95 103
    • (2013) Comput. Ind. Eng. , vol.66 , pp. 95-103
    • Chao, O.Y.1    Amalia, U.2
  • 15
    • 84866165332 scopus 로고    scopus 로고
    • Insertion based Lin-Kernighan heuristic for single row facility layout
    • R. Kothari, and D. Ghosh Insertion based Lin-Kernighan heuristic for single row facility layout Comput. Oper. Res. 40 2013 129 136
    • (2013) Comput. Oper. Res. , vol.40 , pp. 129-136
    • Kothari, R.1    Ghosh, D.2
  • 16
    • 42649130382 scopus 로고    scopus 로고
    • Two-level modified simulated annealing based approach for solving facility layout problem
    • S.P. Singh, and R.R.K. Sharma Two-level modified simulated annealing based approach for solving facility layout problem Int. J. Prod. Res. 46 13 2008 3563 3582
    • (2008) Int. J. Prod. Res. , vol.46 , Issue.13 , pp. 3563-3582
    • Singh, S.P.1    Sharma, R.R.K.2
  • 17
    • 10444248839 scopus 로고    scopus 로고
    • Designing the layout of single and multiple-rows flexible manufacturing system by genetic algorithms
    • M. Ficko, M. Brezocnik, and J. Balic Designing the layout of single and multiple-rows flexible manufacturing system by genetic algorithms J. Mater. Process. Technol. 157-158 2004 150 158
    • (2004) J. Mater. Process. Technol. , vol.157-158 , pp. 150-158
    • Ficko, M.1    Brezocnik, M.2    Balic, J.3
  • 18
    • 84858700224 scopus 로고    scopus 로고
    • A genetic algorithm with the heuristic procedure to solve the multi-line layout problem
    • A. Sadrzadeh A genetic algorithm with the heuristic procedure to solve the multi-line layout problem Comput. Ind. Eng. 62 4 2012 1055 1064
    • (2012) Comput. Ind. Eng. , vol.62 , Issue.4 , pp. 1055-1064
    • Sadrzadeh, A.1
  • 19
    • 74549198238 scopus 로고    scopus 로고
    • The double row layout problem
    • J. Chung, and J.M.A. Tanchoco The double row layout problem Int. J. Prod. Res. 48 3 2010 709 727
    • (2010) Int. J. Prod. Res. , vol.48 , Issue.3 , pp. 709-727
    • Chung, J.1    Tanchoco, J.M.A.2
  • 21
    • 0022516277 scopus 로고
    • The dynamics of plant layout
    • M.J. Rosenblatt The dynamics of plant layout Manag. Sci. 32 1 1986 76 86
    • (1986) Manag. Sci. , vol.32 , Issue.1 , pp. 76-86
    • Rosenblatt, M.J.1
  • 22
    • 84885665000 scopus 로고    scopus 로고
    • An efficient local search heuristic for the double row layout problem with asymmetric material flow
    • C.C. Murray, A.E. Smith, and Z.Q. Zhang An efficient local search heuristic for the double row layout problem with asymmetric material flow Int. J. Prod. Res. 51 20 2013 6129 6139
    • (2013) Int. J. Prod. Res. , vol.51 , Issue.20 , pp. 6129-6139
    • Murray, C.C.1    Smith, A.E.2    Zhang, Z.Q.3
  • 23
    • 84873145939 scopus 로고    scopus 로고
    • Optimal solutions for the double row layout problem
    • A.R.S. Amaral Optimal solutions for the double row layout problem Optim. Lett. 7 2 2013 407 413
    • (2013) Optim. Lett. , vol.7 , Issue.2 , pp. 407-413
    • Amaral, A.R.S.1
  • 24
    • 84908616187 scopus 로고    scopus 로고
    • Solving an extended double row layout problem using multi-objective tabu search and linear programming
    • X.Q. Zuo, C.C. Murray, and A.E. Smith Solving an extended double row layout problem using multi-objective tabu search and linear programming IEEE Trans. Autom. Sci. Eng. 11 4 2014 1122 1132
    • (2014) IEEE Trans. Autom. Sci. Eng. , vol.11 , Issue.4 , pp. 1122-1132
    • Zuo, X.Q.1    Murray, C.C.2    Smith, A.E.3
  • 25
    • 0023978605 scopus 로고
    • Machine layout problem in flexible manufacturing systems
    • S.S. Heragu, and A. Kusiak Machine layout problem in flexible manufacturing systems Oper. Res. 36 2 1988 258 268
    • (1988) Oper. Res. , vol.36 , Issue.2 , pp. 258-268
    • Heragu, S.S.1    Kusiak, A.2
  • 26
    • 84862985630 scopus 로고    scopus 로고
    • The corridor allocation problem
    • A.R.S. Amaral The corridor allocation problem Comput. Oper. Res. 39 12 2012 3325 3330
    • (2012) Comput. Oper. Res. , vol.39 , Issue.12 , pp. 3325-3330
    • Amaral, A.R.S.1
  • 27
    • 84880899397 scopus 로고    scopus 로고
    • A parallel ordering problem in facilities layout
    • A.R.S. Amaral A parallel ordering problem in facilities layout Comput. Oper. Res. 40 12 2013 2930 2939
    • (2013) Comput. Oper. Res. , vol.40 , Issue.12 , pp. 2930-2939
    • Amaral, A.R.S.1
  • 28
    • 29144444601 scopus 로고    scopus 로고
    • Simulated annealing heuristics for the dynamic facility layout problem
    • A.R. Mckendall, J. Shang, and S. Kuppusamy Simulated annealing heuristics for the dynamic facility layout problem Comput. Oper. Res. 33 8 2006 2431 2444
    • (2006) Comput. Oper. Res. , vol.33 , Issue.8 , pp. 2431-2444
    • Mckendall, A.R.1    Shang, J.2    Kuppusamy, S.3
  • 29
    • 27844552850 scopus 로고    scopus 로고
    • An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems
    • A. Baykasoglu, T. Dereli, and I. Sabuncu An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems Omega 34 4 2006 385 396
    • (2006) Omega , vol.34 , Issue.4 , pp. 385-396
    • Baykasoglu, A.1    Dereli, T.2    Sabuncu, I.3
  • 30
    • 77955308743 scopus 로고    scopus 로고
    • A simulated annealing heuristic for the dynamic layout problem with budget constraint
    • R. Sahin, K. Ertogral, and O. Tuikbey A simulated annealing heuristic for the dynamic layout problem with budget constraint Comput. Ind. Eng. 59 2 2010 308 313
    • (2010) Comput. Ind. Eng. , vol.59 , Issue.2 , pp. 308-313
    • Sahin, R.1    Ertogral, K.2    Tuikbey, O.3
  • 31
    • 67650793169 scopus 로고    scopus 로고
    • An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem
    • H. Rezazadeh, M. Ghazanfari, M. Saidimehrabad, and S.J. Sadjadi An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem J. Zhejiang Univ. Sci. 10 4 2009 520 529
    • (2009) J. Zhejiang Univ. Sci. , vol.10 , Issue.4 , pp. 520-529
    • Rezazadeh, H.1    Ghazanfari, M.2    Saidimehrabad, M.3    Sadjadi, S.J.4
  • 32
    • 80053205765 scopus 로고    scopus 로고
    • Design of robust layout for dynamic plant layout problems
    • V.M. Pillai, I.B. Hunagund, and K.K. Krishnan Design of robust layout for dynamic plant layout problems Comput. Ind. Eng. 61 3 2011 813 823
    • (2011) Comput. Ind. Eng. , vol.61 , Issue.3 , pp. 813-823
    • Pillai, V.M.1    Hunagund, I.B.2    Krishnan, K.K.3
  • 33
    • 84874534643 scopus 로고    scopus 로고
    • A new data structure of solution representation in hybrid ant colony optimization for large dynamic facility layout problems
    • G.Y. Chen A new data structure of solution representation in hybrid ant colony optimization for large dynamic facility layout problems Int. J. Prod. Econ. 142 2 2013 362 371
    • (2013) Int. J. Prod. Econ. , vol.142 , Issue.2 , pp. 362-371
    • Chen, G.Y.1
  • 34
    • 70249097053 scopus 로고    scopus 로고
    • Heuristics for the dynamic facility layout problem with unequal-area departments
    • A.R. Mckendall, and A. Hakobyan Heuristics for the dynamic facility layout problem with unequal-area departments Eur. J. Oper. Res. 201 1 2010 171 182
    • (2010) Eur. J. Oper. Res. , vol.201 , Issue.1 , pp. 171-182
    • Mckendall, A.R.1    Hakobyan, A.2
  • 35
  • 36
    • 78650704996 scopus 로고    scopus 로고
    • A simulated annealing algorithm for solving the bi-objective facility layout problem
    • R. Sahin A simulated annealing algorithm for solving the bi-objective facility layout problem Expert Syst. Appl. 38 2011 4460 4465
    • (2011) Expert Syst. Appl. , vol.38 , pp. 4460-4465
    • Sahin, R.1
  • 37
    • 79960535211 scopus 로고    scopus 로고
    • A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms
    • J. Derrac, S. García, D. Molina, and F. Herrera A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms Swarm Evol. Comput. 1 2011 3 18
    • (2011) Swarm Evol. Comput. , vol.1 , pp. 3-18
    • Derrac, J.1    García, S.2    Molina, D.3    Herrera, F.4
  • 38
    • 84901805253 scopus 로고    scopus 로고
    • A chess rating system for evolutionary algorithms: A new method for the comparison and ranking of evolutionary algorithms
    • N. Veček, M. Mernik, and M. Črepinšek A chess rating system for evolutionary algorithms: a new method for the comparison and ranking of evolutionary algorithms Inf. Sci. 277 2014 656 679
    • (2014) Inf. Sci. , vol.277 , pp. 656-679
    • Veček, N.1    Mernik, M.2    Črepinšek, M.3
  • 39
    • 0035546638 scopus 로고    scopus 로고
    • A simulated annealing algorithm for dynamic layout problem
    • A. Baykasoglu, and N.N.Z. Gindy A simulated annealing algorithm for dynamic layout problem Comput. Oper. Res. 28 14 2001 1403 1426
    • (2001) Comput. Oper. Res. , vol.28 , Issue.14 , pp. 1403-1426
    • Baykasoglu, A.1    Gindy, N.N.Z.2
  • 40
    • 23344442798 scopus 로고    scopus 로고
    • Hybrid ant system for the dynamic facility layout problem
    • A.R. Mckendall, and J. Shang Hybrid ant system for the dynamic facility layout problem Comput. Oper. Res. 33 8 2006 790 803
    • (2006) Comput. Oper. Res. , vol.33 , Issue.8 , pp. 790-803
    • Mckendall, A.R.1    Shang, J.2
  • 41
    • 84864850631 scopus 로고    scopus 로고
    • A corrected formulation for the double row layout problem
    • Z.Q. Zhang, and C.C. Murray A corrected formulation for the double row layout problem Int. J. Prod. Res. 50 15 2012 4220 4223
    • (2012) Int. J. Prod. Res. , vol.50 , Issue.15 , pp. 4220-4223
    • Zhang, Z.Q.1    Murray, C.C.2


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