Solving Stochastic Ship Fleet Routing Problems with Inventory Management Using Branch and Price

DOI10.1007/978-3-319-29975-4_8zbMath1355.90006OpenAlexW1494873624MaRDI QIDQ2958618

Yu Yu, K. I. M. McKinnon

Publication date: 3 February 2017

Published in: Advances in Stochastic and Deterministic Global Optimization (Search for Journal in Brave)

Full work available at URL: http://www.maths.ed.ac.uk/ERGO/pubs/ERGO-11-022.html

zbMATH Keywords

stochastic dynamic programminginventory managementbranch and priceship routing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Cites Work

• Stochastic vehicle routing with modified savings algorithm
• A reoptimization algorithm for the shortest path problem with time windows
• A method for solving ship routing problems with inventory constraints
• Modelling path flows for a combined ship routing and inventory management problem
• New optimality cuts for a single-vehicle stochastic routing problem
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• A combined terminal location and ship routing problem
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Robust ship scheduling with multiple time windows
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• Sizing the US destroyer fleet
• A Vehicle Routing Problem with Stochastic Demand
• Unnamed Item
• Unnamed Item