Efficient Heuristics for the Dynamic Berth Allocation Problem in Discrete Berthing Locations

スポンサーリンク

概要

• 論文の詳細を見る

• Marine container terminal is a switching facility of containers between sea and land as well as between deepsea and shortsea for sea transportation legs. The overall terminal efficiency highly depends on harmonized operations of complicated and different handling tasks being undertaken at the terminal. One of the most important operational issues is the berth allocation scheduling (or berth allocation problem), because an improper berth schedule forces ships to be berthed far from their containers to be handled in a yard. Such an unproductive service situation is never able to be overcome by any proper operational efforts for other handling tasks. The authors developed heuristics that were implemented using a subgradient optimization technique with a Lagrangian relaxation to the original problem for the dynamic berth allocation problem in discrete locations. This study improves the heuristics by introducing a new procedure to find a better feasible solution in the entire iterative process of subgradient technique.

• 2012-03-25

著者

• Nishimura Etsuko

  Graduate School Of Maritime Sciences Kobe University

• Imai Akio

  Graduate School Of Maritime Sciences Kobe University

• YAMAKAWA Yukiko

  Graduate School of Maritime Sciences, Kobe University

• Yamakawa Yukiko

  Graduate School Of Maritime Sciences Kobe University

関連論文

• An Investigation into Effectiveness of Container Arrangements on Optimizing a Containership Stowage Plan
• Determining Containership Loading Problem on the Basis of an Adopted Number of Handling Cranes
• Efficient Heuristics for the Dynamic Berth Allocation Problem in Discrete Berthing Locations

スポンサーリンク