Metaheuristic approaches for the berth allocation problem
From MaRDI portal
Recommendations
- The berth allocation problem in terminals with irregular layouts
- POPMUSIC as a matheuristic for the berth allocation problem
- The berth allocation problem: models and solution methods
- The berth allocation problem with a cut-and-run option
- Clustering search heuristic for solving a continuous Berth Allocation Problem
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1305705 (Why is no real title available?)
- scientific article; zbMATH DE number 960162 (Why is no real title available?)
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
- A comprehensive survey on particle swarm optimization algorithm and its applications
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
- A probabilistic heuristic for a computationally difficult set covering problem
- A survey of berth allocation and quay crane scheduling problems 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
- Berth allocation at indented berths for mega-containerships
- Berth allocation planning optimization in container terminals
- Effects of storage block layout and automated yard crane systems on the performance of seaport container terminals
- Evolutionary computation. 1. Basic algorithms and operators
- Evolutionary computation. 2. Advanced algorithms and operators
- Future paths for integer programming and links to artificial intelligence
- Metaheuristics. From design to implementation.
- Multi-objective and prioritized berth allocation in container ports
- Optimization by simulated annealing
- POPMUSIC -- partial optimization metaheuristic under special intensification conditions
- Robust berth scheduling at marine container terminals via hierarchical optimization
- Robust berth scheduling with uncertain vessel delay and handling time
- The berth planning problem
- Variable neighborhood search
- Variable neighborhood search for minimum cost berth allocation
Cited in
(9)- POPMUSIC as a matheuristic for the berth allocation problem
- The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm
- Improved sequential insertion heuristics for berth allocation problems
- A dynamic programming-based matheuristic for the dynamic berth allocation problem
- Differential evolution based meta-heuristic algorithm for dynamic continuous berth allocation problem
- An adaptive large neighborhood search for the discrete and continuous berth allocation problem
- Stochastic quay partitioning problem
- Selecting algorithms for large berth allocation problems
- Clustering search heuristic for solving a continuous Berth Allocation Problem
This page was built for publication: Metaheuristic approaches for the berth allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987695)
