Large Scale Petrol Station Replenishment Problem with Time Windows: A Real Case Study

Abstract

In this study we deal with a real case of the problem known as Petrol Station Replenishment Problem with Time Windows arising in Chile. The company involved is one of the biggest actors in the country, and every day must schedule a series of trips from their depots to their clients, delivering different kinds of fuel. This specific case has some differences from prior formulations of this problem (e.g. trucks works in shifts with hard time windows). Also, another challenge is the high number of orders and trucks involved in everyday planning. To solve this problem in reasonable computing times we propose a sequential insertion heuristic. Finally, we present results over a month of data.