dc.contributor.author |
Charalambous C. |
dc.contributor.author |
Fleszar K. |
dc.contributor.editor |
|
dc.date |
2011 |
dc.date.accessioned |
2017-09-07T07:51:23Z |
dc.date.available |
2017-09-07T07:51:23Z |
dc.date.issued |
2011 |
dc.identifier |
10.1016/j.cor.2010.12.013 |
dc.identifier.issn |
3050548 |
dc.identifier.uri |
http://hdl.handle.net/10938/12119 |
dc.description.abstract |
A new heuristic algorithm for solving the two-dimensional bin-packing problem with guillotine cuts (2DBPG) is presented. The heuristic constructs a solution by packing a bin at a time. Central to the adopted solution scheme is the principle of average-area sufficiency proposed by the authors for guiding selection of items to fill a bin. The algorithm is tested on a set of standard benchmark problem instances and compared with existing heuristics producing the best-known results. The results presented attest to the efficacy of the proposed scheme. © 2010 Elsevier Ltd. All rights reserved. |
dc.format.extent |
|
dc.format.extent |
Pages: (1443-1451) |
dc.language |
English |
dc.publisher |
OXFORD |
dc.relation.ispartof |
Publication Name: Computers and Operations Research; Publication Year: 2011; Volume: 38; no. 10; Pages: (1443-1451); |
dc.source |
Scopus |
dc.title |
A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts |
dc.type |
Article |
dc.contributor.affiliation |
Charalambous, C., Department of Computer Science and Engineering, Frederick University, P.O. Box 24729, 1303 Nicosia, Cyprus |
dc.contributor.affiliation |
Fleszar, K., Olayan School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon |
dc.contributor.authorAddress |
Charalambous, C.; Department of Computer Science and Engineering, Frederick University, P.O. Box 24729, 1303 Nicosia, Cyprus; email: c.charalambous@frederick.ac.cy |
dc.contributor.authorCorporate |
University: American University of Beirut; Faculty: Suliman S. Olayan School of Business; Department: School of Business; |
dc.contributor.authorDepartment |
School of Business |
dc.contributor.authorDivision |
|
dc.contributor.authorEmail |
c.charalambous@frederick.ac.cy; kf09@aub.edu.lb |
dc.contributor.faculty |
Suliman S. Olayan School of Business |
dc.contributor.authorInitials |
Charalambous, C |
dc.contributor.authorInitials |
Fleszar, K |
dc.contributor.authorOrcidID |
Fleszar, Krzysztof-0000-0001-8863-6756; |
dc.contributor.authorReprintAddress |
Charalambous, C (reprint author), Frederick Univ, Dept Comp Sci and Engn, POB 24729, CY-1303 Nicosia, Cyprus. |
dc.contributor.authorResearcherID |
Fleszar, Krzysztof-B-8260-2012; Charalambous, Christoforos-A-4071-2013 |
dc.contributor.authorUniversity |
American University of Beirut |
dc.description.cited |
Alvelos F, 2009, ENG OPTIMIZ, V41, P773, DOI 10.1080-03052150902835960; BERKEY JO, 1987, J OPER RES SOC, V38, P423, DOI 10.2307-2582731; Clautiaux F, 2007, OPER RES LETT, V35, P365, DOI 10.1016-j.orl.2006.07.001; DYCKHOFF H, 1990, EUR J OPER RES, V44, P145, DOI 10.1016-0377-2217(90)90350-K; Lodi A, 2002, EUR J OPER RES, V141, P241, DOI 10.1016-S0377-2217(02)00123-6; Lodi A, 2002, DISCRETE APPL MATH, V123, P379, DOI 10.1016-S0166-218X(01)00347-X; Lodi A, 1999, INFORMS J COMPUT, V11, P345, DOI 10.1287-ijoc.11.4.345; Martello S, 1998, MANAGE SCI, V44, P388, DOI 10.1287-mnsc.44.3.388; Polyakovsky S, 2009, EUR J OPER RES, V192, P767, DOI 10.1016-j.ejor.2007.10.020; Puchinger J, 2007, EUR J OPER RES, V183, P1304, DOI 10.1016-j.ejor.2005.11.064; VIGO D, 2002, DISCRETE APPL MATH, V118, P12; Wascher G, 2007, EUR J OPER RES, V183, P1109, DOI 10.1016-j.ejor.2005.12.047 |
dc.description.citedCount |
6 |
dc.description.citedTotWOSCount |
7 |
dc.description.citedWOSCount |
7 |
dc.format.extentCount |
9 |
dc.identifier.articleNo |
|
dc.identifier.coden |
CMORA |
dc.identifier.scopusID |
79951554767 |
dc.publisher.address |
THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND |
dc.relation.ispartOfISOAbbr |
Comput. Oper. Res. |
dc.relation.ispartOfIssue |
10 |
dc.relation.ispartofPubTitle |
Computers and Operations Research |
dc.relation.ispartofPubTitleAbbr |
Comp. Oper. Res. |
dc.relation.ispartOfVolume |
38 |
dc.source.ID |
WOS:000288410200007 |
dc.type.publication |
Journal |
dc.subject.otherAuthKeyword |
Constructive Heuristic |
dc.subject.otherAuthKeyword |
Guillotine Cut |
dc.subject.otherAuthKeyword |
Two-Dimensional Bin Packing |
dc.subject.otherIndex |
Benchmark-Problem Instances |
dc.subject.otherIndex |
Bin Packing Problem |
dc.subject.otherIndex |
Constructive Heuristic |
dc.subject.otherIndex |
Guillotine Cut |
dc.subject.otherIndex |
Guillotine Cuts |
dc.subject.otherIndex |
Two-Dimensional Bin Packing |
dc.subject.otherIndex |
Heuristic Algorithms |
dc.subject.otherIndex |
Two Dimensional |
dc.subject.otherIndex |
Bins |
dc.subject.otherKeywordPlus |
Algorithms |
dc.subject.otherKeywordPlus |
Typology |
dc.subject.otherWOS |
Computer Science, Interdisciplinary Applications |
dc.subject.otherWOS |
Engineering, Industrial |
dc.subject.otherWOS |
Operations Research and Management Science |
dc.identifier.doi |
http://dx.doi.org/10.1016/j.cor.2010.12.013 |