The strategic berth template problem
檔案
- 000346894600005.pdf (1.19 MB, Adobe PDF)
日期
2014-12-01
類型
期刊名稱
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
卷期與頁次
第 72 卷,頁 77–100
ISSN
1366-5545
語言
英文
摘要
A marine container terminal operator may have a situation with excessive calling requests to be served especially when some new service contracts are under consideration. For this situation, we propose a strategic berth template problem (BTPS) that selects the ships among the requesting ones to be served and arrange their berth-windows within a limited planning horizon. The BTPS employs the subgradient optimization procedure, which is an improved version of the procedure that the authors developed for the operational berth allocation problem. A wide variety of numerical experiments indicate the improved subgradient procedure works well for the BTPS. (C) 2014 Elsevier Ltd. All rights reserved.
關鍵詞
Berth template problemBerth allocation problemSubgradient optimizationLagrangian relaxationContainer terminalHeuristics所屬典藏
期刊論文引用此條目
Imai, A., Yamakawa, Y., & Huang, K. (2014). The strategic berth template problem. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 72, 77–100. https://doi.org/10.1016/j.tre.2014.09.013
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/124090