An effective placement method for the single container loading problem

•The studied 3D container loading problem is formed as a mixed integer linear programming.•Due to the NP-hardness, we propose a simple but effective loading placement heuristic.•The experiments demonstrate that proposed heuristic outperforms reference methods.•The proposed heuristic is capable of so...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & industrial engineering Ročník 97; s. 212 - 221
Hlavní autoři: Huang, Yao-Huei, Hwang, F.J., Lu, Hao-Chun
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.07.2016
Pergamon Press Inc
Témata:
ISSN:0360-8352, 1879-0550
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract •The studied 3D container loading problem is formed as a mixed integer linear programming.•Due to the NP-hardness, we propose a simple but effective loading placement heuristic.•The experiments demonstrate that proposed heuristic outperforms reference methods.•The proposed heuristic is capable of solving large-scale instances efficiently. This study investigates a three-dimensional single container loading problem, which aims to pack a given set of unequal-size rectangular boxes into a single container such that the length of the occupied space in the container is minimized. Motivated by the practical logistics instances in literature, the problem under study is formulated as a zero-one mixed integer linear programming model. Due to the NP-hardness of the studied problem, a simple but effective loading placement heuristic is proposed for solving large-size instances. The experimental results demonstrate that the developed heuristic is capable of solving the instances with more than two hundred boxes and more efficient than the state-of-the-art mixed integer linear program and existing heuristic methods.
AbstractList This study investigates a three-dimensional single container loading problem, which aims to pack a given set of unequal-size rectangular boxes into a single container such that the length of the occupied space in the container is minimized. Motivated by the practical logistics instances in literature, the problem under study is formulated as a zero-one mixed integer linear programming model. Due to the NP-hardness of the studied problem, a simple but effective loading placement heuristic is proposed for solving large-size instances. The experimental results demonstrate that the developed heuristic is capable of solving the instances with more than two hundred boxes and more efficient than the state-of-the-art mixed integer linear program and existing heuristic methods.
•The studied 3D container loading problem is formed as a mixed integer linear programming.•Due to the NP-hardness, we propose a simple but effective loading placement heuristic.•The experiments demonstrate that proposed heuristic outperforms reference methods.•The proposed heuristic is capable of solving large-scale instances efficiently. This study investigates a three-dimensional single container loading problem, which aims to pack a given set of unequal-size rectangular boxes into a single container such that the length of the occupied space in the container is minimized. Motivated by the practical logistics instances in literature, the problem under study is formulated as a zero-one mixed integer linear programming model. Due to the NP-hardness of the studied problem, a simple but effective loading placement heuristic is proposed for solving large-size instances. The experimental results demonstrate that the developed heuristic is capable of solving the instances with more than two hundred boxes and more efficient than the state-of-the-art mixed integer linear program and existing heuristic methods.
Author Hwang, F.J.
Huang, Yao-Huei
Lu, Hao-Chun
Author_xml – sequence: 1
  givenname: Yao-Huei
  surname: Huang
  fullname: Huang, Yao-Huei
  email: yaohuei.huang@gmail.com
  organization: School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China
– sequence: 2
  givenname: F.J.
  surname: Hwang
  fullname: Hwang, F.J.
  email: feng-jang.hwang@uts.edu.au
  organization: School of Mathematical and Physical Sciences, University of Technology Sydney, Ultimo 2007, Australia
– sequence: 3
  givenname: Hao-Chun
  orcidid: 0000-0001-6245-2094
  surname: Lu
  fullname: Lu, Hao-Chun
  email: haoclu@gmail.com
  organization: Department of Information Management, Fu Jen Catholic University, New Taipei City 24205, Taiwan
BookMark eNp9kTFvGyEYQFGVSnXS_IBuSF2y3PWDO-5AnSyrbiJF6tLOCHMfCdYduIAt5d8Xy508ZAKh9z7Q45bchBiQkC8MWgZs-LZvrceW120LogWQH8iKyVE1IATckBV0AzSyE_wTuc15DwC9UGxFtutA0Tm0xZ-QHmZjccFQ6ILlNU7UxUTLK9Lsw8uM1MZQjA-Y6BzNVM_oIcXdjMtn8tGZOeP9__WO_Nn--L15bJ5__XzarJ8b2zNWGsVGMUAnUAkulAIOkxNOukkYNYpejgx3zHEcZOc61ls2OT4piePIB4kCuzvycJlb7_17xFz04rPFeTYB4zFrJnkd06uhr-jXK3QfjynU12k2qoErUEJUil0om2LOCZ0-JL-Y9KYZ6HNZvde1rD6X1SB0LVud8cqxvpjia5xk_Pyu-f1iYm108ph0rkiwOPlUv0BP0b9j_wPfvJM6
CODEN CINDDL
CitedBy_id crossref_primary_10_1155_2022_1497148
crossref_primary_10_1155_2022_1517280
crossref_primary_10_1016_j_asoc_2025_113473
crossref_primary_10_1080_0305215X_2021_1913734
crossref_primary_10_3390_sym11060756
crossref_primary_10_1155_2024_4456261
crossref_primary_10_1016_j_cie_2022_108505
crossref_primary_10_1007_s10479_017_2723_9
crossref_primary_10_3390_math9151742
crossref_primary_10_1080_17517575_2019_1631964
crossref_primary_10_1016_j_cor_2024_106889
crossref_primary_10_1016_j_ejor_2020_03_040
crossref_primary_10_1016_j_cor_2024_106651
crossref_primary_10_1016_j_cie_2018_11_012
crossref_primary_10_1080_0305215X_2017_1411484
crossref_primary_10_1016_j_asoc_2023_110417
crossref_primary_10_1016_j_eswa_2023_121222
crossref_primary_10_1088_1757_899X_912_3_032010
crossref_primary_10_3390_app13116601
crossref_primary_10_1016_j_eswa_2024_123340
crossref_primary_10_1016_j_asoc_2020_106497
Cites_doi 10.1016/S0377-2217(02)00133-9
10.1016/S0305-0548(03)00019-4
10.1016/j.ejor.2005.07.031
10.1016/j.cor.2010.01.010
10.1007/BF01545534
10.1016/S0377-2217(02)00135-2
10.1016/S0167-8191(03)00047-4
10.1016/S0377-2217(99)00292-1
10.1016/0377-2217(94)00002-T
10.1016/j.ejor.2012.05.039
10.1080/01441640902796349
10.1155/2012/931092
10.1080/03052150600603264
10.1016/0377-2217(90)90362-F
10.1016/S0377-2217(02)00132-7
10.1080/05695558208974601
10.1287/ijoc.1090.0338
10.1016/0305-0548(80)90001-5
10.1016/j.cor.2011.10.019
ContentType Journal Article
Copyright 2016 Elsevier Ltd
Copyright Pergamon Press Inc. Jul 2016
Copyright_xml – notice: 2016 Elsevier Ltd
– notice: Copyright Pergamon Press Inc. Jul 2016
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.cie.2016.05.008
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts

Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Engineering
EISSN 1879-0550
EndPage 221
ExternalDocumentID 4088213121
10_1016_j_cie_2016_05_008
S0360835216301486
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
9JO
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAFWJ
AAIKC
AAIKJ
AAKOC
AALRI
AAMNW
AAOAW
AAQFI
AAQXK
AARIN
AATTM
AAXKI
AAXUO
ABAOU
ABDPE
ABJNI
ABMAC
ABUCO
ABWVN
ABXDB
ACDAQ
ACGFO
ACGFS
ACNCT
ACNNM
ACRLP
ACRPL
ADBBV
ADEZE
ADGUI
ADMUD
ADNMO
ADRHT
ADTZH
AEBSH
AECPX
AEIPS
AEKER
AENEX
AFJKZ
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AIEXJ
AIGVJ
AIKHN
AITUG
AKRWK
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BKOMP
BLXMC
BNPGV
CS3
DU5
EBS
EFJIC
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HAMUX
HLZ
HVGLF
HZ~
H~9
IHE
J1W
JJJVA
KOM
LX9
LY1
LY7
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
RNS
ROL
RPZ
RXW
SBC
SDF
SDG
SDP
SDS
SES
SET
SEW
SPC
SPCBC
SSB
SSD
SSH
SST
SSW
SSZ
T5K
TAE
TN5
WUQ
XPP
ZMT
~G-
9DU
AAYWO
AAYXX
ACLOT
ACVFH
ADCNI
AEUPX
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKYEP
APXCP
CITATION
EFKBS
EFLBG
~HD
7SC
8FD
AFXIZ
AGCQF
AGRNS
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c411t-91756035e952599020df5f8fd5a9754871eb1f2e683f314c1df2d98e77268e5e3
ISICitedReferencesCount 27
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000378662500019&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0360-8352
IngestDate Sun Sep 28 11:40:00 EDT 2025
Fri Jul 25 04:15:47 EDT 2025
Sat Nov 29 01:39:49 EST 2025
Tue Nov 18 20:05:56 EST 2025
Sun Apr 06 06:54:02 EDT 2025
IsPeerReviewed true
IsScholarly true
Keywords Loading placement
Container loading problem
Mixed integer linear program
Heuristic
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c411t-91756035e952599020df5f8fd5a9754871eb1f2e683f314c1df2d98e77268e5e3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ORCID 0000-0001-6245-2094
PQID 1796290955
PQPubID 9545
PageCount 10
ParticipantIDs proquest_miscellaneous_1825484964
proquest_journals_1796290955
crossref_primary_10_1016_j_cie_2016_05_008
crossref_citationtrail_10_1016_j_cie_2016_05_008
elsevier_sciencedirect_doi_10_1016_j_cie_2016_05_008
PublicationCentury 2000
PublicationDate 2016-07-01
PublicationDateYYYYMMDD 2016-07-01
PublicationDate_xml – month: 07
  year: 2016
  text: 2016-07-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Computers & industrial engineering
