Variable neighborhood search for minimum cost berth allocation

DOI10.1016/j.ejor.2006.12.057zbMath1160.90497OpenAlexW2004480472MaRDI QIDQ932179

Nenad Mladenović, Pierre Hansen, Oguz, Ceyda

Publication date: 10 July 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.057

zbMATH Keywords

earlinesslatenessheuristicmetaheuristicvariable neighborhood searchgenetic searchberth allocationmemetic searchhandlingwaiting

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Tactical berth allocation under uncertainty, A set-partitioning-based model for the berth allocation problem under time-dependent limitations, Optimal policies for the berth allocation problem under stochastic nature, Variable neighborhood search for the pharmacy duty scheduling problem, The crane scheduling problem: models and solution approaches, A Decision Model for Berth Allocation Under Uncertainty Considering Service Level Using an Adaptive Differential Evolution Algorithm, Berth allocation with time-dependent physical limitations on vessels, Variable neighbourhood search: methods and applications, The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects, Combinatorial approach to exactly solving discrete and hybrid berth allocation problem, Selecting algorithms for large berth allocation problems, Variable neighbourhood search: Methods and applications, Metaheuristic approaches for the Berth Allocation Problem, A survey of berth allocation and quay crane scheduling problems in container terminals, The Dynamic Berth Allocation Problem: A linearized formulation

Cites Work

• Unnamed Item
• The berth planning problem
• Stabilized column generation
• Variable neighborhood search
• Container terminal operation and operations research -- a classification and literature review
• The berth allocation problem: models and solution methods
• Transshipment of containers at a container terminal: An overview
• A scheduling method for Berth and Quay cranes
• Variable Neighborhood Search
• Berth scheduling for container terminals by using a sub-gradient optimization technique
• Berth allocation planning in the public berth system by genetic algorithms
• Variable neighborhood search: Principles and applications
• Berth planning and resources optimisation at a container terminal via discrete event simulation