A multi-start local search heuristic for ship scheduling -- a computational study
From MaRDI portal
Publication:2433394
DOI10.1016/j.cor.2005.05.017zbMath1120.90031OpenAlexW2021079786MaRDI QIDQ2433394
Geir Brønmo, Bjørn Nygreen, Marielle Christiansen, Kjetil Fagerholt
Publication date: 27 October 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.05.017
Integer programming (90C10) Search theory (90B40) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items
Solving the vessel routing and scheduling problem at a Canadian maritime transportation company ⋮ Operations research models for coalition structure in collaborative logistics ⋮ A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints ⋮ Liner shipping network design with deadlines ⋮ Full-shipload tramp ship routing and scheduling with variable speeds ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping ⋮ Routing and scheduling in a liquefied natural gas shipping problem with inventory and berth constraints ⋮ Routing and scheduling in project shipping ⋮ Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company ⋮ Benchmark Suite for Industrial and Tramp Ship Routing and Scheduling Problems ⋮ Turning restriction design in traffic networks with a budget constraint ⋮ Recent Models and Algorithms for One-to-One Pickup and Delivery Problems ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ Hub-and-spoke network design and fleet deployment for string planning of liner shipping ⋮ Industrial and tramp ship routing problems: closing the gap for real-scale instances ⋮ Solving multiple scenarios in a combinatorial auction ⋮ Ship Routing Scheduling with Persistence and Distance Objecives ⋮ Ship routing and scheduling in the new millennium
Cites Work
- Ship scheduling: The last decade
- A multi-start local search algorithm for the vehicle routing problem with time windows
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- Short-Term Scheduling of Vessels for Shipping Bulk or Semi-Bulk Commodities Originating in a Single Area
- Multi-Start Methods
- A unified tabu search heuristic for vehicle routing problems with time windows
- Robust ship scheduling with multiple time windows
- Robust Inventory Ship Routing by Column Generation
- Ship scheduling with soft time windows: An optimisation based approach
This page was built for publication: A multi-start local search heuristic for ship scheduling -- a computational study
