In this work 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 the C610 Systemwide Crossrail site, 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. To tackle deterministic variants, we introduce and contrast a bilinear programming model and a mixed-integer linear programming model. To tackle stochastic variants, by employing a new general purpose software library for stochastic modeling, we introduce a complete stochastic dynamic programming model as well as a novel heuristic we named "sample waning." We consider two stochastic variants of the problem in which asset locations or asset fuel consumptions are uncertain. We demonstrate the effectiveness of our approaches in the context of an extensive computational study designed around information and data collected at C610 Systemwide as well as supplied by our project partners.
The paper is concerned with the optimum routing of a fleet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal. The shortest routes between any two points in the system are given and a demand for one or several products is specified for a number of stations within the distribution system. It is desired to find a way to assign stations to trucks in such a manner that station demands are satisfied and total mileage covered by the fleet is a minimum A procedure based on a linear programming formulation is given for obtaining a near optimal solution. The calculations may be readily performed by hand or by an automatic digital computing machine. No practical applications of the method have been made as yet. A number of trial problems have been calculated, however.