The Multi-period Petrol Station Replenishment Problem

Formulation and Solution Methods

Conference Paper (2020)
Author(s)

Luke Boers (Student TU Delft)

Bilge Atasoy (TU Delft - Mechanical Engineering)

G. Homem de Almeida Correia (Transport and Planning)

Rudy R. Negenborn (TU Delft - Mechanical Engineering)

Research Group
Transport Engineering and Logistics
DOI related publication
https://doi.org/10.1007/978-3-030-59747-4_39 Final published version
More Info
expand_more
Publication Year
2020
Language
English
Research Group
Transport Engineering and Logistics
Bibliographical Note
Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
Pages (from-to)
600-615
Publisher
Springer
ISBN (print)
978-3-030-59746-7
ISBN (electronic)
978-3-030-59747-4
Event
11th International Conference on Computational Logistics, ICCL 2020 (2020-09-28 - 2020-09-30), Enschede, Netherlands
Page Views
339
Collections
Institutional Repository
Reuse Rights

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

We present a “rich” Petrol Station Replenishment Problem (PSRP) with real-life characteristics that represents the complexities involved in actual operations. The planning is optimised over multiple days and therefore, the new variant can be classified as the Multi-Period Petrol Station Replenishment Problem (MP-PSRP). A Mixed Integer Linear Programming (MILP) formulation is developed and a decomposition heuristic is proposed as a solution algorithm, which is evaluated with a case study from a real-life petrol distributor in Denmark. To determine delivery quantities, the heuristic uses the newly introduced simultaneous dry run inventory policy. A procedure is applied to improve the initial solution. A commercial solver is able to find feasible solutions only for instances with up to 20 stations and 7 days for the MILP model where optimality is guaranteed for instances up to 10 stations and 5 days. The heuristic on the other hand provides feasible solutions for the full case study of 59 stations and 14 days, within a time limit of 2 h.

Files

Boers2020_Chapter_TheMulti_per... (pdf)
(pdf | 0.804 Mb)
- Embargo expired in 22-03-2021
License info not available