Order pairing strategies for the Petrol Station Replenishment Problem
A model to find new approaches for pairing orders in a multi–period vehicle routing problem with time windows
J.Y. Brandt (TU Delft - Civil Engineering & Geosciences)
Lóránt Tavasszy – Mentor
JHR Van Duin – Graduation committee member
Mark Duinkerken – Graduation committee member
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
This thesis explores the possibilities to improve order allocation for petrol delivery with the aim to lower the travel distances. In this research a simulation model has been designed that can test different order pairing strategies for fuel delivery to petrol stations. The Multi–Period Split Compartment Vehicle Routing Problem with Time Windows and Vehicle Restrictions (MP-SCVRPTWVR) used in the simulation is an extension to the petrol station replenishment problem. This optimization model could find optimal solutions for up to 20 stations. To test for larger cases, a heuristic has been proposed for the original model. This proved to have a significant impact on the amount of daily orders that could be handled, with an increase of 25 percent.