An Extension of the Berth Allcation Problem to the Berth Template Probem
نویسنده
چکیده
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 arranges their berth-windows within a limited planning horizon. The BTPS employs the subgradient optimization procedure, which is the one the author developed for the operational berth allocation problem. A wide variety of numerical experiments indicate the subgradient procedure works well for the BTPS.
منابع مشابه
Berth management in container terminal
One of the foremost planning problems in container transshipment operation concerns the allocation of home berth (preferred berthing location) to a set of vessels scheduled to call at the terminal on a weekly basis. The home berth location is subsequently used as a key input to yard storage, personnel, and equipment deployment planning. For instance, the yard planners use the home berth templat...
متن کاملA new multi-objective model for berth allocation and quay crane assignment problem with speed optimization and air emission considerations (A case study of Rajaee Port in Iran)
Over the past two decades, maritime transportation and container traffic worldwide has experienced rapid and continuous growth. With the increase in maritime transportation volume, the issue of greenhouse gas (GHG) emission has become one of the new concerns for port managers. Port managers and government agencies for sustainable development of maritime transportation considered "green ports" t...
متن کاملOptimal Allocation of Ships to Quay Length in Container Ports
Due to the continuously increasing container trade, many terminals are presently operating at or close to capacity. An efficient terminal is one that facilitates the quick transshipment of containers to and from ships. In this sake, this paper addresses the ship assignments problem at a maritime container terminal, where ships are normally assigned to specific quay cranes until the work is fini...
متن کاملAn Exact Method for Berth Allocation at Raw Material Docks
This paper studies a short-term berth allocation problem encountered in the Baoshan Iron and Steel complex. A mathematical model is developed for the problem to minimize the total tardiness particularly considering special industrial characteristics. A lower bound derived by performing a Lagrangian relaxation, along with appropriate branching rules, is incorporated into a branch and bound algor...
متن کاملMinimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic
Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated ...
متن کامل