2017
DOI: 10.1016/j.eswa.2017.07.028
|View full text |Cite
|
Sign up to set email alerts
|

A biased random-key genetic algorithm for the time-invariant berth allocation and quay crane assignment problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 35 publications
(14 citation statements)
references
References 35 publications
0
14
0
Order By: Relevance
“…for packing problems in different settings, such as container loading (Ramos et al, 2018) and closely related berth allocation problems (Correcher and Alvarez-Valdes, 2017). Additionally, Alvarez-Valdes et al (2013) study the value of integrating path-relinking strategies in other metaheuristic frameworks, as Andrade et al (2021) propose for genetic algorithms.…”
Section: Solving the Static Problemmentioning
confidence: 99%
“…for packing problems in different settings, such as container loading (Ramos et al, 2018) and closely related berth allocation problems (Correcher and Alvarez-Valdes, 2017). Additionally, Alvarez-Valdes et al (2013) study the value of integrating path-relinking strategies in other metaheuristic frameworks, as Andrade et al (2021) propose for genetic algorithms.…”
Section: Solving the Static Problemmentioning
confidence: 99%
“…Türkogullari et al (2014) provide a new position assignment formulation and propose an efficient cutting plane algorithm for solving large BACASP instances to optimality. Correcher and Alvarez-Valdes (2017) address the continuous, time-invariant version of both the BACAP and BACASP with a Genetic Algorithm (GA), whereas Correcher et al (2019) developed a Mixed Integer Programming (MIP) model to solve both variants in an exact manner. Zhang et al (2010), Raa et al (2011) and Xiaolong et al (2015) all proposed MIP formulations which take into account a limited coverage range for each crane and demonstrate how such restrictions may be of significant practical relevance for integrated planning approaches.…”
Section: Time-invariant Versions and Accommodating Real-world Limitationsmentioning
confidence: 99%
“…Stochastic vessel arrival and handling times Zhen, 2015;Ursavas and Zhu, 2016;Umang et al, 2017;Liu et al, 2017;Xiang et al, 2017 Fuel consumption and emissions Hu et al, 2014;He, 2016;Venturini et al, 2017 Terminals with multiple continuous quays Frojan et al, 2015;Ma et al, 2017 Bulk terminals Bridi et al, 2016;Ernst et al, 2017;Pratap et al, 2017, de León et al, 2017 Water depth and tidal restrictions Qin et al, 2016;Ernst et al, 2017;Zhen et al, 2017 Quay crane assignment problem Hsu, 2016;Lalla-Ruiz and Voß, 2016;He, 2016;Karam and Eltawil, 2016;Türkoǧullari et al, 2016;Shang et al, 2016;Iris et al, 2017;Correcher and Alvarez-Valdes, 2017;Agra and Oliveira, 2018 Academic work has primarily focused on terminals consisting of linear quays where the berthing of vessels is only restricted by the berths' spatial compatibility and their temporal occupation. Adjacency, oppositional and blocking restrictions between berths have rarely been considered and those studies which did address these restrictions were limited to specific terminal layouts.…”
Section: Bap Characteristics Referencesmentioning
confidence: 99%