Hybrid Estimation of Distribution Algorithm for the Quay Crane Scheduling Problem

Authors:
Christopher ExpóSito-Izquierdo;José Luis GonzáLez-Velarde;BeléN MeliáN-Batista;J. Marcos Moreno-Vega
Affiliations:
-;-;-;-
Venue:
Applied Soft Computing
Year:
2013

Citing 18
Cited 0

From Recombination of Genes to the Estimation of Distributions I. Binary Parameters

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory

INFORMS Journal on Computing
A comprehensive survey of fitness approximation in evolutionary computation

Soft Computing - A Fusion of Foundations, Methodologies and Applications
A tabu search heuristic for the quay crane scheduling problem

Journal of Scheduling
Unsupervised feature selection using clustering ensembles and population based incremental learning algorithm

Pattern Recognition
Using previous models to bias structural learning in the hierarchical BOA

Proceedings of the 10th annual conference on Genetic and evolutionary computation
An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems

Computers and Operations Research
Handbook of Parametric and Nonparametric Statistical Procedures

Handbook of Parametric and Nonparametric Statistical Procedures
A fast heuristic for quay crane scheduling with interference constraints

Journal of Scheduling
Tuning Metaheuristics: A Machine Learning Perspective

Tuning Metaheuristics: A Machine Learning Perspective
Metaheuristics: From Design to Implementation

Metaheuristics: From Design to Implementation
A unified approach for the evaluation of quay crane scheduling models and algorithms

Computers and Operations Research
Subspace estimation of distribution algorithms: To perturb part of all variables in estimation of distribution algorithms

Applied Soft Computing
An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem

Computers and Operations Research
A modified genetic algorithm for quay crane scheduling operations

Expert Systems with Applications: An International Journal
Modeling and solving rich quay crane scheduling problems

Computers and Operations Research
Estimation of particle swarm distribution algorithms: Combining the benefits of PSO and EDAs

Information Sciences: an International Journal
Pre-Marshalling Problem: Heuristic solution method and instances generator

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The competitiveness of a container terminal is highly conditioned by the time that container vessels spend on it. The proper scheduling of the quay cranes can reduce this time and allows a container terminal to be more attractive to shipping companies. The goal of the Quay Crane Scheduling Problem (QCSP) is to minimize the handling time of the available quay cranes when performing the tasks of loading and unloading containers onto/from a container vessel. This paper proposes a hybrid Estimation of Distribution Algorithm with local search to solve the QCSP. This approach includes a priori knowledge about the problem in the initialization step to reach promising regions of the search space as well as a novel restarting strategy with the aim of avoiding the premature convergence of the search. Furthermore, an approximate evaluation scheme is applied in order to reduce the computational burden. Moreover, its performance is statistically compared with the best optimization method from the literature. Numerical testing results demonstrate the high robustness and efficiency of the developed technique. Additionally, some relevant components of the scheme are individually analyzed to check their effectiveness.