The dynamic bowser routing problem
From MaRDI portal
Publication:1711454
DOI10.1016/j.ejor.2018.11.026zbMath1430.90128arXiv1705.10609OpenAlexW2963236200WikidataQ64454651 ScholiaQ64454651MaRDI QIDQ1711454
Maurizio Tomasella, Roberto Rossi, Christopher Walsh, Tim Embley, M. Harper Langston, Belén Martín-Barragán
Publication date: 18 January 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.10609
routingmixed-integer linear programmingconstructiondynamic bowser routing problemstochastic bowser routing problem
Related Items
Uses Software
Cites Work
- Unnamed Item
- Balancing bike sharing systems with constraint programming
- The exact solution of several classes of inventory-routing problems
- Competitive memetic algorithms for arc routing problems
- The vehicle routing problem. Latest advances and new challenges.
- Valid inequalities for mixed integer linear programs
- Using scenario trees and progressive hedging for stochastic inventory routing problems
- Stochastic vehicle routing
- Lot sizing and scheduling -- survey and extensions
- Piecewise linear lower and upper bounds for the standard normal first order loss function
- The inventory-routing problem with transshipment
- Large scale stochastic inventory routing problems with~split delivery and service level constraints
- Solving the aerial fleet refueling problem using group theoretic tabu search
- Handbook of stochastic models and analysis of manufacturing system operations
- Industrial aspects and literature survey: Combined inventory management and routing
- Dynamic Version of the Economic Lot Size Model
- The Truck Dispatching Problem
- A Hybrid Heuristic for an Inventory Routing Problem
- Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Introduction to Stochastic Programming
- Balancing the stations of a self service “bike hire” system
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- A Combined Vehicle Routing and Inventory Allocation Problem
- Inventory Routing
- What you should know about approximate dynamic programming
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- The Stochastic Inventory Routing Problem with Direct Deliveries
- An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem
- A Price-Directed Approach to Stochastic Inventory/Routing
- Production Planning by Mixed Integer Programming
