內容大鋼
In this book, we introduce the Generalized Container Loading Problem (GCLP) to model a more practical container loading issue. In this problem, we are given a set of three-dimensional containers and several sets of three-dimensional items. Each set of items can be further divided into two groups: mandatory items and optional items. Each container has a cost and each item has a value. We need to select one set of items and load all of its mandatory items, together with some or all of its optional items, into the container(s), such that the unit shipping cost is minimized. The unit shipping cost is defined as the quotient of the total cost of selected containers and the total value of loaded items. This problem successfully describes the multi-layer decision-making process and the trade-off between cost and value, which are common issues in logistics management.
目錄
1 Introduction
1.1 Introduction
1.2 Contributions
1.3 Book Organization
2 Literature Review
2.1 Cutting and Packing Problems
2.2 Typical Container Loading Problems
2.3 Modeling Techniques
2.4 Exact and Approximation Algorithms
2.5 Heuristic Methods
3 Generalized Container Loading Problem
3.1 Introduction
3.2 Problem Definition and Formulation
3.3 Special Cases of the Generalized Container Loading Problems in Literature
3.4 Conclusion
4 The Multiple Container Loading Problem with Preference
4.1 Introduction
4.2 Problem Definition
4.3 The MCLPP is a Generalized Container Loading Problem
4.4 A Combinatorial Formulation
4.5 A Two-Phase Heuristic
4.6 Computational Experiments
4.7 Conclusion
5 The Single Container Mix-Loading Problem
5.1 Introduction
5.2 Problem Definition
5.3 The SCMLP is a Generalized Container Loading Problem
5.4 A Two.Phase Constructive Method
5.5 Computational Experiments
5.6 Conclusion
6 Conclusion
Bibliography
lndex
[