The Multi-period Petrol Station Replenishment Problem: Formulation and Solution Methods

Luke Boers; Bilge Atasoy; G. Homem de Almeida Correia; Rudy R. Negenborn

doi:10.1007/978-3-030-59747-4_39

The Multi-period Petrol Station Replenishment Problem: Formulation and Solution Methods

Luke Boers, Bilge Atasoy^*, G. Homem de Almeida Correia, Rudy R. Negenborn

^*Corresponding author for this work

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

5 Downloads (Pure)

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.

Original language	English
Title of host publication	Computational Logistics
Subtitle of host publication	Proceedings of the 11th International Conference, ICCL 2020
Editors	Eduardo Lalla-Ruiz, Martijn Mes, Stefan Voß
Place of Publication	Cham, Switzerland
Publisher	Springer
Pages	600-615
ISBN (Electronic)	978-3-030-59747-4
ISBN (Print)	978-3-030-59746-7
DOIs	https://doi.org/10.1007/978-3-030-59747-4_39
Publication status	Published - 2020
Event	11th International Conference on Computational Logistics, ICCL 2020 - Enschede, Netherlands Duration: 28 Sep 2020 → 30 Sep 2020

Publication series

Name	Lecture Notes in Computer Science
Volume	12433
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	11th International Conference on Computational Logistics, ICCL 2020
Country	Netherlands
City	Enschede
Period	28/09/20 → 30/09/20

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.

Keywords

Decomposition heuristic
Inventory routing
Petrol Station Replenishment
Simultaneous dry run inventory policy

Access to Document

10.1007/978-3-030-59747-4_39

Boers2020_Chapter_TheMulti-periodPetrolStationReFinal published version, 685 KB

Link to publication in Scopus

Cite this

Boers, L., Atasoy, B., Homem de Almeida Correia, G., & Negenborn, R. R. (2020). The Multi-period Petrol Station Replenishment Problem: Formulation and Solution Methods. In E. Lalla-Ruiz, M. Mes, & S. Voß (Eds.), Computational Logistics : Proceedings of the 11th International Conference, ICCL 2020 (pp. 600-615). (Lecture Notes in Computer Science; Vol. 12433 ). Springer. https://doi.org/10.1007/978-3-030-59747-4_39

Boers, Luke ; Atasoy, Bilge ; Homem de Almeida Correia, G. ; Negenborn, Rudy R. / The Multi-period Petrol Station Replenishment Problem : Formulation and Solution Methods. Computational Logistics : Proceedings of the 11th International Conference, ICCL 2020. editor / Eduardo Lalla-Ruiz ; Martijn Mes ; Stefan Voß. Cham, Switzerland : Springer, 2020. pp. 600-615 (Lecture Notes in Computer Science).

@inproceedings{fd50e9ca56d745608a90a95bda40eecd,

title = "The Multi-period Petrol Station Replenishment Problem: Formulation and Solution Methods",

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.",

keywords = "Decomposition heuristic, Inventory routing, Petrol Station Replenishment, Simultaneous dry run inventory policy",

author = "Luke Boers and Bilge Atasoy and {Homem de Almeida Correia}, G. and Negenborn, {Rudy R.}",

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.; 11th International Conference on Computational Logistics, ICCL 2020 ; Conference date: 28-09-2020 Through 30-09-2020",

year = "2020",

doi = "10.1007/978-3-030-59747-4_39",

language = "English",

isbn = "978-3-030-59746-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "600--615",

editor = "Eduardo Lalla-Ruiz and Martijn Mes and Stefan Vo{\ss}",

booktitle = "Computational Logistics",

}

Boers, L, Atasoy, B , Homem de Almeida Correia, G & Negenborn, RR 2020, The Multi-period Petrol Station Replenishment Problem: Formulation and Solution Methods. in E Lalla-Ruiz, M Mes & S Voß (eds), Computational Logistics : Proceedings of the 11th International Conference, ICCL 2020. Lecture Notes in Computer Science, vol. 12433 , Springer, Cham, Switzerland, pp. 600-615, 11th International Conference on Computational Logistics, ICCL 2020, Enschede, Netherlands, 28/09/20. https://doi.org/10.1007/978-3-030-59747-4_39

The Multi-period Petrol Station Replenishment Problem : Formulation and Solution Methods. / Boers, Luke; Atasoy, Bilge ; Homem de Almeida Correia, G.; Negenborn, Rudy R.

Computational Logistics : Proceedings of the 11th International Conference, ICCL 2020. ed. / Eduardo Lalla-Ruiz; Martijn Mes; Stefan Voß. Cham, Switzerland : Springer, 2020. p. 600-615 (Lecture Notes in Computer Science; Vol. 12433 ).

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

TY - GEN

T1 - The Multi-period Petrol Station Replenishment Problem

T2 - 11th International Conference on Computational Logistics, ICCL 2020

AU - Boers, Luke

AU - Atasoy, Bilge

AU - Homem de Almeida Correia, G.

AU - Negenborn, Rudy R.

N1 - 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.

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

KW - Decomposition heuristic

KW - Inventory routing

KW - Petrol Station Replenishment

KW - Simultaneous dry run inventory policy

UR - http://www.scopus.com/inward/record.url?scp=85092217933&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-59747-4_39

DO - 10.1007/978-3-030-59747-4_39

M3 - Conference contribution

SN - 978-3-030-59746-7

T3 - Lecture Notes in Computer Science

SP - 600

EP - 615

BT - Computational Logistics

A2 - Lalla-Ruiz, Eduardo

A2 - Mes, Martijn

A2 - Voß, Stefan

PB - Springer

CY - Cham, Switzerland

Y2 - 28 September 2020 through 30 September 2020

ER -

Boers L, Atasoy B , Homem de Almeida Correia G , Negenborn RR. The Multi-period Petrol Station Replenishment Problem: Formulation and Solution Methods. In Lalla-Ruiz E, Mes M, Voß S, editors, Computational Logistics : Proceedings of the 11th International Conference, ICCL 2020. Cham, Switzerland: Springer. 2020. p. 600-615. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-030-59747-4_39

The Multi-period Petrol Station Replenishment Problem: Formulation and Solution Methods

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Fingerprint

Cite this