A large neighbourhood search heuristic for ship routing and scheduling with split loads
From MaRDI portal
Publication:709186
DOI10.1016/j.cor.2010.07.005zbMath1231.90093OpenAlexW2049171027MaRDI QIDQ709186
Jarl Eirik Korsvik, Kjetil Fagerholt, Gilbert Laporte
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.07.005
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Solving the vessel routing and scheduling problem at a Canadian maritime transportation company, Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery, Liner shipping network design with deadlines, Full-shipload tramp ship routing and scheduling with variable speeds, Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach, Vessel routing with pickups and deliveries: an application to the supply of offshore oil platforms, A branch-price-and-cut method for a ship routing and scheduling problem with split loads, A time-dependent vessel routing problem with speed optimization, Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company, A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips, Multi‐objective optimization of the maritime cargo routing and scheduling problem, The Maritime Pickup and Delivery Problem with Time Windows and Split Loads, Solving a pickup and delivery routing problem for fourth‐party logistics providers, Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain, The traveling salesman problem with draft limits, Industrial and tramp ship routing problems: closing the gap for real-scale instances, Mathematical models for a ship routing problem with a small number of ports on a route, Ship routing and scheduling in the new millennium
Cites Work
- Unnamed Item
- Unnamed Item
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A general heuristic for vehicle routing problems
- An empirical study on the benefit of split loads with the pickup and delivery problem
- Vehicle routing with split deliveries
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- The split delivery vehicle scheduling problem with time windows and grid network distances
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- Split delivery routing
- The capacitated team orienteering and profitable tour problems
- Savings by Split Delivery Routing
- Computerized scheduling of seagoing tankers