PublicationYear 2016
Publisher Elsevier Ltd
Pergamon Press Inc
Publisher_xml – name: Elsevier Ltd
– name: Pergamon Press Inc
References George, Robinson (b0055) 1980; 7
Hodgson (b0070) 1982; 14
Zhang, Peng, Leung (b0110) 2012; 39
Hifi (b0065) 2004; 31
GUROBI, 2014. Gurobi Optimizer 5.6.2. Reference Manual.
Holland (b0075) 1975
Zhu, Huang, Lim (b0115) 2012; 223
Fanslau, Bortfeldt (b0050) 2010; 22
Chou, Lu (b0035) 2009; 29
.
Hu, Li, Tsai (b0080) 2012
Tsai, Wang, Lin (b0105) 2014
Bischoff, Marriott (b0010) 1990; 44
Bortfeldt, Mack (b0020) 2007; 183
Pisinger (b0090) 2002; 141
Faina (b0045) 2000; 126
Lins, Lins, Morabito (b0085) 2002; 141
Ratcliff, Bischoff (b0095) 1998; 20
Chen, Lee, Shen (b0030) 1995; 80
Bortfeldt, Gehring, Mack (b0015) 2003; 29
Tsai, Li (b0100) 2006; 38
Almeida, Figueiredo (b0005) 2010; 37
Eley (b0040) 2002; 141
Hifi (10.1016/j.cie.2016.05.008_b0065) 2004; 31
Zhang (10.1016/j.cie.2016.05.008_b0110) 2012; 39
Almeida (10.1016/j.cie.2016.05.008_b0005) 2010; 37
Hodgson (10.1016/j.cie.2016.05.008_b0070) 1982; 14
Bortfeldt (10.1016/j.cie.2016.05.008_b0015) 2003; 29
Pisinger (10.1016/j.cie.2016.05.008_b0090) 2002; 141
Eley (10.1016/j.cie.2016.05.008_b0040) 2002; 141
Chou (10.1016/j.cie.2016.05.008_b0035) 2009; 29
Tsai (10.1016/j.cie.2016.05.008_b0105) 2014
Faina (10.1016/j.cie.2016.05.008_b0045) 2000; 126
Holland (10.1016/j.cie.2016.05.008_b0075) 1975
Lins (10.1016/j.cie.2016.05.008_b0085) 2002; 141
Bortfeldt (10.1016/j.cie.2016.05.008_b0020) 2007; 183
Bischoff (10.1016/j.cie.2016.05.008_b0010) 1990; 44
Hu (10.1016/j.cie.2016.05.008_b0080) 2012
10.1016/j.cie.2016.05.008_b0060
Ratcliff (10.1016/j.cie.2016.05.008_b0095) 1998; 20
Zhu (10.1016/j.cie.2016.05.008_b0115) 2012; 223
George (10.1016/j.cie.2016.05.008_b0055) 1980; 7
Chen (10.1016/j.cie.2016.05.008_b0030) 1995; 80
Fanslau (10.1016/j.cie.2016.05.008_b0050) 2010; 22
Tsai (10.1016/j.cie.2016.05.008_b0100) 2006; 38
References_xml – year: 2012
  ident: b0080
  article-title: Solving packing problems by a distributed global optimization algorithm
  publication-title: Mathematical Problems in Engineering
