A large neighbourhood search heuristic for ship routing and scheduling with split loads

DOI10.1016/J.COR.2010.07.005MaRDI QIDQ709186zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

schedulingroutingmaritime transportationsplit loads

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)

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

Cites work

• scientific article; zbMATH DE number 591242 (Why is no real title available?)
• scientific article; zbMATH DE number 956787 (Why is no real title available?)
• A general heuristic for vehicle routing problems
• 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
• 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
• Computerized scheduling of seagoing tankers
• Savings by Split Delivery Routing
• Split delivery routing
• The capacitated team orienteering and profitable tour problems
• The split delivery vehicle scheduling problem with time windows and grid network distances
• Vehicle routing with split deliveries

Cited in

(21)

• A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
• The Maritime Pickup and Delivery Problem with Time Windows and Split Loads
• Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company
• A time-dependent vessel routing problem with speed optimization
• The traveling salesman problem with draft limits
• A unified operation decision model for dry bulk shipping fleet: ship scheduling, routing, and sailing speed optimization
• A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips
• Mathematical models for a ship routing problem with a small number of ports on a route
• 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
• Ship routing and scheduling in the new millennium
• Industrial and tramp ship routing problems: closing the gap for real-scale instances
• Solving a pickup and delivery routing problem for fourth‐party logistics providers
• 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
• A multi-start local search heuristic for ship scheduling -- a computational study
• Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain
• A branch-price-and-cut method for a ship routing and scheduling problem with split loads
• Liner shipping network design with deadlines
• Solving the vessel routing and scheduling problem at a Canadian maritime transportation company

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)