An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry

Gespeichert in:

Autor*in:	Yao, Shaowen [verfasserIn] Tang, Chao [verfasserIn] Zhang, Hao [verfasserIn] Wu, Songhuan [verfasserIn] Wei, Lijun [verfasserIn] Liu, Qiang - 1978- [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2024

Schlagwörter:	Irregular packing Multiple-size irregular bin Packing

Übergeordnetes Werk:	Enthalten in: Computers & operations research - Amsterdam [u.a.] : Elsevier, 1974, 162(2024) vom: Feb., Artikel-ID 106476, Seite 1-14
Übergeordnetes Werk:	volume:162 ; year:2024 ; month:02 ; elocationid:106476 ; pages:1-14

Links:	Link aufrufen Link aufrufen

DOI / URN:	10.1016/j.cor.2023.106476

Katalog-ID:	1892449986

Internformat


LEADER	01000caa a2200265 4500
001	1892449986
003	DE-627
005	20240909125256.0
007	cr uuu---uuuuu
008	240628s2024 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1016/j.cor.2023.106476 \|2 doi
035			\|a (DE-627)1892449986
035			\|a (DE-599)KXP1892449986
040			\|a DE-627 \|b ger \|c DE-627 \|e rda
041			\|a eng
100	1		\|a Yao, Shaowen \|e verfasserin \|0 (DE-588)1299893783 \|0 (DE-627)1857652703 \|4 aut
245	1	3	\|a An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry \|c Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu
264		1	\|c 2024
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
650		4	\|a Irregular packing \|7 (dpeaa)DE-206
650		4	\|a Multiple-size irregular bin \|7 (dpeaa)DE-206
650		4	\|a Packing \|7 (dpeaa)DE-206
700	1		\|a Tang, Chao \|e verfasserin \|0 (DE-588)1341418472 \|0 (DE-627)190216704X \|4 aut
700	1		\|a Zhang, Hao \|e verfasserin \|0 (DE-588)1207553441 \|0 (DE-627)1694001288 \|4 aut
700	1		\|a Wu, Songhuan \|e verfasserin \|0 (DE-588)1341418936 \|0 (DE-627)1902167600 \|4 aut
700	1		\|a Wei, Lijun \|e verfasserin \|0 (DE-588)138029490 \|0 (DE-627)598681248 \|0 (DE-576)306140233 \|4 aut
700	1		\|a Liu, Qiang \|d 1978- \|e verfasserin \|0 (DE-588)1173002324 \|0 (DE-627)1042092249 \|0 (DE-576)514934549 \|4 aut
773	0	8	\|i Enthalten in \|t Computers & operations research \|d Amsterdam [u.a.] : Elsevier, 1974 \|g 162(2024) vom: Feb., Artikel-ID 106476, Seite 1-14 \|h Online-Ressource \|w (DE-627)306652668 \|w (DE-600)1499736-8 \|w (DE-576)081954336 \|x 0305-0548 \|7 nnns
773	1	8	\|g volume:162 \|g year:2024 \|g month:02 \|g elocationid:106476 \|g pages:1-14
856	4	0	\|u https://www.sciencedirect.com/science/article/pii/S0305054823003404/pdf \|x Verlag \|z lizenzpflichtig
856	4	0	\|u https://doi.org/10.1016/j.cor.2023.106476 \|x Resolving-System \|z lizenzpflichtig
912			\|a GBV_USEFLAG_U
912			\|a GBV_ILN_26
912			\|a ISIL_DE-206
912			\|a SYSFLAG_1
912			\|a GBV_KXP
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_32
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_74
912			\|a GBV_ILN_90
912			\|a GBV_ILN_95
912			\|a GBV_ILN_100
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_150
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_187
912			\|a GBV_ILN_213
912			\|a GBV_ILN_224
912			\|a GBV_ILN_230
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_702
912			\|a GBV_ILN_2001
912			\|a GBV_ILN_2003
912			\|a GBV_ILN_2004
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2007
912			\|a GBV_ILN_2008
912			\|a GBV_ILN_2009
912			\|a GBV_ILN_2010
912			\|a GBV_ILN_2011
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2015
912			\|a GBV_ILN_2020
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2025
912			\|a GBV_ILN_2026
912			\|a GBV_ILN_2027
912			\|a GBV_ILN_2034
912			\|a GBV_ILN_2038
912			\|a GBV_ILN_2044
912			\|a GBV_ILN_2048
912			\|a GBV_ILN_2049
912			\|a GBV_ILN_2050
912			\|a GBV_ILN_2055
912			\|a GBV_ILN_2056
912			\|a GBV_ILN_2059
912			\|a GBV_ILN_2061
912			\|a GBV_ILN_2064
912			\|a GBV_ILN_2068
912			\|a GBV_ILN_2088
912			\|a GBV_ILN_2106
912			\|a GBV_ILN_2110
912			\|a GBV_ILN_2111
912			\|a GBV_ILN_2112
912			\|a GBV_ILN_2122
912			\|a GBV_ILN_2129
912			\|a GBV_ILN_2143
912			\|a GBV_ILN_2152
912			\|a GBV_ILN_2153
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_2232
912			\|a GBV_ILN_2336
912			\|a GBV_ILN_2470
912			\|a GBV_ILN_2507
912			\|a GBV_ILN_2522
912			\|a GBV_ILN_4035
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4242
912			\|a GBV_ILN_4246
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4251
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4328
912			\|a GBV_ILN_4333
912			\|a GBV_ILN_4334
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4393
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 162 \|j 2024 \|c 2 \|i 106476 \|h 1-14
980			\|2 26 \|1 01 \|x 0206 \|b 4543137019 \|y x1z \|z 28-06-24
982			\|2 26 \|1 00 \|x DE-206 \|b This paper examines the two-dimensional irregular multiple-size bin packing problem, where the goal is to pack all the given irregular pieces into bins of various sizes such that the total area of the used bins is minimized. Meanwhile, the irregular pieces include holes, and the bins can be irregular, also. This problem is raised in the steel industry considering the reuse of leftover material. An iteratively doubling binary search is proposed to solve this problem. Moreover, a binary search strategy is introduced to search the bin combination with minimum area, and an iteratively doubling strategy is utilized to control the search effort on each bin combination. Once the bins are identified, a first-fit bottom-left method is utilized to generate the initial position for each piece. An overlap minimization approach, which includes a local search by exchanging the positions of two pieces, is adapted to minimize the overlap in the initial solution. Experiment results on existing instances show that our approach could find a better solution than existing methods. Several instances representing different application scenarios are generated, and the results show our approach's effectiveness and generality.

Indexfelder

author_variant	s y sy c t ct h z hz s w sw l w lw q l ql
matchkey_str	article:03050548:2024----::ntrtvldulnbnrsacfrhtoiesoairglrutpeieipcig
hierarchy_sort_str	2024
publishDate	2024
allfields	10.1016/j.cor.2023.106476 doi (DE-627)1892449986 (DE-599)KXP1892449986 DE-627 ger DE-627 rda eng Yao, Shaowen verfasserin (DE-588)1299893783 (DE-627)1857652703 aut An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Irregular packing (dpeaa)DE-206 Multiple-size irregular bin (dpeaa)DE-206 Packing (dpeaa)DE-206 Tang, Chao verfasserin (DE-588)1341418472 (DE-627)190216704X aut Zhang, Hao verfasserin (DE-588)1207553441 (DE-627)1694001288 aut Wu, Songhuan verfasserin (DE-588)1341418936 (DE-627)1902167600 aut Wei, Lijun verfasserin (DE-588)138029490 (DE-627)598681248 (DE-576)306140233 aut Liu, Qiang 1978- verfasserin (DE-588)1173002324 (DE-627)1042092249 (DE-576)514934549 aut Enthalten in Computers & operations research Amsterdam [u.a.] : Elsevier, 1974 162(2024) vom: Feb., Artikel-ID 106476, Seite 1-14 Online-Ressource (DE-627)306652668 (DE-600)1499736-8 (DE-576)081954336 0305-0548 nnns volume:162 year:2024 month:02 elocationid:106476 pages:1-14 https://www.sciencedirect.com/science/article/pii/S0305054823003404/pdf Verlag lizenzpflichtig https://doi.org/10.1016/j.cor.2023.106476 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_161 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 162 2024 2 106476 1-14 26 01 0206 4543137019 x1z 28-06-24 26 00 DE-206 This paper examines the two-dimensional irregular multiple-size bin packing problem, where the goal is to pack all the given irregular pieces into bins of various sizes such that the total area of the used bins is minimized. Meanwhile, the irregular pieces include holes, and the bins can be irregular, also. This problem is raised in the steel industry considering the reuse of leftover material. An iteratively doubling binary search is proposed to solve this problem. Moreover, a binary search strategy is introduced to search the bin combination with minimum area, and an iteratively doubling strategy is utilized to control the search effort on each bin combination. Once the bins are identified, a first-fit bottom-left method is utilized to generate the initial position for each piece. An overlap minimization approach, which includes a local search by exchanging the positions of two pieces, is adapted to minimize the overlap in the initial solution. Experiment results on existing instances show that our approach could find a better solution than existing methods. Several instances representing different application scenarios are generated, and the results show our approach's effectiveness and generality.
spelling	10.1016/j.cor.2023.106476 doi (DE-627)1892449986 (DE-599)KXP1892449986 DE-627 ger DE-627 rda eng Yao, Shaowen verfasserin (DE-588)1299893783 (DE-627)1857652703 aut An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Irregular packing (dpeaa)DE-206 Multiple-size irregular bin (dpeaa)DE-206 Packing (dpeaa)DE-206 Tang, Chao verfasserin (DE-588)1341418472 (DE-627)190216704X aut Zhang, Hao verfasserin (DE-588)1207553441 (DE-627)1694001288 aut Wu, Songhuan verfasserin (DE-588)1341418936 (DE-627)1902167600 aut Wei, Lijun verfasserin (DE-588)138029490 (DE-627)598681248 (DE-576)306140233 aut Liu, Qiang 1978- verfasserin (DE-588)1173002324 (DE-627)1042092249 (DE-576)514934549 aut Enthalten in Computers & operations research Amsterdam [u.a.] : Elsevier, 1974 162(2024) vom: Feb., Artikel-ID 106476, Seite 1-14 Online-Ressource (DE-627)306652668 (DE-600)1499736-8 (DE-576)081954336 0305-0548 nnns volume:162 year:2024 month:02 elocationid:106476 pages:1-14 https://www.sciencedirect.com/science/article/pii/S0305054823003404/pdf Verlag lizenzpflichtig https://doi.org/10.1016/j.cor.2023.106476 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_161 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 162 2024 2 106476 1-14 26 01 0206 4543137019 x1z 28-06-24 26 00 DE-206 This paper examines the two-dimensional irregular multiple-size bin packing problem, where the goal is to pack all the given irregular pieces into bins of various sizes such that the total area of the used bins is minimized. Meanwhile, the irregular pieces include holes, and the bins can be irregular, also. This problem is raised in the steel industry considering the reuse of leftover material. An iteratively doubling binary search is proposed to solve this problem. Moreover, a binary search strategy is introduced to search the bin combination with minimum area, and an iteratively doubling strategy is utilized to control the search effort on each bin combination. Once the bins are identified, a first-fit bottom-left method is utilized to generate the initial position for each piece. An overlap minimization approach, which includes a local search by exchanging the positions of two pieces, is adapted to minimize the overlap in the initial solution. Experiment results on existing instances show that our approach could find a better solution than existing methods. Several instances representing different application scenarios are generated, and the results show our approach's effectiveness and generality.
allfields_unstemmed	10.1016/j.cor.2023.106476 doi (DE-627)1892449986 (DE-599)KXP1892449986 DE-627 ger DE-627 rda eng Yao, Shaowen verfasserin (DE-588)1299893783 (DE-627)1857652703 aut An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Irregular packing (dpeaa)DE-206 Multiple-size irregular bin (dpeaa)DE-206 Packing (dpeaa)DE-206 Tang, Chao verfasserin (DE-588)1341418472 (DE-627)190216704X aut Zhang, Hao verfasserin (DE-588)1207553441 (DE-627)1694001288 aut Wu, Songhuan verfasserin (DE-588)1341418936 (DE-627)1902167600 aut Wei, Lijun verfasserin (DE-588)138029490 (DE-627)598681248 (DE-576)306140233 aut Liu, Qiang 1978- verfasserin (DE-588)1173002324 (DE-627)1042092249 (DE-576)514934549 aut Enthalten in Computers & operations research Amsterdam [u.a.] : Elsevier, 1974 162(2024) vom: Feb., Artikel-ID 106476, Seite 1-14 Online-Ressource (DE-627)306652668 (DE-600)1499736-8 (DE-576)081954336 0305-0548 nnns volume:162 year:2024 month:02 elocationid:106476 pages:1-14 https://www.sciencedirect.com/science/article/pii/S0305054823003404/pdf Verlag lizenzpflichtig https://doi.org/10.1016/j.cor.2023.106476 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_161 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 162 2024 2 106476 1-14 26 01 0206 4543137019 x1z 28-06-24 26 00 DE-206 This paper examines the two-dimensional irregular multiple-size bin packing problem, where the goal is to pack all the given irregular pieces into bins of various sizes such that the total area of the used bins is minimized. Meanwhile, the irregular pieces include holes, and the bins can be irregular, also. This problem is raised in the steel industry considering the reuse of leftover material. An iteratively doubling binary search is proposed to solve this problem. Moreover, a binary search strategy is introduced to search the bin combination with minimum area, and an iteratively doubling strategy is utilized to control the search effort on each bin combination. Once the bins are identified, a first-fit bottom-left method is utilized to generate the initial position for each piece. An overlap minimization approach, which includes a local search by exchanging the positions of two pieces, is adapted to minimize the overlap in the initial solution. Experiment results on existing instances show that our approach could find a better solution than existing methods. Several instances representing different application scenarios are generated, and the results show our approach's effectiveness and generality.
allfieldsGer	10.1016/j.cor.2023.106476 doi (DE-627)1892449986 (DE-599)KXP1892449986 DE-627 ger DE-627 rda eng Yao, Shaowen verfasserin (DE-588)1299893783 (DE-627)1857652703 aut An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Irregular packing (dpeaa)DE-206 Multiple-size irregular bin (dpeaa)DE-206 Packing (dpeaa)DE-206 Tang, Chao verfasserin (DE-588)1341418472 (DE-627)190216704X aut Zhang, Hao verfasserin (DE-588)1207553441 (DE-627)1694001288 aut Wu, Songhuan verfasserin (DE-588)1341418936 (DE-627)1902167600 aut Wei, Lijun verfasserin (DE-588)138029490 (DE-627)598681248 (DE-576)306140233 aut Liu, Qiang 1978- verfasserin (DE-588)1173002324 (DE-627)1042092249 (DE-576)514934549 aut Enthalten in Computers & operations research Amsterdam [u.a.] : Elsevier, 1974 162(2024) vom: Feb., Artikel-ID 106476, Seite 1-14 Online-Ressource (DE-627)306652668 (DE-600)1499736-8 (DE-576)081954336 0305-0548 nnns volume:162 year:2024 month:02 elocationid:106476 pages:1-14 https://www.sciencedirect.com/science/article/pii/S0305054823003404/pdf Verlag lizenzpflichtig https://doi.org/10.1016/j.cor.2023.106476 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_161 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 162 2024 2 106476 1-14 26 01 0206 4543137019 x1z 28-06-24 26 00 DE-206 This paper examines the two-dimensional irregular multiple-size bin packing problem, where the goal is to pack all the given irregular pieces into bins of various sizes such that the total area of the used bins is minimized. Meanwhile, the irregular pieces include holes, and the bins can be irregular, also. This problem is raised in the steel industry considering the reuse of leftover material. An iteratively doubling binary search is proposed to solve this problem. Moreover, a binary search strategy is introduced to search the bin combination with minimum area, and an iteratively doubling strategy is utilized to control the search effort on each bin combination. Once the bins are identified, a first-fit bottom-left method is utilized to generate the initial position for each piece. An overlap minimization approach, which includes a local search by exchanging the positions of two pieces, is adapted to minimize the overlap in the initial solution. Experiment results on existing instances show that our approach could find a better solution than existing methods. Several instances representing different application scenarios are generated, and the results show our approach's effectiveness and generality.
allfieldsSound	10.1016/j.cor.2023.106476 doi (DE-627)1892449986 (DE-599)KXP1892449986 DE-627 ger DE-627 rda eng Yao, Shaowen verfasserin (DE-588)1299893783 (DE-627)1857652703 aut An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Irregular packing (dpeaa)DE-206 Multiple-size irregular bin (dpeaa)DE-206 Packing (dpeaa)DE-206 Tang, Chao verfasserin (DE-588)1341418472 (DE-627)190216704X aut Zhang, Hao verfasserin (DE-588)1207553441 (DE-627)1694001288 aut Wu, Songhuan verfasserin (DE-588)1341418936 (DE-627)1902167600 aut Wei, Lijun verfasserin (DE-588)138029490 (DE-627)598681248 (DE-576)306140233 aut Liu, Qiang 1978- verfasserin (DE-588)1173002324 (DE-627)1042092249 (DE-576)514934549 aut Enthalten in Computers & operations research Amsterdam [u.a.] : Elsevier, 1974 162(2024) vom: Feb., Artikel-ID 106476, Seite 1-14 Online-Ressource (DE-627)306652668 (DE-600)1499736-8 (DE-576)081954336 0305-0548 nnns volume:162 year:2024 month:02 elocationid:106476 pages:1-14 https://www.sciencedirect.com/science/article/pii/S0305054823003404/pdf Verlag lizenzpflichtig https://doi.org/10.1016/j.cor.2023.106476 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_161 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 162 2024 2 106476 1-14 26 01 0206 4543137019 x1z 28-06-24 26 00 DE-206 This paper examines the two-dimensional irregular multiple-size bin packing problem, where the goal is to pack all the given irregular pieces into bins of various sizes such that the total area of the used bins is minimized. Meanwhile, the irregular pieces include holes, and the bins can be irregular, also. This problem is raised in the steel industry considering the reuse of leftover material. An iteratively doubling binary search is proposed to solve this problem. Moreover, a binary search strategy is introduced to search the bin combination with minimum area, and an iteratively doubling strategy is utilized to control the search effort on each bin combination. Once the bins are identified, a first-fit bottom-left method is utilized to generate the initial position for each piece. An overlap minimization approach, which includes a local search by exchanging the positions of two pieces, is adapted to minimize the overlap in the initial solution. Experiment results on existing instances show that our approach could find a better solution than existing methods. Several instances representing different application scenarios are generated, and the results show our approach's effectiveness and generality.
language	English
source	Enthalten in Computers & operations research 162(2024) vom: Feb., Artikel-ID 106476, Seite 1-14 volume:162 year:2024 month:02 elocationid:106476 pages:1-14
sourceStr	Enthalten in Computers & operations research 162(2024) vom: Feb., Artikel-ID 106476, Seite 1-14 volume:162 year:2024 month:02 elocationid:106476 pages:1-14
format_phy_str_mv	Article
building	26:1
institution	findex.gbv.de
selectbib_iln_str_mv	26@1z
topic_facet	Irregular packing Multiple-size irregular bin Packing
sw_local_iln_str_mv	26: DE-206:
isfreeaccess_bool	false
container_title	Computers & operations research
authorswithroles_txt_mv	Yao, Shaowen @@aut@@ Tang, Chao @@aut@@ Zhang, Hao @@aut@@ Wu, Songhuan @@aut@@ Wei, Lijun @@aut@@ Liu, Qiang @@aut@@
publishDateDaySort_date	2024-02-01T00:00:00Z
hierarchy_top_id	306652668
id	1892449986
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">1892449986</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240909125256.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240628s2024 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.cor.2023.106476</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)1892449986</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1892449986</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yao, Shaowen</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1299893783</subfield><subfield code="0">(DE-627)1857652703</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="3"><subfield code="a">An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry</subfield><subfield code="c">Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2024</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Irregular packing</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiple-size irregular bin</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Packing</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tang, Chao</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1341418472</subfield><subfield code="0">(DE-627)190216704X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Hao</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1207553441</subfield><subfield code="0">(DE-627)1694001288</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wu, Songhuan</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1341418936</subfield><subfield code="0">(DE-627)1902167600</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wei, Lijun</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)138029490</subfield><subfield code="0">(DE-627)598681248</subfield><subfield code="0">(DE-576)306140233</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Qiang</subfield><subfield code="d">1978-</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1173002324</subfield><subfield code="0">(DE-627)1042092249</subfield><subfield code="0">(DE-576)514934549</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Computers & operations research</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1974</subfield><subfield code="g">162(2024) vom: Feb., Artikel-ID 106476, Seite 1-14</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)306652668</subfield><subfield code="w">(DE-600)1499736-8</subfield><subfield code="w">(DE-576)081954336</subfield><subfield code="x">0305-0548</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:162</subfield><subfield code="g">year:2024</subfield><subfield code="g">month:02</subfield><subfield code="g">elocationid:106476</subfield><subfield code="g">pages:1-14</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.sciencedirect.com/science/article/pii/S0305054823003404/pdf</subfield><subfield code="x">Verlag</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.cor.2023.106476</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4328</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">162</subfield><subfield code="j">2024</subfield><subfield code="c">2</subfield><subfield code="i">106476</subfield><subfield code="h">1-14</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">01</subfield><subfield code="x">0206</subfield><subfield code="b">4543137019</subfield><subfield code="y">x1z</subfield><subfield code="z">28-06-24</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="b">This paper examines the two-dimensional irregular multiple-size bin packing problem, where the goal is to pack all the given irregular pieces into bins of various sizes such that the total area of the used bins is minimized. Meanwhile, the irregular pieces include holes, and the bins can be irregular, also. This problem is raised in the steel industry considering the reuse of leftover material. An iteratively doubling binary search is proposed to solve this problem. Moreover, a binary search strategy is introduced to search the bin combination with minimum area, and an iteratively doubling strategy is utilized to control the search effort on each bin combination. Once the bins are identified, a first-fit bottom-left method is utilized to generate the initial position for each piece. An overlap minimization approach, which includes a local search by exchanging the positions of two pieces, is adapted to minimize the overlap in the initial solution. Experiment results on existing instances show that our approach could find a better solution than existing methods. Several instances representing different application scenarios are generated, and the results show our approach's effectiveness and generality.</subfield></datafield></record></collection>
author	Yao, Shaowen
spellingShingle	Yao, Shaowen misc Irregular packing misc Multiple-size irregular bin misc Packing An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
authorStr	Yao, Shaowen
ppnlink_with_tag_str_mv	@@773@@(DE-627)306652668
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut aut aut aut
collection	KXP GVK SWB
remote_str	true
last_changed_iln_str_mv	26@28-06-24
illustrated	Not Illustrated
issn	0305-0548
topic_title	26 00 DE-206 This paper examines the two-dimensional irregular multiple-size bin packing problem, where the goal is to pack all the given irregular pieces into bins of various sizes such that the total area of the used bins is minimized. Meanwhile, the irregular pieces include holes, and the bins can be irregular, also. This problem is raised in the steel industry considering the reuse of leftover material. An iteratively doubling binary search is proposed to solve this problem. Moreover, a binary search strategy is introduced to search the bin combination with minimum area, and an iteratively doubling strategy is utilized to control the search effort on each bin combination. Once the bins are identified, a first-fit bottom-left method is utilized to generate the initial position for each piece. An overlap minimization approach, which includes a local search by exchanging the positions of two pieces, is adapted to minimize the overlap in the initial solution. Experiment results on existing instances show that our approach could find a better solution than existing methods. Several instances representing different application scenarios are generated, and the results show our approach's effectiveness and generality An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu Irregular packing (dpeaa)DE-206 Multiple-size irregular bin (dpeaa)DE-206 Packing (dpeaa)DE-206
topic	misc Irregular packing misc Multiple-size irregular bin misc Packing
topic_unstemmed	misc Irregular packing misc Multiple-size irregular bin misc Packing
topic_browse	misc Irregular packing misc Multiple-size irregular bin misc Packing
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Computers & operations research
hierarchy_parent_id	306652668
hierarchy_top_title	Computers & operations research
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)306652668 (DE-600)1499736-8 (DE-576)081954336
normlinkwithrole_str_mv	(DE-588)1299893783@@aut@@ (DE-588)1341418472@@aut@@ (DE-588)1207553441@@aut@@ (DE-588)1341418936@@aut@@ (DE-588)138029490@@aut@@ (DE-588)1173002324@@aut@@
title	An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
ctrlnum	(DE-627)1892449986 (DE-599)KXP1892449986
title_full	An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu
author_sort	Yao, Shaowen
journal	Computers & operations research
journalStr	Computers & operations research
lang_code	eng
isOA_bool	false
recordtype	marc
publishDateSort	2024
contenttype_str_mv	txt
container_start_page	1
author_browse	Yao, Shaowen Tang, Chao Zhang, Hao Wu, Songhuan Wei, Lijun Liu, Qiang
selectkey	26:x
container_volume	162
format_se	Elektronische Aufsätze
author-letter	Yao, Shaowen
doi_str_mv	10.1016/j.cor.2023.106476
normlink	1299893783 1857652703 1341418472 190216704X 1207553441 1694001288 1341418936 1902167600 138029490 598681248 306140233 1173002324 1042092249 514934549
normlink_prefix_str_mv	(DE-588)1299893783 (DE-627)1857652703 (DE-588)1341418472 (DE-627)190216704X (DE-588)1207553441 (DE-627)1694001288 (DE-588)1341418936 (DE-627)1902167600 (DE-588)138029490 (DE-627)598681248 (DE-576)306140233 (DE-588)1173002324 (DE-627)1042092249 (DE-576)514934549
author2-role	verfasserin
title_sort	iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
title_auth	An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
collection_details	GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_161 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700
title_short	An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
url	https://www.sciencedirect.com/science/article/pii/S0305054823003404/pdf https://doi.org/10.1016/j.cor.2023.106476
ausleihindikator_str_mv	26
rolewithnormlink_str_mv	@@aut@@(DE-588)1299893783 @@aut@@(DE-588)1341418472 @@aut@@(DE-588)1207553441 @@aut@@(DE-588)1341418936 @@aut@@(DE-588)138029490 @@aut@@(DE-588)1173002324
remote_bool	true
author2	Tang, Chao Zhang, Hao Wu, Songhuan Wei, Lijun Liu, Qiang 1978-
author2Str	Tang, Chao Zhang, Hao Wu, Songhuan Wei, Lijun Liu, Qiang 1978-
ppnlink	306652668
mediatype_str_mv	c
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1016/j.cor.2023.106476
up_date	2024-09-10T04:21:08.468Z
_version_	1809781430400581632
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">1892449986</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240909125256.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240628s2024 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.cor.2023.106476</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)1892449986</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1892449986</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yao, Shaowen</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1299893783</subfield><subfield code="0">(DE-627)1857652703</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="3"><subfield code="a">An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry</subfield><subfield code="c">Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2024</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Irregular packing</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiple-size irregular bin</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Packing</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tang, Chao</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1341418472</subfield><subfield code="0">(DE-627)190216704X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Hao</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1207553441</subfield><subfield code="0">(DE-627)1694001288</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wu, Songhuan</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1341418936</subfield><subfield code="0">(DE-627)1902167600</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wei, Lijun</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)138029490</subfield><subfield code="0">(DE-627)598681248</subfield><subfield code="0">(DE-576)306140233</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Qiang</subfield><subfield code="d">1978-</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1173002324</subfield><subfield code="0">(DE-627)1042092249</subfield><subfield code="0">(DE-576)514934549</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Computers & operations research</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1974</subfield><subfield code="g">162(2024) vom: Feb., Artikel-ID 106476, Seite 1-14</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)306652668</subfield><subfield code="w">(DE-600)1499736-8</subfield><subfield code="w">(DE-576)081954336</subfield><subfield code="x">0305-0548</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:162</subfield><subfield code="g">year:2024</subfield><subfield code="g">month:02</subfield><subfield code="g">elocationid:106476</subfield><subfield code="g">pages:1-14</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.sciencedirect.com/science/article/pii/S0305054823003404/pdf</subfield><subfield code="x">Verlag</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.cor.2023.106476</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4328</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">162</subfield><subfield code="j">2024</subfield><subfield code="c">2</subfield><subfield code="i">106476</subfield><subfield code="h">1-14</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">01</subfield><subfield code="x">0206</subfield><subfield code="b">4543137019</subfield><subfield code="y">x1z</subfield><subfield code="z">28-06-24</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="b">This paper examines the two-dimensional irregular multiple-size bin packing problem, where the goal is to pack all the given irregular pieces into bins of various sizes such that the total area of the used bins is minimized. Meanwhile, the irregular pieces include holes, and the bins can be irregular, also. This problem is raised in the steel industry considering the reuse of leftover material. An iteratively doubling binary search is proposed to solve this problem. Moreover, a binary search strategy is introduced to search the bin combination with minimum area, and an iteratively doubling strategy is utilized to control the search effort on each bin combination. Once the bins are identified, a first-fit bottom-left method is utilized to generate the initial position for each piece. An overlap minimization approach, which includes a local search by exchanging the positions of two pieces, is adapted to minimize the overlap in the initial solution. Experiment results on existing instances show that our approach could find a better solution than existing methods. Several instances representing different application scenarios are generated, and the results show our approach's effectiveness and generality.</subfield></datafield></record></collection>
score	7.169448

Nicht das Richtige dabei?

Schreiben Sie uns!

An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?