A self-adaptive evolutionary algorithm for the berth scheduling problem: towards efficient parameter control
Summary: Since ancient times, maritime transportation has played a very important role for the global trade and economy of many countries. The volumes of all major types of cargo, which are transported by vessels, has substantially increased in recent years. Considering a rapid growth of waterborne trade, marine container terminal operators should focus on upgrading the existing terminal infrastructure and improving operations planning. This study aims to assist marine container terminal operators with improving the seaside operations and primarily focuses on the berth scheduling problem. The problem is formulated as a mixed integer linear programming model, minimizing the total weighted vessel turnaround time and the total weighted vessel late departures. A self-adaptive Evolutionary Algorithm is proposed to solve the problem, where the crossover and mutation probabilities are encoded in the chromosomes. Numerical experiments are conducted to evaluate performance of the developed solution algorithm against the alternative Evolutionary Algorithms, which rely on the deterministic parameter control, adaptive parameter control, and parameter tuning strategies, respectively. Results indicate that all the considered solution algorithms demonstrate a relatively low variability in terms of the objective function values at termination from one replication to another and can maintain the adequate population diversity. However, application of the self-adaptive parameter control strategy substantially improves the objective function values at termination without a significant impact on the computational time.
- 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
- 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
- scientific article; zbMATH DE number 1055067 (Why is no real title available?)
- Introduction to evolutionary computing
- Introduction to Genetic Algorithms
- Multi-objective and prioritized berth allocation in container ports
- Scheduling. Theory, algorithms, and systems.
- An adaptive large neighborhood search for the discrete and continuous berth allocation problem
- 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
- Selecting algorithms for large berth allocation problems
- Proactive berth scheduling with data-driven buffer time in container terminals
- Stochastic quay partitioning problem
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)
