グリーンロジスティクスのためのコンテナ積載と配車配送経路の最適化に関する研究

京都大学0048新制・課程博士博士(工学)甲第16840号工博第3561号新制||工||1538(附属図書館)29515京都大学大学院工学研究科機械理工学専攻(主査)教授 椹木 哲夫, 教授 西脇 眞二, 教授 松原 厚学位規則第4条第1項該当Doctor of Philosophy (Engineering)Kyoto UniversityDFA

Container Loading Problems: A State-of-the-Art Review

Container loading is a pivotal function for operating supply chains efficiently. Underperformance results in unnecessary costs (e.g. cost of additional containers to be shipped) and in an unsatisfactory customer service (e.g. violation of deadlines agreed to or set by clients). Thus, it is not surprising that container loading problems have been dealt with frequently in the operations research literature. It has been claimed though that the proposed approaches are of limited practical value since they do not pay enough attention to constraints encountered in practice.In this paper, a review of the state-of-the-art in the field of container loading will be given. We will identify factors which - from a practical point of view - need to be considered when dealing with container loading problems and we will analyze whether and how these factors are represented in methods for the solution of such problems. Modeling approaches, as well as exact and heuristic algorithms will be reviewed. This will allow for assessing the practical relevance of the research which has been carried out in the field. We will also mention several issues which have not been dealt with satisfactorily so far and give an outlook on future research opportunities

Extreme-Point-based Heuristics for the Three-Dimensional Bin Packing problem

One of the main issues in addressing three-dimensional packing problems is finding an efficient and accurate definition of the points at which to place the items inside the bins, because the performance of exact and heuristic solution methods is actually strongly influenced by the choice of a placement rule. We introduce the extreme point concept and present a new extreme point-based rule for packing items inside a three-dimensional container. The extreme point rule is independent from the particular packing problem addressed and can handle additional constraints, such as fixing the position of the items. The new extreme point rule is also used to derive new constructive heuristics for the three-dimensional bin-packing problem. Extensive computational results show the effectiveness of the new heuristics compared to state-of-the-art results. Moreover, the same heuristics, when applied to the two-dimensional bin-packing problem, outperform those specifically designed for the proble