Cornillier, F and Boctor, F F and Laporte, G and Renaud, J (2008) An exact algorithm for the petrol station replenishment problem. Journal of the Operational Research Society, 59 (5). pp. 607-615. ISSN 0160-5682Full text not available from this repository.
In the petrol station replenishment problem (PSRP), the aim is to deliver petroleum products to petrol stations by means of an unlimited heterogeneous fleet of compartmented tank trucks. The problem consists of jointly determining quantities to deliver within a given interval, of allocating products to tank truck compartments and of designing delivery routes to stations. This article describes an exact algorithm which decomposes the PSRP into a truck loading problem and a routing problem. An algorithm which makes use of assignment, optimality tests and possibly standard ILP algorithm is proposed to solve the loading problem. The routing problem is handled using two different strategies, based either on a matching approach or on a column generation scheme. This algorithm was extensively tested on randomly generated data and on a real-life case arising in Eastern Quebec.
|Additional Information:||Full text PDF available for free at http://dx.doi.org/10.1057/palgrave.jors.2602374|
|Subjects:||Mathematical and Computer Sciences > Operational Research|
|Depositing User:||Fabien Cornillier|
|Date Deposited:||22 Mar 2012 22:29|
|Last Modified:||22 Mar 2012 23:29|
Actions (login required)