A branch-price-and-cut method for a ship routing and scheduling problem with split loads

DOI10.1016/j.cor.2012.04.021zbMath1349.90129OpenAlexW2017936537MaRDI QIDQ339703

Jean-François Cordeau, Henrik Andersson, Magnus Stålhane, Marielle Christiansen, Guy Desaulniers

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.04.021

zbMATH Keywords

pickup and deliverymaritime transportationbranch-price-and-cutsplit loads

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (8)

Full-shipload tramp ship routing and scheduling with variable speeds ⋮ Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company ⋮ A branch-and-price algorithm for the liner shipping network design problem ⋮ Optimizing vessel fleet size and mix to support maintenance operations at offshore wind farms ⋮ A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments ⋮ The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A large neighbourhood search heuristic for ship routing and scheduling with split loads
• The pickup and delivery problem with time windows
• Vehicle routing with split deliveries
• Routing helicopters for crew exchanges on off-shore locations
• 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
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Drive: Dynamic Routing of Independent Vehicles
• Savings by Split Delivery Routing
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Shortest Path Problems with Resource Constraints
• A column generation approach for the split delivery vehicle routing problem
• The Maritime Pickup and Delivery Problem with Time Windows and Split Loads

This page was built for publication: A branch-price-and-cut method for a ship routing and scheduling problem with split loads