A self-adaptive evolutionary algorithm for the berth scheduling problem: towards efficient parameter control

DOI10.3390/A11070100MaRDI QIDQ2287487zbMATH OpenOpenAlexFDO

Authors Maxim A. Dulebenets, Masoud Kavoosi, Olumide Abioye, Junayed Pasha

Publication date 21 January 2020

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a11070100

zbMATH Keywords

optimizationparameter tuningevolutionary computationcontainer terminalscomputational timesolution qualityparameter controlmarine transportation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Multi-objective and prioritized berth allocation in container ports
• A decision model for berth allocation under uncertainty considering service level using an adaptive differential evolution algorithm
• An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports
• The dynamic berth allocation problem: A linearized formulation
• Berth allocation planning in the public berth system by genetic algorithms

Cites work

• scientific article; zbMATH DE number 1055067 (Why is no real title available?)
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Berth allocation planning in the public berth system by genetic algorithms
• Introduction to Genetic Algorithms
• Introduction to evolutionary computing
• Multi-objective and prioritized berth allocation in container ports
• Scheduling. Theory, algorithms, and systems.

Cited in

(5)

• The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm
• Differential evolution based meta-heuristic algorithm for dynamic continuous berth allocation problem
• An adaptive large neighborhood search for the discrete and continuous berth allocation problem
• Selecting algorithms for large berth allocation problems
• Proactive berth scheduling with data-driven buffer time in container terminals

This page was built for publication: A self-adaptive evolutionary algorithm for the berth scheduling problem: towards efficient parameter control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287487)