Dear users,
This is our new website
(we are launching the new one in order to improve our communication and provide better services to the editors and authors. So we will upload all data soon).
Please click here to visit our current website, and also to submit your paper:
www.ijsom.com
Thanks for your patience during relocation.
Feel free to contact us via info@ijsom.com and ijsom.info@gmail.com
|
|
|
|
|
|
Search published articles |
|
|
Showing 1 results for Al-Hinai
Chefi Triki, Nasr Al-Hinai, Islem Kaabachi, Saoussen Krichenc, Volume 3, Issue 2 (8-2016)
Abstract
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks over an extended planning horizon. The problem configuration is described through a set of trucks with several compartments each and a set of stations with demands and prefixed delivery frequencies. Given such input data, the minimization of the total distance is subject to assignment and routing constraints that express the capacity limitations of each truck\'s compartment in terms of the frequency and the pathways\' restrictions. In this paper, we develop and solve the full space mathematical formulation for the PPSRP with application to the Omani context. Our ultimate aim is to include such a model into an integrated framework having the objective of advising petroleum distribution companies on how to prepare bids in case of participation in combinatorial auctions of the transportation procurement.
|
|
|
|
|
|