Applying Heuristic Algorithm on Ship Route and Container Allocation for Transoceanic Liner

• Main Authors: Pan, Yu-Chun, 潘育君
• Other Authors: Liao, Tsai-Yun
• Format: Others
• Language: zh-TW
• Published: 2009
• Online Access: http://ndltd.ncl.edu.tw/handle/01321883773805804828

碩士 === 國立嘉義大學 === 運輸與物流工程研究所 === 97 === Containership shipping route problem determines the optimal shipping sequences among visiting ports for maximizing profit or minimizing cost. Container allocation problem deals with imbalanced cargo trade between two visiting ports. In this study, a mixed integer programming model is proposed to solve the optimal containership shipping route problem with container allocation for multiple voyages. The model considers demand fluctuation caused by stochastic delivery demand and different demand ratio of 20ft and 40ft containers from origin to destination. In terms of multi-voyage design, this problem becomes more complex and a Genetic Algorithm (GA) is designed to solve the problem more efficiently. An optimization software Lingo9.0 and programming language C++ are integrated to implement the algorithm and obtain the optimal voyage sequences with the objective of profit maximization. In the sensitive analysis, changes of fuel price and different ratio ranges of 20ft and 40ft containers are tested to capture their effects on containership shipping route and container allocation.