– volume: 223
  start-page: 27
  year: 2012
  end-page: 39
  ident: b0115
  article-title: A prototype column generation strategy for the multiple container loading problem
  publication-title: European Journal of Operational Research
– volume: 183
  start-page: 1267
  year: 2007
  end-page: 1279
  ident: b0020
  article-title: A heuristic for the three-dimensional strip packing problem
  publication-title: European Journal of Operational Research
– volume: 37
  start-page: 1968
  year: 2010
  end-page: 1976
  ident: b0005
  article-title: A particular approach for the three-dimensional packing problem with additional constraints
  publication-title: Computers & Operations Research
– volume: 44
  start-page: 267
  year: 1990
  end-page: 276
  ident: b0010
  article-title: A comparative evaluation of heuristics for container loading
  publication-title: European Journal of Operational Research
– volume: 22
  start-page: 222
  year: 2010
  end-page: 235
  ident: b0050
  article-title: A tree search algorithm for solving the container loading problem
  publication-title: INFORMS Journal on Computing
– reference: GUROBI, 2014. Gurobi Optimizer 5.6.2. Reference Manual. <
– year: 1975
  ident: b0075
  article-title: Adaptation in natural and artificial systems
– volume: 80
  start-page: 68
  year: 1995
  end-page: 76
  ident: b0030
  article-title: An analytical model for the container loading problem
  publication-title: European Journal of Operational Research
– reference: >.
– volume: 14
  start-page: 175
  year: 1982
  end-page: 182
  ident: b0070
  article-title: A combined approach to the pallet loading problem
  publication-title: IIE Transactions
– volume: 29
  start-page: 741
  year: 2009
  end-page: 758
  ident: b0035
  article-title: Assessing service quality, switching costs and customer loyalty in home-delivery services in Taiwan
  publication-title: Transport Reviews
– volume: 7
  start-page: 147
  year: 1980
  end-page: 156
  ident: b0055
  article-title: A heuristic for packing boxes into a container
  publication-title: Computers & Operations Research
– volume: 141
  start-page: 421
  year: 2002
  end-page: 439
  ident: b0085
  article-title: An
  publication-title: European Journal of Operational Research
– volume: 20
  start-page: 65
  year: 1998
  end-page: 71
  ident: b0095
  article-title: Allowing for weight considerations in container loading
  publication-title: OR Spectrum
– year: 2014
  ident: b0105
  article-title: A global optimization approach for solving three-dimensional open dimension rectangular packing problems
  publication-title: Optimization
– volume: 29
  start-page: 641
  year: 2003
  end-page: 662
  ident: b0015
  article-title: A parallel tabu search algorithm for solving the container loading problem
  publication-title: Parallel Computing
– volume: 141
  start-page: 382
  year: 2002
  end-page: 392
  ident: b0090
  article-title: Heuristics for the container loading problem
  publication-title: European Journal of Operational Research
– volume: 38
  start-page: 687
  year: 2006
  end-page: 700
  ident: b0100
  article-title: A global optimization method for packing problems
  publication-title: Engineering Optimization
– volume: 141
  start-page: 393
  year: 2002
  end-page: 409
  ident: b0040
  article-title: Solving container loading problems by block arrangement
  publication-title: European Journal of Operational Research
– volume: 126
  start-page: 340
  year: 2000
  end-page: 354
  ident: b0045
  article-title: A global optimization algorithm for the three-dimensional packing problem
  publication-title: European Journal of Operational Research
– volume: 31
  start-page: 657
  year: 2004
  end-page: 674
  ident: b0065
  article-title: Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
  publication-title: Computers & Operations Research
