Rectangle packing with a recursive Pilot Method
Saved in:
Published in | Computers & operations research Vol. 161; p. 106447 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
01.01.2024
|
Online Access | Get full text |
ISSN | 0305-0548 |
DOI | 10.1016/j.cor.2023.106447 |
Cover
ArticleNumber | 106447 |
---|---|
Author | Soma, Nei Yoshihiro Arruda, Vitor Pimenta dos Reis Mirisola, Luiz Gustavo Bizarro |
Author_xml | – sequence: 1 givenname: Vitor Pimenta dos Reis orcidid: 0000-0002-4143-8346 surname: Arruda fullname: Arruda, Vitor Pimenta dos Reis – sequence: 2 givenname: Luiz Gustavo Bizarro orcidid: 0000-0002-2689-452X surname: Mirisola fullname: Mirisola, Luiz Gustavo Bizarro – sequence: 3 givenname: Nei Yoshihiro surname: Soma fullname: Soma, Nei Yoshihiro |
BookMark | eNotz01OwzAUBGAvikRbOAA7XyDpe7Zjp0tU8ScVgRCsLdtxWocQV3YAcXtStbMZzWakb0FmQxw8ITcIJQLKVVe6mEoGjE9bCqFmZA4cqgIqUV-SRc4dTFEM52T15t1ohl3v6cG4zzDs6G8Y99TQ5N13yuHH09fQx5E--3Efmyty0Zo---tzL8nH_d375rHYvjw8bW63hWOMjQXjdu2VrW0j0DrD_ZoDRwk1Q2utadoKoFIVKmuEdYqbxjLHoZXIpEIp-JLg6delmHPyrT6k8GXSn0bQR6Xu9KTUR6U-Kfk_oHpJSA |
Cites_doi | 10.1137/0209064 10.1007/s10878-015-9961-z 10.1007/s00291-021-00619-y 10.1016/j.eswa.2011.04.105 10.1057/jors.1985.51 10.1016/j.ejor.2020.06.050 10.1287/ijoc.1120.0505 10.1016/j.cor.2010.10.022 10.1016/j.simpat.2007.09.004 10.1287/opre.25.1.30 10.1016/j.ejor.2011.06.002 10.1016/j.cor.2008.03.004 10.1109/ACCESS.2020.3045905 10.1016/j.cor.2005.12.005 10.1007/s10100-013-0300-0 10.1093/comjnl/25.3.353 10.1287/opre.33.1.49 10.1016/S0377-2217(00)00263-0 10.1287/opre.1040.0109 10.1016/j.cor.2016.11.024 10.1016/j.cor.2012.05.001 10.1080/0305215X.2017.1315571 10.1016/j.ejor.2005.12.047 10.1016/S0377-2217(99)00357-4 10.1016/j.cor.2009.05.008 10.1016/j.cie.2019.106097 10.1016/j.cor.2011.08.005 10.1016/S0377-2217(02)00129-7 10.1111/itor.12138 |
ContentType | Journal Article |
DBID | AAYXX CITATION |
DOI | 10.1016/j.cor.2023.106447 |
DatabaseName | CrossRef |
DatabaseTitle | CrossRef |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Computer Science Business |
ExternalDocumentID | 10_1016_j_cor_2023_106447 |
GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AAEDT AAEDW AAFJI AAIKJ AAKOC AALRI AAOAW AAQXK AARIN AATTM AAXKI AAXUO AAYFN AAYOK AAYWO AAYXX ABAOU ABBOA ABDPE ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABWVN ABXDB ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADGUI ADJOM ADMUD ADNMO AEBSH AEFWE AEHXG AEIPS AEKER AENEX AEUPX AFFNX AFJKZ AFPUW AFTJW AFXIZ AGCQF AGHFR AGQPQ AGRNS AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGII AIGVJ AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOMHK AOUOD APLSM APXCP ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC BNPGV CITATION CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSH SSO SSV SSW SSZ T5K TAE TN5 U5U UPT VH1 WUQ XPP ZMT ~02 ~G- |
ID | FETCH-LOGICAL-c222t-23b9e7b8bd41bca3e9303160821bbbadf50057517ba4bc73adb2c30f612671643 |
ISSN | 0305-0548 |
IngestDate | Tue Jul 01 02:06:40 EDT 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c222t-23b9e7b8bd41bca3e9303160821bbbadf50057517ba4bc73adb2c30f612671643 |
ORCID | 0000-0002-4143-8346 0000-0002-2689-452X |
ParticipantIDs | crossref_primary_10_1016_j_cor_2023_106447 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2024-01-00 |
PublicationDateYYYYMMDD | 2024-01-01 |
PublicationDate_xml | – month: 01 year: 2024 text: 2024-01-00 |
PublicationDecade | 2020 |
PublicationTitle | Computers & operations research |
PublicationYear | 2024 |
References | Leung (10.1016/j.cor.2023.106447_b20) 2011; 38 Wei (10.1016/j.cor.2023.106447_b31) 2016; 23 Leung (10.1016/j.cor.2023.106447_b21) 2011; 215 10.1016/j.cor.2023.106447_b23 Hopper (10.1016/j.cor.2023.106447_b14) 2001; 128 Imahori (10.1016/j.cor.2023.106447_b17) 2010; 37 Beasley (10.1016/j.cor.2023.106447_b2) 1985; 36 Chen (10.1016/j.cor.2023.106447_b7) 2006; 6 Hopper (10.1016/j.cor.2023.106447_b13) 2000 Yin (10.1016/j.cor.2023.106447_b35) 2017 Garey (10.1016/j.cor.2023.106447_b11) 1979 Wei (10.1016/j.cor.2023.106447_b32) 2009; 36 Shiangjen (10.1016/j.cor.2023.106447_b25) 2018; 50 Huang (10.1016/j.cor.2023.106447_b15) 2007; 15 Wang (10.1016/j.cor.2023.106447_b26) 2001; 134 Kierkosz (10.1016/j.cor.2023.106447_b19) 2014; 22 Beasley (10.1016/j.cor.2023.106447_b3) 1985; 33 Wei (10.1016/j.cor.2023.106447_b29) 2017; 80 Christofides (10.1016/j.cor.2023.106447_b9) 1977; 25 Zhu (10.1016/j.cor.2023.106447_b37) 2020; 8 Iori (10.1016/j.cor.2023.106447_b18) 2021; 289 Cazenave (10.1016/j.cor.2023.106447_b6) 2009 Leung (10.1016/j.cor.2023.106447_b22) 2012; 39 Bengtsson (10.1016/j.cor.2023.106447_b4) 1982; 25 Zhang (10.1016/j.cor.2023.106447_b36) 2013; 25 Burke (10.1016/j.cor.2023.106447_b5) 2004; 52 Rakotonirainy (10.1016/j.cor.2023.106447_b24) 2021; 43 Yang (10.1016/j.cor.2023.106447_b34) 2013; 40 Wang (10.1016/j.cor.2023.106447_b27) 2016; 32 Huang (10.1016/j.cor.2023.106447_b16) 2007; 34 Chen (10.1016/j.cor.2023.106447_b8) 2019; 137 Wei (10.1016/j.cor.2023.106447_b30) 2011 Wäscher (10.1016/j.cor.2023.106447_b28) 2007; 183 Wu (10.1016/j.cor.2023.106447_b33) 2002; 141 Duin (10.1016/j.cor.2023.106447_b10) 1999; 34 Baker (10.1016/j.cor.2023.106447_b1) 1980; 9 He (10.1016/j.cor.2023.106447_b12) 2012; 39 |
References_xml | – volume: 9 start-page: 846 issue: 4 year: 1980 ident: 10.1016/j.cor.2023.106447_b1 article-title: Orthogonal packings in two dimensions publication-title: SIAM J. Comput. doi: 10.1137/0209064 – volume: 32 start-page: 416 issue: 2 year: 2016 ident: 10.1016/j.cor.2023.106447_b27 article-title: A quasi-human algorithm for the two dimensional rectangular strip packing problem: In memory of prof. Wenqi Huang publication-title: J. Combin. Optim. doi: 10.1007/s10878-015-9961-z – start-page: 456 year: 2009 ident: 10.1016/j.cor.2023.106447_b6 article-title: Nested Monte-Carlo search – volume: 43 start-page: 467 issue: 2 year: 2021 ident: 10.1016/j.cor.2023.106447_b24 article-title: The effect of benchmark data characteristics during empirical strip packing Heuristic performance evaluation publication-title: OR Spectrum doi: 10.1007/s00291-021-00619-y – volume: 38 start-page: 13032 issue: 10 year: 2011 ident: 10.1016/j.cor.2023.106447_b20 article-title: A fast layer-based Heuristic for non-guillotine strip packing publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2011.04.105 – volume: 36 start-page: 297 issue: 4 year: 1985 ident: 10.1016/j.cor.2023.106447_b2 article-title: Algorithms for unconstrained two-dimensional guillotine cutting publication-title: J. Oper. Res. Soc. doi: 10.1057/jors.1985.51 – volume: 289 start-page: 399 issue: 2 year: 2021 ident: 10.1016/j.cor.2023.106447_b18 article-title: Exact solution techniques for two-dimensional cutting and packing publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2020.06.050 – volume: 25 start-page: 332 issue: 2 year: 2013 ident: 10.1016/j.cor.2023.106447_b36 article-title: A binary search Heuristic algorithm based on randomized local search for the rectangular strip-packing problem publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1120.0505 – volume: 6 start-page: 115 issue: 12 year: 2006 ident: 10.1016/j.cor.2023.106447_b7 article-title: A novel quasi-human Heuristic algorithm for two-dimensional rectangle packing problem publication-title: Int. J. Comput. Sci. Netw. Secur. – volume: 39 start-page: 64 issue: 1 year: 2012 ident: 10.1016/j.cor.2023.106447_b22 article-title: A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2010.10.022 – start-page: 286 year: 2011 ident: 10.1016/j.cor.2023.106447_b30 article-title: A skyline-based Heuristic for the 2D rectangular strip packing problem – volume: 15 start-page: 1356 issue: 10 year: 2007 ident: 10.1016/j.cor.2023.106447_b15 article-title: An efficient Heuristic algorithm for rectangle-packing problem publication-title: Simul. Model. Pract. Theory doi: 10.1016/j.simpat.2007.09.004 – volume: 25 start-page: 30 issue: 1 year: 1977 ident: 10.1016/j.cor.2023.106447_b9 article-title: An algorithm for two-dimensional cutting problems publication-title: Oper. Res. doi: 10.1287/opre.25.1.30 – volume: 215 start-page: 57 issue: 1 year: 2011 ident: 10.1016/j.cor.2023.106447_b21 article-title: A two-stage intelligent search algorithm for the two-dimensional strip packing problem publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2011.06.002 – volume: 36 start-page: 1608 issue: 5 year: 2009 ident: 10.1016/j.cor.2023.106447_b32 article-title: A least wasted first Heuristic algorithm for the rectangular packing problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2008.03.004 – volume: 8 start-page: 226784 year: 2020 ident: 10.1016/j.cor.2023.106447_b37 article-title: Hybrid Heuristic algorithm based on improved rules & reinforcement learning for 2D strip packing problem publication-title: IEEE Access doi: 10.1109/ACCESS.2020.3045905 – volume: 34 start-page: 3270 issue: 11 year: 2007 ident: 10.1016/j.cor.2023.106447_b16 article-title: A new Heuristic algorithm for rectangle packing publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2005.12.005 – volume: 22 start-page: 729 issue: 4 year: 2014 ident: 10.1016/j.cor.2023.106447_b19 article-title: A hybrid evolutionary algorithm for the two-dimensional packing problem publication-title: CEJOR Cent. Eur. J. Oper. Res. doi: 10.1007/s10100-013-0300-0 – volume: 25 start-page: 353 issue: 3 year: 1982 ident: 10.1016/j.cor.2023.106447_b4 article-title: Packing rectangular pieces: A Heuristic approach publication-title: Comput. J. doi: 10.1093/comjnl/25.3.353 – volume: 34 start-page: 181 issue: 3 year: 1999 ident: 10.1016/j.cor.2023.106447_b10 article-title: The pilot method: A strategy for Heuristic repetition with application to the steiner problem in graphs publication-title: Netw. Int. J. – start-page: 124 year: 1979 ident: 10.1016/j.cor.2023.106447_b11 article-title: Coping with NP-complete problems – volume: 33 start-page: 49 issue: 1 year: 1985 ident: 10.1016/j.cor.2023.106447_b3 article-title: An exact two-dimensional non-guillotine cutting tree search procedure publication-title: Oper. Res. doi: 10.1287/opre.33.1.49 – volume: 134 start-page: 378 issue: 2 year: 2001 ident: 10.1016/j.cor.2023.106447_b26 article-title: Data set generation for rectangular placement problems publication-title: European J. Oper. Res. doi: 10.1016/S0377-2217(00)00263-0 – start-page: 165 year: 2017 ident: 10.1016/j.cor.2023.106447_b35 article-title: A beam search approach based on action space for the 2D rectangular packing problem – volume: 52 start-page: 655 issue: 4 year: 2004 ident: 10.1016/j.cor.2023.106447_b5 article-title: A new placement Heuristic for the orthogonal stock-cutting problem publication-title: Oper. Res. doi: 10.1287/opre.1040.0109 – volume: 80 start-page: 113 year: 2017 ident: 10.1016/j.cor.2023.106447_b29 article-title: An improved skyline based Heuristic for the 2D strip packing problem and its efficient implementation publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2016.11.024 – ident: 10.1016/j.cor.2023.106447_b23 – volume: 40 start-page: 1 issue: 1 year: 2013 ident: 10.1016/j.cor.2023.106447_b34 article-title: A simple randomized algorithm for two-dimensional strip packing publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2012.05.001 – volume: 50 start-page: 347 issue: 2 year: 2018 ident: 10.1016/j.cor.2023.106447_b25 article-title: An iterative bidirectional Heuristic placement algorithm for solving the two-dimensional knapsack packing problem publication-title: Eng. Optim. doi: 10.1080/0305215X.2017.1315571 – volume: 183 start-page: 1109 issue: 3 year: 2007 ident: 10.1016/j.cor.2023.106447_b28 article-title: An improved typology of cutting and packing problems publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2005.12.047 – volume: 128 start-page: 34 issue: 1 year: 2001 ident: 10.1016/j.cor.2023.106447_b14 article-title: An empirical investigation of meta-Heuristic and Heuristic algorithms for a 2D packing problem publication-title: European J. Oper. Res. doi: 10.1016/S0377-2217(99)00357-4 – volume: 37 start-page: 325 issue: 2 year: 2010 ident: 10.1016/j.cor.2023.106447_b17 article-title: The best-fit Heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2009.05.008 – volume: 137 year: 2019 ident: 10.1016/j.cor.2023.106447_b8 article-title: An efficient deterministic Heuristic algorithm for the rectangular packing problem publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2019.106097 – volume: 39 start-page: 1355 issue: 7 year: 2012 ident: 10.1016/j.cor.2023.106447_b12 article-title: An efficient deterministic Heuristic for two-dimensional rectangular packing publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.08.005 – volume: 141 start-page: 341 issue: 2 year: 2002 ident: 10.1016/j.cor.2023.106447_b33 article-title: An effective quasi-human based Heuristic for solving the rectangle packing problem publication-title: European J. Oper. Res. doi: 10.1016/S0377-2217(02)00129-7 – year: 2000 ident: 10.1016/j.cor.2023.106447_b13 – volume: 23 start-page: 65 issue: 1–2 year: 2016 ident: 10.1016/j.cor.2023.106447_b31 article-title: An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem publication-title: Int. Trans. Oper. Res. doi: 10.1111/itor.12138 |
SSID | ssj0000721 |
Score | 2.4148898 |
SourceID | crossref |
SourceType | Index Database |
StartPage | 106447 |
Title | Rectangle packing with a recursive Pilot Method |
Volume | 161 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwELVYJAQHlgJilw-ciFKavT0CAlWIIg4tKqfIdlwaKA0KKYce-HbGSxY2CbhEVWKNoryp_WY884zQIaypjRYR-4NuwE2X-ZbZ4g4zYSX0m5EFAYTULehc--2ee9n3-uVxR7K7JKN1Nv22r-Q_qMI9wFV0yf4B2cIo3IDfgC9cAWG4_gpj4HzA7e5H3IDI97FIqxIjFVl0WZh-E4-SzOjIc6KrRDQ_zeFFYp8881TXxGn1n2HpCekkkgzzFv78KRiU5eZGlIgOk7ig5J1YnGY4kiOvJvEUnA-I52tinMZTIfRYpHKSJznmmsfGXfIyjIexfqhzD7ZbyT3onitR-ucprcxiPlXq6npGhJDTVZqaXyZrlTd4AACEMKvt1MuxH4WxPy1YRRlhXqH2EIKJUJgIlYlZNG8Hgdy2r7-VJT9CC07tKqm3zne5Zb3fp7eo8JQK4eiuomUdKeATBfsamuHjGlrIGxVqaCWHEOv5uYaWKuqS6-i4cA-s3QML98AEF-6BpXtg5R4bqHdx3j1rm_p8DJMBq8tM26EtHtAmjVyLMuLwFvARywdSZ1FKSTTwRKuxZwWUuJQFDomozZzGAEitL8JkZxPNjZMx30I4avgsGHiMNiE8b_icEkJcf0CaEZjnNttGR_nXCJ-VDEr449ff-cvgXbRYetYemsvSCd8HnpfRAwneO64QURc |
linkProvider | Elsevier |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Rectangle+packing+with+a+recursive+Pilot+Method&rft.jtitle=Computers+%26+operations+research&rft.au=Arruda%2C+Vitor+Pimenta+dos+Reis&rft.au=Mirisola%2C+Luiz+Gustavo+Bizarro&rft.au=Soma%2C+Nei+Yoshihiro&rft.date=2024-01-01&rft.issn=0305-0548&rft.volume=161&rft.spage=106447&rft_id=info:doi/10.1016%2Fj.cor.2023.106447&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cor_2023_106447 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |