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.