메뉴 건너뛰기
OR Spectrum
Volumn 34, Issue 1, 2012, Pages 1-21
A branch-and-bound algorithm for the single-row equidistant facility layout problem
Author keywords

Branch and bound algorithm; Facility layout; Quadratic assignment problem; Tabu search
Indexed keywords

EID: 84855241084     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-010-0204-5     Document Type: Article
Times cited : (27)
References (34)
  • 1
    • 33646499690 scopus 로고    scopus 로고
    • On the exact solution of a facility layout problem
    • Amaral ARS (2006) On the exact solution of a facility layout problem. Eur J Oper Res 173: 508-518.
    • (2006) Eur J Oper Res , vol.173 , pp. 508-518
    • Amaral, A.R.S.1
  • 2
    • 2942696007 scopus 로고    scopus 로고
    • Recent advances in the solution of quadratic assignment problems
    • Anstreicher KM (2003) Recent advances in the solution of quadratic assignment problems. Math Program 97: 27-42.
    • (2003) Math Program , vol.97 , pp. 27-42
    • Anstreicher, K.M.1
  • 4
    • 0023167421 scopus 로고
    • Optimal linear arrangement of circuit components
    • Bhasker J, Sahni S (1987) Optimal linear arrangement of circuit components. J VLSI Comput Syst 2: 87-109.
    • (1987) J VLSI Comput Syst , vol.2 , pp. 87-109
    • Bhasker, J.1    Sahni, S.2
  • 5
    • 0021481361 scopus 로고
    • A thermodynamically motivated simulation procedure for combinatorial optimization problems
    • Burkard RE, Rendl F (1984) A thermodynamically motivated simulation procedure for combinatorial optimization problems. Eur J Oper Res 17: 169-174.
    • (1984) Eur J Oper Res , vol.17 , pp. 169-174
    • Burkard, R.E.1    Rendl, F.2
  • 6
    • 0028507962 scopus 로고
    • A constructive method for improving lower bounds for a class of quadratic assignment problems
    • Chakrapani J, Skorin-Kapov J (1994) A constructive method for improving lower bounds for a class of quadratic assignment problems. Oper Res 42: 837-845.
    • (1994) Oper Res , vol.42 , pp. 837-845
    • Chakrapani, J.1    Skorin-Kapov, J.2
  • 7
    • 0024733343 scopus 로고
    • An exact algorithm for the quadratic assignment problem on a tree
    • Christofides N, Benavent E (1989) An exact algorithm for the quadratic assignment problem on a tree. Oper Res 37: 760-768.
    • (1989) Oper Res , vol.37 , pp. 760-768
    • Christofides, N.1    Benavent, E.2
  • 8
    • 0037476529 scopus 로고
    • Labelings of graphs
    • L. W. Beineke and R. J. Wilson (Eds.), San Diego: Academic Press
    • Chung FRK (1988) Labelings of graphs. In: Beineke LW, Wilson RJ (eds) Selected topics in graph theory, vol 3. Academic Press, San Diego, pp 151-168.
    • (1988) Selected Topics in Graph Theory, Vol 3 , pp. 151-168
    • Chung, F.R.K.1
  • 9
    • 0344704289 scopus 로고    scopus 로고
    • A survey of graph layout problems
    • Díaz J, Petit J, Serna M (2002) A survey of graph layout problems. ACM Comput Surv 34: 313-356.
    • (2002) ACM Comput Surv , vol.34 , pp. 313-356
    • Díaz, J.1    Petit, J.2    Serna, M.3
  • 10
    • 33748291532 scopus 로고    scopus 로고
    • Finding a cluster of points and the grey pattern quadratic assignment problem
    • Drezner Z (2006) Finding a cluster of points and the grey pattern quadratic assignment problem. OR Spectrum 28: 417-436.
    • (2006) OR Spectrum , vol.28 , pp. 417-436
    • Drezner, Z.1
  • 11
    • 0001703624 scopus 로고
    • Optimal and suboptimal algorithms for the quadratic assignment problem
    • Gilmore PC (1962) Optimal and suboptimal algorithms for the quadratic assignment problem. J SIAM 10: 305-313.
    • (1962) J SIAM , vol.10 , pp. 305-313
    • Gilmore, P.C.1
  • 12
    • 0000411214 scopus 로고
    • Tabu search-part I
    • Glover F (1989) Tabu search-part I. ORSA J Comput 1: 190-206.
    • (1989) ORSA J Comput , vol.1 , pp. 190-206
    • Glover, F.1
  • 13
    • 0029206128 scopus 로고
    • Lower bounds for the quadratic assignment problem via triangle decompositions
    • Karisch SE, Rendl F (1995) Lower bounds for the quadratic assignment problem via triangle decompositions. Math Program 71: 137-151.
    • (1995) Math Program , vol.71 , pp. 137-151
    • Karisch, S.E.1    Rendl, F.2
  • 14
    • 0141603494 scopus 로고
    • Finite-state processes and dynamic programming
    • Karp RM, Held M (1967) Finite-state processes and dynamic programming. SIAM J Appl Math 15: 693-718.
    • (1967) SIAM J Appl Math , vol.15 , pp. 693-718
    • Karp, R.M.1    Held, M.2
  • 15
    • 0002384937 scopus 로고
    • Assignment problems and the location of economic activities
    • Koopmans TC, Beckmann M (1957) Assignment problems and the location of economic activities. Econometrica 25: 53-76.
    • (1957) Econometrica , vol.25 , pp. 53-76
    • Koopmans, T.C.1    Beckmann, M.2
  • 16
    • 0029254518 scopus 로고
    • Optimal algorithms for row layout problems in automated manufacturing systems
    • Kouvelis P, Chiang W, Yu G (1995) Optimal algorithms for row layout problems in automated manufacturing systems. IIE Trans 27: 99-104.
    • (1995) IIE Trans , vol.27 , pp. 99-104
    • Kouvelis, P.1    Chiang, W.2    Yu, G.3
  • 17
    • 0000282077 scopus 로고
    • The quadratic assignment problem
    • Lawler EL (1963) The quadratic assignment problem. Manage Sci 9: 586-599.
    • (1963) Manage Sci , vol.9 , pp. 586-599
    • Lawler, E.L.1
  • 19
    • 0000965291 scopus 로고
    • An experimental comparison of techniques for the assignment of facilities to locations
    • Nugent CE, Vollmann TE, Ruml J (1968) An experimental comparison of techniques for the assignment of facilities to locations. Oper Res 16: 150-173.
    • (1968) Oper Res , vol.16 , pp. 150-173
    • Nugent, C.E.1    Vollmann, T.E.2    Ruml, J.3
  • 21
    • 40849142095 scopus 로고    scopus 로고
    • Exact solution procedures for the balanced unidirectional cyclic layout problem
    • Öncan T, Alti{dotless}nel İK (2008) Exact solution procedures for the balanced unidirectional cyclic layout problem. Eur J Oper Res 189: 609-623.
    • (2008) Eur J Oper Res , vol.189 , pp. 609-623
    • Öncan, T.1    Altinel, I.K.2
  • 22
    • 38249031792 scopus 로고
    • A generator of test quadratic assignment problems with known optimal solution
    • [Translated from: Zh Vychisl Mat Mat Fiz 28: 1740-1743]
    • Palubeckis GS (1988) A generator of test quadratic assignment problems with known optimal solution. USSR Comp Math Math Phys 28: 97-98 [Translated from: Zh Vychisl Mat Mat Fiz 28: 1740-1743].
    • (1988) USSR Comp Math Math Phys , vol.28 , pp. 97-98
    • Palubeckis, G.S.1
  • 23
    • 0345808138 scopus 로고    scopus 로고
    • The use of special graphs for obtaining lower bounds in the geometric quadratic assignment problem
    • Palubeckis G (1997) The use of special graphs for obtaining lower bounds in the geometric quadratic assignment problem. Informatica 8: 377-400.
    • (1997) Informatica , vol.8 , pp. 377-400
    • Palubeckis, G.1
  • 24
    • 33749359147 scopus 로고    scopus 로고
    • Iterated tabu search for the unconstrained binary quadratic optimization problem
    • Palubeckis G (2006) Iterated tabu search for the unconstrained binary quadratic optimization problem. Informatica 17: 279-296.
    • (2006) Informatica , vol.17 , pp. 279-296
    • Palubeckis, G.1
  • 25
    • 34248328827 scopus 로고    scopus 로고
    • Iterated tabu search for the maximum diversity problem
    • Palubeckis G (2007) Iterated tabu search for the maximum diversity problem. Appl Math Comput 189: 371-383.
    • (2007) Appl Math Comput , vol.189 , pp. 371-383
    • Palubeckis, G.1
  • 27
    • 0012543530 scopus 로고
    • On the one-dimensional space allocation problem
    • Picard J-C, Queyranne M (1981) On the one-dimensional space allocation problem. Oper Res 29: 371-391.
    • (1981) Oper Res , vol.29 , pp. 371-391
    • Picard, J.-C.1    Queyranne, M.2
  • 29
    • 0032026466 scopus 로고    scopus 로고
    • One-dimensional machine location problems in a multi-product flowline with equidistant locations
    • Sarker BR, Wilhelm WE, Hogg GL (1998) One-dimensional machine location problems in a multi-product flowline with equidistant locations. Eur J Oper Res 105: 401-426.
    • (1998) Eur J Oper Res , vol.105 , pp. 401-426
    • Sarker, B.R.1    Wilhelm, W.E.2    Hogg, G.L.3
  • 30
    • 0001997908 scopus 로고
    • Tabu search applied to the quadratic assignment problem
    • Skorin-Kapov J (1990) Tabu search applied to the quadratic assignment problem. ORSA J Comput 2: 33-45.
    • (1990) ORSA J Comput , vol.2 , pp. 33-45
    • Skorin-Kapov, J.1
  • 31
    • 0026189990 scopus 로고
    • Robust taboo search for the quadratic assignment problem
    • Taillard E (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17: 443-455.
    • (1991) Parallel Comput , vol.17 , pp. 443-455
    • Taillard, E.1
  • 32
    • 0002370079 scopus 로고
    • Comparison of iterative searches for the quadratic assignment problem
    • Taillard É.D. (1995) Comparison of iterative searches for the quadratic assignment problem. Location Sci 3: 87-105.
    • (1995) Location Sci , vol.3 , pp. 87-105
    • Taillard, E.D.1
  • 33
    • 0037138028 scopus 로고    scopus 로고
    • Locating cells with bottleneck machines in cellular manufacturing systems
    • Wang S, Sarker BR (2002) Locating cells with bottleneck machines in cellular manufacturing systems. Int J Prod Res 40: 403-424.
    • (2002) Int J Prod Res , vol.40 , pp. 403-424
    • Wang, S.1    Sarker, B.R.2
  • 34
    • 0037883613 scopus 로고    scopus 로고
    • Directional decomposition heuristic for a linear machine-cell location problem
    • Yu J, Sarker BR (2003) Directional decomposition heuristic for a linear machine-cell location problem. Eur J Oper Res 149: 142-184.
    • (2003) Eur J Oper Res , vol.149 , pp. 142-184
    • Yu, J.1    Sarker, B.R.2

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