英文摘要
|
In order to offer better service and maintain competitiveness, most major shipping carriers have ”networklized” their containership routes, and this is the main cause of the container routing problem. This container routing problem is to determine optimal paths for each set of containers with the same origin and destination (O-D), under the available capacities offered by containership routes and at the minimum overall costs. An optimization model is formulated for this container routing problem for shipping carriers. Essentially, this model is a multicommodity network flow problem. Promising test results from this model are obtained, which have shown the model c feasibility. We hope that this model can be applied in the real world industry and serve as a helpful tool for shipping carriers in solving their container routing problem.
|
参考文献
|
-
陳春益 Chen, Chuen-Yih邱明琦 Chiu, Ming-Chi(2002)。貨櫃航線網路設計模式之研究。運輸計劃 Transportation Planning Journal,31(2)
連結:
-
Christiansen, M.(1999).Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem.Transportation Science,33
-
Iakovou, E.Douligeris, C.Li, HuanIp, ChiYudhbir, L.(1999).A Maritime Global Route Planning Model for Hazardous Materials Transportation.Transportation Science,33
-
Rana, K.Vickson, R. G.(1991).Routing Container Ships Using Lagrangean Relaxation and Decomposition.Transportation Science,25(3)
-
吳俊霖 Wu, Jin-Lin(1999)。台灣路線貨運業車輛排程排班問題之研究。國立成功大學交通管理科學研究所。
-
陳春益 Chen, Chuen-Yih林正章 Lin, Cheng-Chang高玉明 Gau, Yuh-Ming(1997)。路線貨運業貨物排程模式之研究 A Freight Routing Model for Time Definite Carriers。運輸計劃 Transportation Planning Journal,26(2)
-
陳春益 Chen, Chuen-Yih蔡蕉蘭 Tsai, Jain-Lan(1997)。國內貨物排程問題之探討。運輸學刊 Journal of the Chinese Institute of Transportation,10(2)
|