A MIP based local search heuristic for a stochastic maritime inventory routing problem
From MaRDI portal
Publication:1680065
DOI10.1007/978-3-319-44896-1_2zbMath1374.90038OpenAlexW2511418639WikidataQ57736502 ScholiaQ57736502MaRDI QIDQ1680065
Agostinho Agra, Marielle Christiansen, Lars Magnus Hvattum, Filipe Rodrigues
Publication date: 22 November 2017
Full work available at URL: http://hdl.handle.net/10773/16668
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (11)
A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times ⋮ Load-dependent speed optimization in maritime inventory routing ⋮ 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 ⋮ Uncertainty in maritime ship routing and scheduling: a literature review ⋮ A matheuristic for the multi-product maritime inventory routing problem ⋮ Comparing techniques for modelling uncertainty in a maritime inventory routing problem ⋮ A hybrid heuristic for a stochastic production-inventory-routing problem ⋮ An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times ⋮ Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem
This page was built for publication: A MIP based local search heuristic for a stochastic maritime inventory routing problem
