메뉴 건너뛰기




Volumn 61, Issue 2, 2011, Pages 373-381

An augmented beam search-based algorithm for the circular open dimension problem

Author keywords

Beam search; Binary search; Cutting and packing; Minimum local distance position; Multi start strategy

Indexed keywords

BEAM SEARCH; BINARY SEARCH; CUTTING AND PACKING; MINIMUM LOCAL-DISTANCE POSITION; MULTISTART;

EID: 80052443471     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2011.02.009     Document Type: Conference Paper
Times cited : (30)

References (20)
  • 2
    • 55749102415 scopus 로고    scopus 로고
    • A beam search based algorithm for the circular packing problem
    • H. Akeb, M. Hifi, and R. M'Hallah A beam search based algorithm for the circular packing problem Computers & Operations Research 36 2009 1513 1528
    • (2009) Computers & Operations Research , vol.36 , pp. 1513-1528
    • Akeb, H.1    Hifi, M.2    M'Hallah, R.3
  • 3
    • 33646371708 scopus 로고    scopus 로고
    • The distributor's three-dimensional pallet-packing problem: A human intelligence-based heuristic approach
    • E. Baltacioglu, J.T. Moore, and R.R. Hill The distributor's three-dimensional pallet-packing problem: A human intelligence-based heuristic approach International Journal of Operational Research 1 2006 249 266 (Pubitemid 43664412)
    • (2006) International Journal of Operational Research , vol.1 , Issue.3 , pp. 249-266
    • Baltacioglu, E.1    Moore, J.T.2    Hill Jr., R.R.3
  • 4
    • 70849122690 scopus 로고    scopus 로고
    • New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
    • E.G. Birgin, and J.M. Gentil New and improved results for packing identical unitary radius circles within triangles, rectangles and strips Computers & Operations Research 37 2010 1318 1327
    • (2010) Computers & Operations Research , vol.37 , pp. 1318-1327
    • Birgin, E.G.1    Gentil, J.M.2
  • 5
  • 6
    • 36448976929 scopus 로고    scopus 로고
    • Minimizing the object dimensions in circle and sphere packing problems
    • DOI 10.1016/j.cor.2006.11.002, PII S0305054806002942, Selected Papers Presented at the ECCO'04 European Conference on Combinatorial Optimization
    • E.G. Birgin, and F.N.C. Sobral Minimizing the object dimensions in circle and sphere packing problems Computers & Operations Research 35 2008 2357 2375 (Pubitemid 350167494)
    • (2008) Computers and Operations Research , vol.35 , Issue.7 , pp. 2357-2375
    • Birgin, E.G.1    Sobral, F.N.C.2
  • 7
    • 44649160575 scopus 로고    scopus 로고
    • Solving circle packing problems by global optimization: Numerical results and industrial applications
    • DOI 10.1016/j.ejor.2007.01.054, PII S0377221707004274
    • I. Castillo, F.J. Kampas, and J.D. Pintér Solving circle packing problems by global optimization: Numerical results and industrial applications European Journal of Operational Research 191 2008 786 802 (Pubitemid 351778615)
    • (2008) European Journal of Operational Research , vol.191 , Issue.3 , pp. 786-802
    • Castillo, I.1    Kampas, F.J.2    Pinter, J.D.3
  • 9
    • 79957976064 scopus 로고    scopus 로고
    • A hybrid algorithm for the two-dimensional layout problem: The cases of regular and irregular shapes
    • M. Hifi, and R. M'Hallah A hybrid algorithm for the two-dimensional layout problem: The cases of regular and irregular shapes International Transactions in Operational Research 10 2003 195 216 (Pubitemid 36765864)
    • (2003) International Transactions in Operational Research , vol.10 , Issue.3 , pp. 195-216
    • Hifi, M.1    M Hallah, R.2
  • 10
    • 0942280351 scopus 로고    scopus 로고
    • Approximate algorithms for constrained circular cutting problems
    • DOI 10.1016/S0305-0548(03)00020-0
    • M. Hifi, and R. M'Hallah Approximate algorithms for constrained circular cutting problems Computers and Operations Research 31 2004 675 694 (Pubitemid 38135872)
    • (2004) Computers and Operations Research , vol.31 , Issue.5 , pp. 675-694
    • Hifi, M.1    M'Hallah, R.2
  • 11
    • 34447100044 scopus 로고    scopus 로고
    • A dynamic adaptive local search algorithm for the circular packing problem
    • DOI 10.1016/j.ejor.2005.11.069, PII S0377221706003043
    • M. Hifi, and R. M'Hallah A dynamic adaptive local search based algorithm for the circular packing problem European Journal of Operational Research 183 2007 1280 1294 (Pubitemid 47030739)
    • (2007) European Journal of Operational Research , vol.183 , Issue.3 , pp. 1280-1294
    • Hifi, M.1    M'Hallah, R.2
  • 12
    • 78751537817 scopus 로고    scopus 로고
    • A literature review on circle and sphere packing problems: Models and methodologies
    • 10.1155/2009/150624
    • M. Hifi, and R. M'Hallah A literature review on circle and sphere packing problems: Models and methodologies Advances in Operations Research 2009 10.1155/2009/150624
    • (2009) Advances in Operations Research
    • Hifi, M.1    M'Hallah, R.2
  • 14
    • 17644391062 scopus 로고    scopus 로고
    • Greedy algorithms for packing unequal circles into a rectangular container
    • DOI 10.1057/palgrave.jors.2601836
    • W.Q. Huang, Y. Li, H. Akeb, and C.M. Li Greedy algorithms for packing unequal circles into a rectangular container Journal of the Operational Research Society 56 2005 539 548 (Pubitemid 40567540)
    • (2005) Journal of the Operational Research Society , vol.56 , Issue.5 , pp. 539-548
    • Huang, W.Q.1    Li, Y.2    Akeb, H.3    Li, C.M.4
  • 15
    • 69649095209 scopus 로고    scopus 로고
    • An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle
    • J. Liu, S. Xue, Z. Liu, and D. Xu An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle Computers & Industrial Engineering 57 2009 1144 1149
    • (2009) Computers & Industrial Engineering , vol.57 , pp. 1144-1149
    • Liu, J.1    Xue, S.2    Liu, Z.3    Xu, D.4
  • 16
    • 0036508153 scopus 로고    scopus 로고
    • Order allocation for stock cutting in the paper industry
    • S. Menon, and L. Schrage Order allocation for stock cutting in the paper industry Operations Research 50 2002 324 332 (Pubitemid 34721182)
    • (2002) Operations Research , vol.50 , Issue.2 , pp. 324-332
    • Menon, S.1    Schrage, L.2
  • 17
    • 33644508921 scopus 로고    scopus 로고
    • Approximation algorithms for problems combining facility location and network design
    • R. Ravi, and A. Sinha Approximation algorithms for problems combining facility location and network design Operations Research 54 2006 73 81
    • (2006) Operations Research , vol.54 , pp. 73-81
    • Ravi, R.1    Sinha, A.2
  • 18
    • 33845252250 scopus 로고    scopus 로고
    • A hybrid multistart heuristic for the uncapacitated facility location problem
    • DOI 10.1016/j.ejor.2005.02.046, PII S0377221705002481
    • M.G.C. Resende, and R.F.F. Werneck A hybrid multistart heuristic for the uncapacitated facility location problem European Journal of Operational Research 174 2006 54 68 (Pubitemid 44866840)
    • (2006) European Journal of Operational Research , vol.174 , Issue.1 , pp. 54-68
    • Resende, M.G.C.1    Werneck, R.F.2
  • 19
    • 0442297986 scopus 로고    scopus 로고
    • Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
    • Y.G. Stoyan, and G.N. Yaskov Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints International Transactions in Operational Research 5 1998 45 57
    • (1998) International Transactions in Operational Research , vol.5 , pp. 45-57
    • Stoyan, Y.G.1    Yaskov, G.N.2
  • 20
    • 34447100387 scopus 로고    scopus 로고
    • An improved typology of cutting and packing problems
    • DOI 10.1016/j.ejor.2005.12.047, PII S037722170600292X
    • G. Wäscher, H. Haussner, and H. Schumann An improved typology of cutting and packing problems European Journal of Operational Research 183 2007 1109 1130 (Pubitemid 47030730)
    • (2007) European Journal of Operational Research , vol.183 , Issue.3 , pp. 1109-1130
    • Wascher, G.1    Haussner, H.2    Schumann, H.3


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