An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
From MaRDI portal
Publication:6586264
DOI10.1016/j.ejor.2024.02.003MaRDI QIDQ6586264
Stefan Ropke, Dario Pacino, Bernardo Martin-Iradi
Publication date: 13 August 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Transport operations in container terminals: literature overview, trends, research directions and classification scheme
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- Large neighborhood search for multi-trip vehicle routing
- The berth planning problem
- Container terminal operation and operations research -- a classification and literature review
- An adaptive large neighborhood search for the discrete and continuous berth allocation problem
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports
- Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions
- Combinatorial approach to exactly solving discrete and hybrid berth allocation problem
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems
- A Subpath Ejection Method for the Vehicle Routing Problem
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem
- Reducing fuel emissions by optimizing speed on shipping routes
- Ship scheduling with soft time windows: An optimisation based approach
This page was built for publication: An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
