A large neighbourhood search heuristic for ship routing and scheduling with split loads
DOI10.1016/J.COR.2010.07.005zbMATH Open1231.90093OpenAlexW2049171027MaRDI QIDQ709186FDOQ709186
Authors: Jarl Eirik Korsvik, Kjetil Fagerholt, G. 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
Recommendations
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads
- A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
- Routing and scheduling in project shipping
- Ship routing and scheduling with flexible cargo sizes
- A combined ship scheduling and allocation problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Split delivery routing
- Savings by Split Delivery Routing
- A general heuristic for vehicle routing problems
- The capacitated team orienteering and profitable tour problems
- A unified heuristic for a large class of vehicle routing problems with backhauls
- An empirical study on the benefit of split loads with the pickup and delivery problem
- Vehicle routing with split deliveries
- Computerized scheduling of seagoing tankers
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- The split delivery vehicle scheduling problem with time windows and grid network distances
- Title not available (Why is that?)
Cited In (21)
- Solving the vessel routing and scheduling problem at a Canadian maritime transportation company
- Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company
- Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain
- Mathematical models for a ship routing problem with a small number of ports on a route
- Industrial and tramp ship routing problems: closing the gap for real-scale instances
- Multi‐objective optimization of the maritime cargo routing and scheduling problem
- Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery
- 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 time-dependent vessel routing problem with speed optimization
- Solving a pickup and delivery routing problem for fourth‐party logistics providers
- Liner shipping network design with deadlines
- The Maritime Pickup and Delivery Problem with Time Windows and Split Loads
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads
- Ship routing and scheduling in the new millennium
- The traveling salesman problem with draft limits
- A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips
- A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
- A unified operation decision model for dry bulk shipping fleet: ship scheduling, routing, and sailing speed optimization
- A multi-start local search heuristic for ship scheduling -- a computational study
This page was built for publication: A large neighbourhood search heuristic for ship routing and scheduling with split loads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709186)
