Decentralized Cooperative Metaheuristic for the Dynamic Berth Allocation Problem
نویسندگان
چکیده
منابع مشابه
Simulation-Optimization Models for the Dynamic Berth Allocation Problem
Container terminals are designed to provide support for the continuous changes in container ships. The most common schemes used for dock management are based on discrete and continuous locations. In view of the steadily growing trend in increasing container ship size, more flexible berth allocation planning is mandatory. The consideration of continuous location in the container terminal is a go...
متن کاملGenetic Algorithm for Dynamic Berth Allocation Problem with Discrete Layout
Genetic Algorithm which is based on the Darwinian principle of natural selection has been successfully applied to Berth allocation problem (BAP), which can decide the ships’ berthing position and berthing time at a container terminal. Considering the service priority, handing time deciding variables, safety clearance, as well as the berths’ physical conditions, a dynamic berth allocation with d...
متن کاملTowards a Matheuristic Approach for the Berth Allocation Problem
The Berth Allocation Problem aims at assigning and scheduling incoming vessels to berthing positions along the quay of a container terminal. This problem is a well-known optimization problem within maritime shipping. For solving it, we propose two POPMUSIC (Partial Optimization Metaheuristic Under Special Intensification Conditions) approaches that incorporate an existing mathematical programmi...
متن کاملModels and Tabu Search Heuristics for the Berth-Allocation Problem
In the Berth Allocation Problem (BAP) the aim is to optimally schedule and assign ships to berthing areas along a quay. The objective is the minimization of the total (weighted) service time for all ships, defined as the time elapsed between the arrival in the harbor and the completion of handling. Two versions of the BAP are considered: the discrete case and the continuous case. The discrete c...
متن کاملA Hybrid Column Generation Approach for the Berth Allocation Problem
The Berth Allocation Problem (BAP) consists on programming and allocating ships to berthing areas along a quay. The BAP is modeled as a vehicle routing problem and a recently proposed evolutionary hybrid method denominated PTA/LP is used to solve it. The PTA/LP combines the Population Training Algorithm with Linear Programming to generate improving incoming columns in a column generation proces...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inteligencia Artificial
سال: 2015
ISSN: 1988-3064,1137-3601
DOI: 10.4114/intartif.vol18iss55pp1-11