Multi-Period Coordinated Optimization on Berth Allocation and Yard Assignment in Container Terminals Based on Truck Route
نویسندگان
چکیده
Berths and yards are the most critical parts of container terminals. Their efficiency directly influences terminal operation efficiency. The multi-period coordinated optimization on berth allocation yard assignment has been studied considering a interaction between yard. problem is formulated as an integer programming, aimed at minimizing total truck travel distance, where decision variables berthing positions for visiting vessels storage export containers. In this work, complexity theoretically demonstrated. A tabu genetic algorithm designed to solve obtain optimal stacking positions. With algorithm, rule applied generate initial feasible solutions, crossover mutation operations simultaneously optimize solutions. Finally, two different scenarios, determinate scenario scenario, presented compare influence distance. numerical experiments demonstrate that positions, period segments affect And can effectively shorten distance improve operation, which supports decisions operators maintains efficient development terminal.
منابع مشابه
Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
In this work, we focus on the integrated planning of the following problems faced within the context of seaside operations at container terminals: berth allocation, quay crane assignment, and quay crane scheduling. First, we formulate a new binary integer linear program for the integrated solution of the berth allocation and quay crane assignment problems called BACAP. Then we extend it by inco...
متن کاملOptimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
We focus on the integrated seaside operations in container terminals, namely the integration of berth allocation, quay crane assignment and quay crane scheduling problems. We first develope a mixed-integer linear programming formulation. Then, we propose an efficient cutting plane algorithm based on a decomposition scheme. Our approach deals with berthing positions of the vessels and their assi...
متن کاملOptimal berth allocation and time-invariant quay crane assignment in container terminals
Due to the dramatic increase in the world’s container traffic, the efficient management of operations in seaport container terminals has become a crucial issue. In this work, we focus on the integrated planning of the following problems faced at container terminals: berth allocation, quay crane assignment (number), and quay crane assignment (specific). First, we formulate a new binary integer l...
متن کاملReal time disruption recovery for integrated berth allocation and crane assignment in container terminals
متن کامل
Yard crane scheduling in port container terminals using genetic algorithm
Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2021.3086185