An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports

DOI10.1016/j.ejor.2020.04.050zbMath1487.90296OpenAlexW3024806877MaRDI QIDQ2023947

David Sacramento, Erik Orm Hellsten, David Pisinger

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

zbMATH Keywords

OR in maritime industryport operationsALNSgeneral shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows ⋮ Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports

Uses Software

• ILOG SCHEDULE
• LINERLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A general heuristic for vehicle routing problems
• A survey of variants and extensions of the resource-constrained project scheduling problem
• A hybrid genetic algorithm for the open shop scheduling problem
• Constraint propagation techniques for the disjunctive scheduling problem
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• A two-phase heuristic for an in-port ship routing problem with tank allocation
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
• Liner shipping network design
• A genetic algorithm for scheduling open shops with sequence-dependent setup times
• Ship routing and scheduling in the new millennium
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• Operations research at container terminals: a literature update
• A new particle swarm optimization for the open shop scheduling problem
• An Optimal Constraint Programming Approach to the Open-Shop Problem
• A new particle swarm optimization for multi-objective open shop scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Handbook of metaheuristics

This page was built for publication: An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports