Print Email Facebook Twitter Order pairing strategies for the Petrol Station Replenishment Problem Title 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 Author Brandt, Jelmer (TU Delft Civil Engineering and Geosciences; TU Delft Transport and Planning) Contributor Tavasszy, Lorant (mentor) van Duin, Ron (graduation committee) Duinkerken, Mark (graduation committee) Degree granting institution Delft University of Technology Programme Transport, Infrastructure and Logistics Date 2017-07-14 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. Subject Petrol station replenishmenttime windowsFuel deliveryVehicle routing and schedulingVehicle restrictions To reference this document use: http://resolver.tudelft.nl/uuid:d77656e3-e451-4a11-84ce-9740be96759d Part of collection Student theses Document type master thesis Rights © 2017 Jelmer Brandt Files PDF Thesis_final_repo.pdf 2.95 MB Close viewer /islandora/object/uuid:d77656e3-e451-4a11-84ce-9740be96759d/datastream/OBJ/view