An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports
DOI10.1016/J.EJOR.2020.04.050zbMATH Open1487.90296OpenAlexW3024806877MaRDI QIDQ2023947FDOQ2023947
David Pisinger, David Sacramento, Erik Orm Hellsten
Publication date: 3 May 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.04.050
Recommendations
- Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports
- Solving the vessel routing and scheduling problem at a Canadian maritime transportation company
- A multi-start local search heuristic for ship scheduling -- a computational study
- An adaptive large neighborhood search for the discrete and continuous berth allocation problem
- The crane scheduling problem: models and solution approaches
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization by Simulated Annealing
- Introduction to algorithms.
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A survey of variants and extensions of the resource-constrained project scheduling problem
- A general heuristic for vehicle routing problems
- Operations research at container terminals: a literature update
- Ship routing and scheduling in the new millennium
- IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- Title not available (Why is that?)
- Liner shipping network design
- A new particle swarm optimization for the open shop scheduling problem
- Constraint propagation techniques for the disjunctive scheduling problem
- A hybrid genetic algorithm for the open shop scheduling problem
- A genetic algorithm for scheduling open shops with sequence-dependent setup times
- A two-phase heuristic for an in-port ship routing problem with tank allocation
- An optimal constraint programming approach to the open-shop problem
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- A new particle swarm optimization for multi-objective open shop scheduling
- Handbook of metaheuristics
Cited In (5)
- Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports
- An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
- An adaptive large neighborhood search for the multi-point dynamic aggregation problem
- Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows
- A multi-start local search heuristic for ship scheduling -- a computational study
Uses Software
This page was built for publication: An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2023947)