– volume: 39
  start-page: 2267
  year: 2012
  end-page: 2276
  ident: b0110
  article-title: A heuristic block-loading algorithm based on multi-layer search for the container loading problem
  publication-title: Computers & Operations Research
– volume: 141
  start-page: 393
  year: 2002
  ident: 10.1016/j.cie.2016.05.008_b0040
  article-title: Solving container loading problems by block arrangement
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(02)00133-9
– volume: 31
  start-page: 657
  year: 2004
  ident: 10.1016/j.cie.2016.05.008_b0065
  article-title: Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
  publication-title: Computers & Operations Research
  doi: 10.1016/S0305-0548(03)00019-4
– year: 1975
  ident: 10.1016/j.cie.2016.05.008_b0075
– volume: 183
  start-page: 1267
  year: 2007
  ident: 10.1016/j.cie.2016.05.008_b0020
  article-title: A heuristic for the three-dimensional strip packing problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/j.ejor.2005.07.031
– volume: 37
  start-page: 1968
  year: 2010
  ident: 10.1016/j.cie.2016.05.008_b0005
  article-title: A particular approach for the three-dimensional packing problem with additional constraints
  publication-title: Computers & Operations Research
  doi: 10.1016/j.cor.2010.01.010
– volume: 20
  start-page: 65
  year: 1998
  ident: 10.1016/j.cie.2016.05.008_b0095
  article-title: Allowing for weight considerations in container loading
  publication-title: OR Spectrum
  doi: 10.1007/BF01545534
– volume: 141
  start-page: 421
  year: 2002
  ident: 10.1016/j.cie.2016.05.008_b0085
  article-title: An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(02)00135-2
– volume: 29
  start-page: 641
  year: 2003
  ident: 10.1016/j.cie.2016.05.008_b0015
  article-title: A parallel tabu search algorithm for solving the container loading problem
  publication-title: Parallel Computing
  doi: 10.1016/S0167-8191(03)00047-4
– volume: 126
  start-page: 340
  issue: 2
  year: 2000
  ident: 10.1016/j.cie.2016.05.008_b0045
  article-title: A global optimization algorithm for the three-dimensional packing problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(99)00292-1
– volume: 80
  start-page: 68
  year: 1995
  ident: 10.1016/j.cie.2016.05.008_b0030
  article-title: An analytical model for the container loading problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(94)00002-T
– volume: 223
  start-page: 27
  year: 2012
  ident: 10.1016/j.cie.2016.05.008_b0115
  article-title: A prototype column generation strategy for the multiple container loading problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/j.ejor.2012.05.039
– volume: 29
  start-page: 741
  year: 2009
  ident: 10.1016/j.cie.2016.05.008_b0035
  article-title: Assessing service quality, switching costs and customer loyalty in home-delivery services in Taiwan
  publication-title: Transport Reviews
  doi: 10.1080/01441640902796349
– year: 2014
  ident: 10.1016/j.cie.2016.05.008_b0105
  article-title: A global optimization approach for solving three-dimensional open dimension rectangular packing problems
  publication-title: Optimization
– ident: 10.1016/j.cie.2016.05.008_b0060
– year: 2012
  ident: 10.1016/j.cie.2016.05.008_b0080
  article-title: Solving packing problems by a distributed global optimization algorithm
  publication-title: Mathematical Problems in Engineering
  doi: 10.1155/2012/931092
– volume: 38
  start-page: 687
  year: 2006
  ident: 10.1016/j.cie.2016.05.008_b0100
  article-title: A global optimization method for packing problems
  publication-title: Engineering Optimization
  doi: 10.1080/03052150600603264
– volume: 44
  start-page: 267
  year: 1990
  ident: 10.1016/j.cie.2016.05.008_b0010
  article-title: A comparative evaluation of heuristics for container loading
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(90)90362-F
– volume: 141
  start-page: 382
  year: 2002
  ident: 10.1016/j.cie.2016.05.008_b0090
  article-title: Heuristics for the container loading problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(02)00132-7
– volume: 14
  start-page: 175
  year: 1982
  ident: 10.1016/j.cie.2016.05.008_b0070
  article-title: A combined approach to the pallet loading problem
  publication-title: IIE Transactions
  doi: 10.1080/05695558208974601
