Metaheuristic approaches for the Berth Allocation Problem
From MaRDI portal
Publication:4987695
DOI10.2298/YJOR160518001KzbMath1474.90252MaRDI QIDQ4987695
Publication date: 3 May 2021
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Randomized algorithms (68W20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- Robust berth scheduling at marine container terminals via hierarchical optimization
- Effects of storage block layout and automated yard crane systems on the performance of seaport container terminals
- A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
- Multi-objective and prioritized berth allocation in container ports
- Robust berth scheduling with uncertain vessel delay and handling time
- Berth allocation at indented berths for mega-containerships
- Variable neighborhood search for minimum cost berth allocation
- A survey of berth allocation and quay crane scheduling problems in container terminals
- A probabilistic heuristic for a computationally difficult set covering problem
- The berth planning problem
- Variable neighborhood search
- A comprehensive survey on particle swarm optimization algorithm and its applications
- Future paths for integer programming and links to artificial intelligence
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
- Berth Allocation Planning Optimization in Container Terminals
- A survey of simulated annealing as a tool for single and multiobjective optimization
- An Introduction to Tabu Search
- Bee Colony Optimization - part I: The algorithm overview
