Solution methods for the periodic petrol station replenishment problem

C. Triki*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

14 Citations (Scopus)

Abstract

Abstract: In this paper we introduce the Periodic Petrol Station Replenishment Problem (PPSRP) over a T-day planning horizon and describe four heuristic methods for its solution. Even though all the proposed heuristics belong to the common partitioning-then-routing paradigm, they differ in assigning the stations to each day of the horizon. The resulting daily routing problems are then solved exactly until achieving optimalization. Moreover, an improvement procedure is also developed with the aim of ensuring a better quality solution. Our heuristics are tested and compared in two real-life cases, and our computational results show encouraging improvements with respect to a human planning solution.

Original languageEnglish
Pages (from-to)69-77
Number of pages9
JournalJournal of Engineering Research
Volume10
Issue number2
Publication statusPublished - 2013

Keywords

  • Periodic constraints
  • Petrol delivery
  • Vehicle routing problem

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Solution methods for the periodic petrol station replenishment problem'. Together they form a unique fingerprint.

Cite this