Optimization Online


Solution Methods for the Periodic Petrol Station Replenishment Problem

Chefi Triki(chefi***at***squ.edu.om)

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

Keywords: petrol delivery; periodic constraints; vehicle routing problem

Category 1: Applications -- OR and Management Sciences (Supply Chain Management )

Citation: Working Paper December 2012

Download: [PDF]

Entry Submitted: 03/11/2013
Entry Accepted: 03/11/2013
Entry Last Modified: 03/11/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society