A page from the OpenDepot.org service

Jump to the start of the main contents

Cornillier, Fabien and Boctor, Fayez F. and Laporte, Gilbert and Renaud, Jacques (2008) A heuristic for the multi-period petrol station replenishment problem. European Journal of Operational Research, 191 (2). pp. 295-305. ISSN 03772217

[img] PDF - Accepted Version
Download (165Kb)


    In the Multi-Period Petrol Station Replenishment Problem (MPSRP) the aim is to optimize the delivery of several petroleum products to a set of petrol stations over a given planning horizon. One must determine, for each day of the planning horizon, how much of each product should be delivered to each station, how to load these products into vehicle compartments, and how to plan vehicle routes. The objective is to maximize the total profit equal to the revenue, minus the sum of routing costs and of regular and overtime costs. This article describes a heuristic for the MPSRP. It contains a route construction and truck loading procedures, a route packing procedure, and two procedures enabling the anticipation or the postponement of deliveries. The heuristic was extensively tested on randomly generated data and compared to a previously published algorithm. Computational results confirm the efficiency of the proposed methodology.

    Item Type: Article
    Uncontrolled Keywords: fleet management, fuel delivery, replenishment, routing and scheduling, heuristics, multi-period scheduling
    Subjects: Mathematical and Computer Sciences > Operational Research
    Divisions: UNSPECIFIED
    Depositing User: Fabien Cornillier
    Date Deposited: 22 Mar 2012 22:53
    Last Modified: 22 Mar 2012 23:31
    URI: http://opendepot.org/id/eprint/947

    Actions (login required)

    View Item