Modelling and metaheuristic for gantry crane scheduling and storage space allocation problem in railway container terminals
DOI10.1155/2017/9025482zbMath1403.90379OpenAlexW2770740019MaRDI QIDQ1784912
Peng Guo, Ming Zeng, Wenming Cheng
Publication date: 27 September 2018
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/9025482
mixed integer programmingbacktracking search algorithmgantry crane schedulingstorage space allocation
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Cites Work
- Hybrid evolutionary computation methods for quay crane scheduling problems
- A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
- A ranking-based adaptive artificial bee colony algorithm for global numerical optimization
- Simulation-based optimization for discharge/loading operations at a maritime container terminal
- The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics
- Storage space allocation models for inbound containers in an automatic container terminal
- Backtracking search optimization algorithm for numerical optimization problems
- Determining crane areas for balancing workload among interfering and noninterfering cranes
- Crane scheduling with spatial constraints
- Crane scheduling with non-crossing constraint
This page was built for publication: Modelling and metaheuristic for gantry crane scheduling and storage space allocation problem in railway container terminals
