:: Volume 3, Issue 2 (8-2016) ::
2016, 3(2): 1318-1331 Back to browse issues page
An Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions
Chefi Triki * 1, Nasr Al-Hinai2 , Islem Kaabachi3 , Saoussen Krichenc3
1- Department of Mechanical and Industrial Engineering,Sultan Qaboos University, Muscat, Oman , chefi@squ.edu.om
2- Department of Mechanical and Industrial Engineering,Sultan Qaboos University, Muscat, Oman
3- LARODEC Laboratory, Institut Superieur de Gestion, University of Tunis, Tunisia
Abstract:   (3607 Views)
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.
Keywords: Vehicle routing, Petroleum station replenishment, Combinatorial auctions, Transportation procurement
     

ePublished: 2017/09/28


XML     Print



Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 3, Issue 2 (8-2016) Back to browse issues page