Applying Heuristic Algorithm on Ship Route and Container Allocation for Transoceanic Liner
碩士 === 國立嘉義大學 === 運輸與物流工程研究所 === 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 int...
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 |
Similar Items
-
Integration of Genetic Algorithm and Ship Motions for Transocean Route Planning and Its Application
by: Cheng-YunLin, et al.
Published: (2013) -
Ship routing and schedule setting for container liners
by: Shih-Chun Lin, et al.
Published: (2006) -
The Allocation of Empty Containers in Liner Shipping— Take Trans-Pacific Route as a Case
by: Chen Shu-Fen, et al.
Published: (2002) -
The Risk of Seafares' Fatigue and Ship Routing and Scheduling in Container Liner Shipping
by: Liao Kuo Kai, et al.
Published: (2014) -
The Route Selection and Fleet Deployment for the Container Liner
by: HSU,YU-CHANG, et al.
Published: (2000)