Differential evolution based meta-heuristic algorithm for dynamic continuous berth allocation problem
From MaRDI portal
Publication:2281828
DOI10.1016/j.apm.2016.08.017zbMath1443.90062OpenAlexW2512444956MaRDI QIDQ2281828
Publication date: 6 January 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2016.08.017
Deterministic scheduling theory in operations research (90B35) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)
Related Items (3)
Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm ⋮ Novel formulations and modeling enhancements for the dynamic berth allocation problem ⋮ Interval differential evolution with dimension-reduction interval analysis method for uncertain optimization problems
Cites Work
- Unnamed Item
- Robust berth scheduling with uncertain vessel delay and handling time
- Berth allocation at indented berths for mega-containerships
- The berth planning problem
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- The berth allocation problem: models and solution methods
- Disturbance encountered landing system design based on sliding mode control with evolutionary computation and cerebellar model articulation controller
- A penalty function-based differential evolution algorithm for constrained global optimization
- Scheduling of machines and automated guided vehicles in FMS using differential evolution
- NONLINEAR MATHEMATICAL PROGRAMMING FOR OPTIMAL MANAGEMENT OF CONTAINER TERMINALS
- Berth allocation planning in the public berth system by genetic algorithms
This page was built for publication: Differential evolution based meta-heuristic algorithm for dynamic continuous berth allocation problem
