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

DOI10.1016/J.COR.2012.04.021zbMATH Open1349.90129OpenAlexW2017936537MaRDI QIDQ339703FDOQ339703

Authors: Magnus Stålhane, Henrik Andersson, Marielle Christiansen, Jean-François Cordeau, 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

Recommendations

• A large neighbourhood search heuristic for ship routing and scheduling with split loads
• A branch-price-and-cut algorithm for single-product maritime inventory routing
• A method for solving ship routing problems with inventory constraints
• Ship routing and scheduling with flexible cargo sizes
• Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows

zbMATH Keywords

pickup and deliverymaritime transportationbranch-price-and-cutsplit loads

Mathematics Subject Classification ID

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

Cites Work

• The pickup and delivery problem with time windows
• Title not available (Why is that?)
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Shortest Path Problems with Resource Constraints
• Branch-and-price: Column generation for solving huge integer programs
• Handbooks in operations Research \& management science: Transportation
• Savings by Split Delivery Routing
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• DRIVE: Dynamic routing of independent vehicles
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• Vehicle routing with split deliveries
• A column generation approach for the split delivery vehicle routing problem
• The Maritime Pickup and Delivery Problem with Time Windows and Split Loads
• A large neighbourhood search heuristic for ship routing and scheduling with split loads
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• Routing helicopters for crew exchanges on off-shore locations
• The split delivery vehicle scheduling problem with time windows and grid network distances
• Title not available (Why is that?)

Cited In (11)

• Column generation approaches to ship scheduling with flexible cargo sizes
• A branch-price-and-cut algorithm for single-product maritime inventory routing
• 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
• 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
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
• Full-shipload tramp ship routing and scheduling with variable speeds
• A large neighbourhood search heuristic for ship routing and scheduling with split loads
• A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
• Optimizing vessel fleet size and mix to support maintenance operations at offshore wind farms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339703)