– volume: 22
  start-page: 222
  issue: 2
  year: 2010
  ident: 10.1016/j.cie.2016.05.008_b0050
  article-title: A tree search algorithm for solving the container loading problem
  publication-title: INFORMS Journal on Computing
  doi: 10.1287/ijoc.1090.0338
– volume: 7
  start-page: 147
  year: 1980
  ident: 10.1016/j.cie.2016.05.008_b0055
  article-title: A heuristic for packing boxes into a container
  publication-title: Computers & Operations Research
  doi: 10.1016/0305-0548(80)90001-5
– volume: 39
  start-page: 2267
  year: 2012
  ident: 10.1016/j.cie.2016.05.008_b0110
  article-title: A heuristic block-loading algorithm based on multi-layer search for the container loading problem
  publication-title: Computers & Operations Research
  doi: 10.1016/j.cor.2011.10.019
SSID ssj0004591
Score 2.29721
Snippet •The studied 3D container loading problem is formed as a mixed integer linear programming.•Due to the NP-hardness, we propose a simple but effective loading...
This study investigates a three-dimensional single container loading problem, which aims to pack a given set of unequal-size rectangular boxes into a single...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 212
SubjectTerms Boxes (containers)
Container loading problem
Containers
Heuristic
Integer programming
Linear programming
Load
Loading operations
Loading placement
Logistics
Mixed integer
Mixed integer linear program
Optimization
Placement
Studies
Three dimensional
Title An effective placement method for the single container loading problem
URI https://dx.doi.org/10.1016/j.cie.2016.05.008
https://www.proquest.com/docview/1796290955
https://www.proquest.com/docview/1825484964
Volume 97
WOSCitedRecordID wos000378662500019&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-0550
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004591
  issn: 0360-8352
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLdg4wAHPgbTChsyErswBSWxndjHajQaqCocOqmcrJA4WqcqLUsD-_N5_ogTbWIaBy5RZTtt5ffz-_Z7CL3nrIooE0nAS8oCWggS8DzOgwTwxAuW5mFqm02ksxlfLMQ31xW1Me0E0rrm19di819JDWNAbH119h_I7b8UBuAzEB2eQHZ43ovw49olaeicIJNyZeL9tlW0zyrULoKVzVTP9f2_k9XaZNOfuA4zQ6W16_zQGJws-2Yfqi9m2MPDOaC_5-vgrFVLP_HbTWR9JGraGskHK08v2nrogIgSn6zaX7wKA63IDZmqTbr1XDEeCNjYXom-xbutG-HyI_A0nXKXmIqqIe8FVRecn32V2fl0KueTxfyYZJufgW4ipoPtx-STJehDtBunTACn3h1_niy-DArI2yaK3X_uAt0m5e_GL_9NVbkhtI0mMn-OnjoTAo8t6V-gB6reQ8-cOYEds2720JNBrcmXKBvX2OMCe1xgiwsMuMCAC2xxgT0usMMFdrh4hc6zyfz0LHBNNIKCRtEWhFkKSi1hSjCwdAVYB2XFKl6VLBepNlcjkNZVrBJOKhLRIiqruBRcgdWVcMUU2Uc79bpWBwiTsizCNC05KQgVpPihdOUiEZaR4nDKkxEKu_2ShaswrxudrGSXSngJ40rqLZYhk7DFI_TBv7Kx5VXuWkw7IkinH1q9TwKE7nrtsCOYdOe0kSCHkljo-osj9M5PA2vV8bK8VusW1mjvCacioa_vseYNetyfjkO0s71q1RF6VPzaLpurtw6HfwCbgZe5
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=An+effective+placement+method+for+the+single+container+loading+problem&rft.jtitle=Computers+%26+industrial+engineering&rft.au=Huang%2C+Yao-Huei&rft.au=Hwang%2C+F+J&rft.au=Lu%2C+Hao-Chun&rft.date=2016-07-01&rft.issn=0360-8352&rft.volume=97&rft.spage=212&rft.epage=221&rft_id=info:doi/10.1016%2Fj.cie.2016.05.008&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0360-8352&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0360-8352&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0360-8352&client=summon