An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
From MaRDI portal
Publication:6586264
Cites work
- scientific article; zbMATH DE number 877483 (Why is no real title available?)
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- A reactive variable neighborhood search for the vehicle-routing problem with time windows
- A subpath ejection method for the vehicle routing problem
- 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
- Clustering search heuristic for solving a continuous Berth Allocation Problem
- Combinatorial approach to exactly solving discrete and hybrid berth allocation problem
- Container terminal operation and operations research -- a classification and literature review
- Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions
- Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems
- Large neighborhood search for multi-trip vehicle routing
- Reducing fuel emissions by optimizing speed on shipping routes
- Ship scheduling with soft time windows: An optimisation based approach
- The berth planning problem
- Transport operations in container terminals: literature overview, trends, research directions and classification scheme
This page was built for publication: An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586264)
