The dynamic bowser routing problem
From MaRDI portal
Abstract: We investigate opportunities offered by telematics and analytics to enable better informed, and more integrated, collaborative management decisions on construction sites. We focus on efficient refuelling of assets across construction sites. More specifically, we develop decision support models that, by leveraging data supplied by different assets, schedule refuelling operations by minimising the distance travelled by the bowser truck as well as fuel shortages. Motivated by a practical case study elicited in the context of a project we recently conducted at Crossrail, we introduce the Dynamic Bowser Routing Problem. In this problem the decision maker aims to dynamically refuel, by dispatching a bowser truck, a set of assets which consume fuel and whose location changes over time; the goal is to ensure that assets do not run out of fuel and that the bowser covers the minimum possible distance. We investigate deterministic and stochastic variants of this problem and introduce effective and scalable mathematical programming models to tackle these cases. We demonstrate the effectiveness of our approaches in the context of an extensive computational study designed around data collected on site as well as supplied by our project partners. Keywords: Routing; Dynamic Bowser Routing Problem; Stochastic Bowser Routing Problem; Mixed-Integer Linear Programming; Construction.
Recommendations
- Routing of displacements with dynamic constraints: ``bottleneck problem
- On a bottleneck routing problem
- scientific article; zbMATH DE number 30302
- Dynamic programming in a nonstationary route problem
- Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
- On dynamic shortest paths problems
- Algorithms – ESA 2004
- A solvable routing problem
- Dynamic Location-routeing Problems
- ON A ROUTING PROBLEM
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- A Combined Vehicle Routing and Inventory Allocation Problem
- A Price-Directed Approach to Stochastic Inventory/Routing
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- A hybrid heuristic for an inventory routing problem
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- An extended mixed-integer programming formulation and dynamic cut generation approach for the stochastic lot-sizing problem
- Balancing bike sharing systems with constraint programming
- Balancing the stations of a self service ``bike hire system
- Competitive memetic algorithms for arc routing problems
- Dynamic version of the economic lot size model
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Handbook of stochastic models and analysis of manufacturing system operations
- Industrial aspects and literature survey: Combined inventory management and routing
- Introduction to stochastic programming.
- Inventory routing
- Large scale stochastic inventory routing problems with~split delivery and service level constraints
- Lot sizing and scheduling -- survey and extensions
- Piecewise linear lower and upper bounds for the standard normal first order loss function
- Production Planning by Mixed Integer Programming
- Scenario tree-based heuristics for stochastic inventory-routing problems
- Solving the aerial fleet refueling problem using group theoretic tabu search
- Stochastic vehicle routing
- The Stochastic Inventory Routing Problem with Direct Deliveries
- The exact solution of several classes of inventory-routing problems
- The inventory-routing problem with transshipment
- The truck dispatching problem
- The vehicle routing problem. Latest advances and new challenges.
- Using scenario trees and progressive hedging for stochastic inventory routing problems
- Valid inequalities for mixed integer linear programs
- What you should know about approximate dynamic programming
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
This page was built for publication: The dynamic bowser routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1711454)
