Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem

DOI10.1007/978-3-642-29124-1_5zbMath1292.90345OpenAlexW153094815MaRDI QIDQ3164904

Rudinei Martins de Oliveira, Geraldo Regis Mauri, Luiz Antonio Nogueira Lorena

Publication date: 18 October 2012

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29124-1_5

zbMATH Keywords

metaheuristicssimulated annealingclustering searchcontinuous Berth Allocation Problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

A follow-up survey of berth allocation and quay crane scheduling problems in container terminals ⋮ An adaptive large neighborhood search for the discrete and continuous berth allocation problem ⋮ An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports

This page was built for publication: Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem