Biased random key genetic algorithm for the Tactical Berth Allocation Problem

Lalla-Ruiz, Eduardo; González‐Velarde, José Luis; Melián-Batista, Belén; Moreno-Vega, J. Marcos

doi:10.1016/j.asoc.2014.04.035

Cited by 63 publications

(25 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The columns V 1 , V 2 , ..., ⇥ present the results of the formulation with the active inequalities. V 1 refers to the valid inequalities (22), and V 2 refers to (23). V 3 includes the valid inequalities about the start and end decomposition (24)(25)(26)(27)(28)(29)(30)(31)(32)(33)(34)(35)(36)(37).…”

Section: Results For Improved Formulationsmentioning

confidence: 99%

“…Vacca et al [43] focus on the formulation of Giallombardo et al [8] and they propose the first exact decomposition framework for this variant of the BACAP. Lalla-Ruiz et al [22] also focus on this TBAP formulation and implement a genetic algorithm to solve the problem. Studies that follow the QC profile approach do not solve the optimum QC assignment problem presented in this paper, those studies mainly generate a representative set of QC profiles and select one of them for each vessel.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem

Iris

Pacino

Røpke

2017

Transportation Research Part E: Logistics and Transportation Re

105

View full text Add to dashboard Cite

This paper focuses on the integrated berth allocation and quay crane assignment problem in container terminals. We consider the decrease in the marginal productivity of quay cranes and the increase in handling time due to deviation from the desired position. We consider a continuous berth, discretized in small equal-sized sections. A number of enhancements over the state-of-the-art formulation and an Adaptive Large Neighborhood Search (ALNS) heuristic are presented. Computational results reveal that the enhancements improve many of the best-known bounds, and the ALNS outperforms the state-of-the-art heuristics for many instances. We also conduct further analysis on a new larger benchmark.

show abstract

Section: Results For Improved Formulationsmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem

Iris

Pacino

Røpke

2017

Transportation Research Part E: Logistics and Transportation Re

105

View full text Add to dashboard Cite

show abstract

“…Constraint (2) shows that each crane of each contractor is assigned at any time to a maximum of one ship bay. Constraint (3) shows that each ship bay can be serviced by at most one crane of one contractor at any given time. Constraint (4) ensures that the number of cranes assigned to each bay is sufficient to complete the operation on that bay.…”

Section: Problem Description and Modlingmentioning

confidence: 99%

“…Academically, the container terminals were established in the late 1960s to accommodate container ships traveling between Europing contries and the United States [1,2]. In order to reduce the traveling costs, shippers are always looking for more economical size of containers, building larger vessels for long journeys, and improve facilities and technology for servicing ships [3].…”

Section: Introduction and Literature Reviewmentioning

confidence: 99%

Addressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm

Fazli

Fathollahi-Fard

Tian

2019

IJE

View full text Add to dashboard Cite

A B S T R A C TNowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assignment Problem (QCAP) as among the first attempts in this area. Another main contribution of this paper is to apply a recent nature-inspired algorithm called Red Deer Algorithm (RDA). The RDA revealed its performance for a variety of combinatorial optimization problems in different real-world applications. This is the first attempt in the literature to employ this recent metaheuristic to solve the proposed Coordinated Quay Crane Scheduling and Assignment Problem (CQCSAP). Finally, an extensive comparison discussion is considered to reveal the main benefits of the proposed optimization model and solution algorithm.

show abstract

“…Tactical BAP is studied in Lalla-Ruiz et al [53] and a biased random key GA is proposed as solution approach. Chromosomes are vectors whose length is twice the number of vessels.…”

Section: Genetic Algorithmsmentioning

confidence: 99%

Metaheuristic approaches for the Berth Allocation Problem

Kovač

2017

YUGOSLAV J OPERATION

View full text Add to dashboard Cite

Berth Allocation Problem incorporates some of the most important decisions that have to be made in order to achieve maximum efficiency in a port. Terminal manager of a port has to assign incoming vessels to the available berths, which need to be loaded/unloaded in such a way that some objective function is optimized. It is well known that even simpler variants of Berth Allocation Problem are NP-hard, and thus, metaheuristic approaches are more convenient than exact methods since they provide high quality solutions in reasonable computational time. Metaheuristics are general frameworks used to build heuristic algorithms for hard optimization problems. In this paper, an overview of promising and widely used metaheuristic methods in solving different variants of Berth Allocation Problem is presented.

show abstract

Biased random key genetic algorithm for the Tactical Berth Allocation Problem

Cited by 63 publications

References 34 publications

Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem

Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem

Addressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm

Metaheuristic approaches for the Berth Allocation Problem

Contact Info

Product

Resources

About