A maritime inventory routing problem: Discrete time formulations and valid inequalities
From MaRDI portal
Publication:2811316
DOI10.1002/net.21518zbMath1338.90016OpenAlexW2040440767WikidataQ57736539 ScholiaQ57736539MaRDI QIDQ2811316
Henrik Andersson, Agostinho Agra, Laurence A. Wolsey, Marielle Christiansen
Publication date: 10 June 2016
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11250/2452885
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items (24)
Discrete time and continuous time formulations for a short sea inventory routing problem ⋮ A comprehensive annual delivery program for upstream liquefied natural gas supply chain ⋮ An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem ⋮ Flexible solutions to maritime inventory routing problems with delivery time windows ⋮ An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping ⋮ Load-dependent speed optimization in maritime inventory routing ⋮ Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing ⋮ Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company ⋮ A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem ⋮ Maritime inventory routing: recent trends and future directions ⋮ An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem ⋮ Combined ship routing and inventory management in the salmon farming industry ⋮ A matheuristic for the multi-product maritime inventory routing problem ⋮ A multi-period inventory routing problem with procurement decisions: a case in China ⋮ Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries ⋮ Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph ⋮ Inventory routing with pickups and deliveries ⋮ MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results ⋮ The pickup and delivery problem with time windows and occasional drivers ⋮ Mixed integer formulations for a routing problem with information collection in wireless networks ⋮ Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation ⋮ A branch-and-cut algorithm for an assembly routing problem ⋮ Hybrid heuristics for a short sea inventory routing problem ⋮ Reoptimization framework and policy analysis for maritime inventory routing under uncertainty
Cites Work
- Unnamed Item
- A maritime inventory routing problem: practical approach
- Shipment planning at oil refineries using column generation and valid inequalities
- A cutting plane approach to capacitated lot-sizing with start-up costs
- On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Industrial aspects and literature survey: Combined inventory management and routing
- Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model
- An optimization algorithm for the inventory routing problem with continuous moves
- Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem
- A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Production Planning by Mixed Integer Programming
- Supply Chain Optimization for the Liquefied Natural Gas Business
This page was built for publication: A maritime inventory routing problem: Discrete time formulations and valid inequalities
