Solution Methods for the Periodic Petrol Station Replenishment Problem | Zendy

Chefi Triki | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Solution Methods for the Periodic Petrol Station Replenishment Problem

Author(s) -

Chefi Triki

Publication year - 2013

Publication title -

the journal of engineering research [tjer]

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.123

H-Index - 9

eISSN - 1726-6742

pISSN - 1726-6009

DOI - 10.24200/tjer.vol10iss2pp69-77

Subject(s) - heuristics , heuristic , routing (electronic design automation) , time horizon , mathematical optimization , computer science , vehicle routing problem , operations research , engineering , mathematics , computer network

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research