We investigate an optimization problem in container ports, for which previous models based on generalized set partitioning formulations have been studied. We describe two combinatorial relaxations based on computing maximum weighted matchings in suitable graphs. Besides dual bounds, those also provide a variable reduction technique and a matheuristic. Computational results indicate that the alg...

The berth allocation problem (BAP) arising in maritime container terminals has received great attention in the literature over recent years. It has been largely modeled as an integer mathematical programming formulation to be adopted at a tactical level, where detailed equipment and manpower schedules, as well as real-time operational conditions are not explicitly modeled. In this paper, decisi...

This paper proposed an integrated model of combining Berth Allocation Problems (BAP) and Quay Cranes Assignments (QCA). It aims to improve terminal performances by minimizing the total service time and vessel transfer rate, especially for those important customers (vessels). A Two-Level Genetic Algorithm (TLGA) approach was proposed for solving the problems. A number of experiments were conduct...

Container terminals are facilities where cargo containers are transshipped between different transport vehicles, for onward transportation. They are open systems that carry out a large number of different combinatorial problems that can be solved by means of Artificial Intelligence techniques. In this work, we focus our attention on scheduling a number of incoming vessels by assigning to each a...

The berth scheduling problem deals with the assignment of vessels to berth space in a container terminal. Defining berth schedules in container terminal operations translates in meeting different objectives that are often noncommensurable and gaining an improvement on one objective often causes degrading performance on the others. In this paper the discrete space and dynamic arrival berth sched...

In this paper, the optimization of the Berth Allocation Problem (BAP) is transformed into a multiple stage decision making procedure and a new multiple stage search method, namely stochastic beam search algorithm, is proposed to solve it. New techniques such as an improved beam search scheme, a two-phase node goodness estimation, and a stochastic node selection criteria are proposed. Real-life ...

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...