Optimisation techniques for planning the petrol replenishment to retail stations over a multi-period horizon

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The problem of planning the petrol station replenishment problem (PSRP) consists in making simultaneously several decisions, such as determining the minimum number of trucks required, assigning the stations to the available trucks, defining a feasible route for each tank-truck, etc. The objective to be achieved is usually defined as the minimisation of the travelled distance by the tank-trucks to serve all of the distribution stations. Traditional studies in the literature model and solve this problem over a time period of one single day. Only few works have recognised the fact that extending the time horizon to several days may yield important savings for the delivering company. The goal of this paper is to survey the optimisation techniques that support the petrol companies in improving their delivery performance over a multi-period planning horizon. We present the mathematical optimisation models that have been developed for both the t-day and periodic variants of the problem and discuss the heuristic methods so far developed for their solution.

Original languageEnglish
Pages (from-to)341-355
Number of pages15
JournalInternational Journal of Operational Research
Volume27
Issue number1-2
DOIs
Publication statusPublished - 2016

Fingerprint

Optimization techniques
Planning
Trucks
Replenishment
Retail
Optimization model
Savings
Heuristics
Time horizon
Delivery performance

Keywords

  • Inventory routing models
  • Multi-period planning
  • Petrol station replenishment
  • Routing of tank-trucks

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

@article{d822d5e15be644298b8b8959bf9f82de,
title = "Optimisation techniques for planning the petrol replenishment to retail stations over a multi-period horizon",
abstract = "The problem of planning the petrol station replenishment problem (PSRP) consists in making simultaneously several decisions, such as determining the minimum number of trucks required, assigning the stations to the available trucks, defining a feasible route for each tank-truck, etc. The objective to be achieved is usually defined as the minimisation of the travelled distance by the tank-trucks to serve all of the distribution stations. Traditional studies in the literature model and solve this problem over a time period of one single day. Only few works have recognised the fact that extending the time horizon to several days may yield important savings for the delivering company. The goal of this paper is to survey the optimisation techniques that support the petrol companies in improving their delivery performance over a multi-period planning horizon. We present the mathematical optimisation models that have been developed for both the t-day and periodic variants of the problem and discuss the heuristic methods so far developed for their solution.",
keywords = "Inventory routing models, Multi-period planning, Petrol station replenishment, Routing of tank-trucks",
author = "Chefi Triki and Nasr Al-Hinai",
year = "2016",
doi = "10.1504/IJOR.2016.078469",
language = "English",
volume = "27",
pages = "341--355",
journal = "International Journal of Operational Research",
issn = "1745-7645",
publisher = "Inderscience Enterprises Ltd",
number = "1-2",

}

TY - JOUR

T1 - Optimisation techniques for planning the petrol replenishment to retail stations over a multi-period horizon

AU - Triki, Chefi

AU - Al-Hinai, Nasr

PY - 2016

Y1 - 2016

N2 - The problem of planning the petrol station replenishment problem (PSRP) consists in making simultaneously several decisions, such as determining the minimum number of trucks required, assigning the stations to the available trucks, defining a feasible route for each tank-truck, etc. The objective to be achieved is usually defined as the minimisation of the travelled distance by the tank-trucks to serve all of the distribution stations. Traditional studies in the literature model and solve this problem over a time period of one single day. Only few works have recognised the fact that extending the time horizon to several days may yield important savings for the delivering company. The goal of this paper is to survey the optimisation techniques that support the petrol companies in improving their delivery performance over a multi-period planning horizon. We present the mathematical optimisation models that have been developed for both the t-day and periodic variants of the problem and discuss the heuristic methods so far developed for their solution.

AB - The problem of planning the petrol station replenishment problem (PSRP) consists in making simultaneously several decisions, such as determining the minimum number of trucks required, assigning the stations to the available trucks, defining a feasible route for each tank-truck, etc. The objective to be achieved is usually defined as the minimisation of the travelled distance by the tank-trucks to serve all of the distribution stations. Traditional studies in the literature model and solve this problem over a time period of one single day. Only few works have recognised the fact that extending the time horizon to several days may yield important savings for the delivering company. The goal of this paper is to survey the optimisation techniques that support the petrol companies in improving their delivery performance over a multi-period planning horizon. We present the mathematical optimisation models that have been developed for both the t-day and periodic variants of the problem and discuss the heuristic methods so far developed for their solution.

KW - Inventory routing models

KW - Multi-period planning

KW - Petrol station replenishment

KW - Routing of tank-trucks

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

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

U2 - 10.1504/IJOR.2016.078469

DO - 10.1504/IJOR.2016.078469

M3 - Article

AN - SCOPUS:84983607895

VL - 27

SP - 341

EP - 355

JO - International Journal of Operational Research

JF - International Journal of Operational Research

SN - 1745-7645

IS - 1-2

ER -