پديدآورندگان :
Triki Chefi chefi@squ.edu.om Department of Mechanical and Industrial Engineering,Sultan Qaboos University, Muscat, Oman , Al-Hinai Nasr Department of Mechanical and Industrial Engineering,Sultan Qaboos University, Muscat, Oman , Kaabachi Islem Department of Innovation for Engineering,University of Salento, Lecce, Italy , Krichen Saoussen LARODEC Laboratory, Institut Superieur de Gestion,University of Tunis, Tunisia
كليدواژه :
Vehicle routing, Petroleum station replenishment, Combinatorial auctions, Transportation procurement ,
چكيده فارسي :
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the deliveryof petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterizedby its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize thetotal travelled distance by the available trucks over an extended planning horizon. The problem configuration isdescribed through a set of trucks with several compartments each and a set of stations with demands and prefixeddelivery frequencies. Given such input data, the minimization of the total distance is subject to assignment androuting constraints that express the capacity limitations of each truck s compartment in terms of the frequency andthe pathways restrictions. In this paper, we develop and solve the full space mathematical formulation for thePPSRP with application to the Omani context. Our ultimate aim is to include such a model into an integratedframework having the objective of advising petroleum distribution companies on how to prepare bids in case ofparticipation in combinatorial auctions of the transportation procurement.
