國立虎尾科技大學 |

Algorithms for Container Loading Problems.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Algorithms for Container Loading Problems./
作者:	Zhu, Wenbin.
面頁冊數:	1 online resource (192 pages)
附註:	Source: Dissertations Abstracts International, Volume: 75-02, Section: B.
Contained By:	Dissertations Abstracts International75-02B.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9781303188527

Algorithms for Container Loading Problems.
Zhu, Wenbin.

Algorithms for Container Loading Problems. - 1 online resource (192 pages)

Source: Dissertations Abstracts International, Volume: 75-02, Section: B.

Thesis (Ph.D.)--Hong Kong University of Science and Technology (Hong Kong), 2012.

Includes bibliographical references

The problems examined originate from industrial projects. In one project, our team was contracted by a buying agent for a large multi-national retailer to investigate better ways to formulate packing plans for the loading of goods into multiple containers. Typically, the goods come in the form of 3D rectangular carton boxes, which are to be loaded into 3D rectangular containers of various standard sizes. Each type of container has a different associated cost of shipping. The task is to select a set of containers that can contain all items while minimizing this shipping cost. We call this problem the Multiple Container Loading Cost Minimization Problem (MCLCMP). If a set of boxes can be loaded into a container, we call the set of boxes and the associated container a loading pattern. MCLCMP can be naturally formulated as a set cover problem, where the set to be covered is the set of all boxes and a loading pattern "covers" a subset of boxes. We would like to select loading patterns from a set of candidates to cover all boxes while minimizing the total cost of the associated containers. Our approaches to the MCLCMP are essentially two-level approaches. The burden of finding feasible loading patterns is left to the algorithms for the Single Container Loading Problem (SCLP). We first develop efficient algorithms for the SCLP, and then proceed to devise three set cover based algorithms for the MCLCMP in increasing order of sophistication and effectiveness. The special case of the MCLCMP where all containers are identical is the well-known 3D bin packing problem (3D-BPP); we propose a new algorithm that exploits specific features of the 3D-BPP. Computational experiments on benchmark data suggest that our new algorithms for the SCLP, MCLCMP and 3D-BPP outperform all prior approaches.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9781303188527Subjects--Topical Terms:

573171
Computer science.
Subjects--Index Terms:

Bin packingIndex Terms--Genre/Form:

554714
Electronic books.

Algorithms for Container Loading Problems.
LDR:03190ntm a22003857 4500 001 1150373
005 20241028114800.5
006 m o d
007 cr bn ---uuuuu
008 250605s2012 xx obm 000 0 eng d
020 $a 9781303188527
035 $a (MiAaPQ)AAI3567210
035 $a (MiAaPQ)hkust:b1198807
035 $a AAI3567210
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Zhu, Wenbin. $3 1476846
245 1 0 $a Algorithms for Container Loading Problems.
264 0 $c 2012
300 $a 1 online resource (192 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 75-02, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Cheng, Siu-Wing.
502 $a Thesis (Ph.D.)--Hong Kong University of Science and Technology (Hong Kong), 2012.
504 $a Includes bibliographical references
520 $a The problems examined originate from industrial projects. In one project, our team was contracted by a buying agent for a large multi-national retailer to investigate better ways to formulate packing plans for the loading of goods into multiple containers. Typically, the goods come in the form of 3D rectangular carton boxes, which are to be loaded into 3D rectangular containers of various standard sizes. Each type of container has a different associated cost of shipping. The task is to select a set of containers that can contain all items while minimizing this shipping cost. We call this problem the Multiple Container Loading Cost Minimization Problem (MCLCMP). If a set of boxes can be loaded into a container, we call the set of boxes and the associated container a loading pattern. MCLCMP can be naturally formulated as a set cover problem, where the set to be covered is the set of all boxes and a loading pattern "covers" a subset of boxes. We would like to select loading patterns from a set of candidates to cover all boxes while minimizing the total cost of the associated containers. Our approaches to the MCLCMP are essentially two-level approaches. The burden of finding feasible loading patterns is left to the algorithms for the Single Container Loading Problem (SCLP). We first develop efficient algorithms for the SCLP, and then proceed to devise three set cover based algorithms for the MCLCMP in increasing order of sophistication and effectiveness. The special case of the MCLCMP where all containers are identical is the well-known 3D bin packing problem (3D-BPP); we propose a new algorithm that exploits specific features of the 3D-BPP. Computational experiments on benchmark data suggest that our new algorithms for the SCLP, MCLCMP and 3D-BPP outperform all prior approaches.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
653 $a Bin packing
653 $a Carton boxes
653 $a Container loading
653 $a Loading patterns
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Hong Kong University of Science and Technology (Hong Kong). $b HKUST. $3 845420
773 0 $t Dissertations Abstracts International $g 75-02B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3567210 $z click for full text (PQDT)