Midterm Berth Planning Problem Considering Ship Selection and Time Window
碩士 === 國立交通大學 === 運輸與物流管理學系 === 102 === Under the context of a congested container terminal, solving the congested problem has become the most important issue to port operators. The study developed two mixed integer programming (MIP) models for the tactical berth template design problem. With the ob...
Main Authors: | Chen, Yi-Huei, 陳怡卉 |
---|---|
Other Authors: | Huang, Kuan-Cheng |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/76322177166446778142 |
Similar Items
-
Optimal ship berthing plans
by: Thurman, Katie Podolak
Published: (2013) -
Reassignment of Berthing Time-windows
by: Jo-Line Yang, et al.
Published: (2005) -
A GA and Time Window Based Rolling Method for Dynamic Berth Allocation Problems
by: Yu-Kuan Lin, et al.
Published: (2006) -
A Set Covering Model for a Green Ship Routing and Scheduling Problem with Berth Time-Window Constraints for Use in the Bulk Cargo Industry
by: Apichit Maneengam, et al.
Published: (2021-05-01) -
Berth Scheduling Problem Considering Traffic Limitations in the Navigation Channel
by: Ya Xu, et al.
Published: (2018-12-01)