An exact algorithm for the petrol station replenishment problem

Cornillier, Fabien; Boctor, Fayez F.; Laporte, Gilbert; Renaud, Jacques

doi:10.1057/palgrave.jors.2602374

Cited by 87 publications

(47 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The multi-compartment VRP allows the transport of different types of goods in separate compartments in the same vehicle. Applications of VRPs with multiple compartments can be found in the distribution of petrol (different types of petrol transported in one vehicle) (e.g., Brown and Graves 1981;Cornillier et al 2008a) and food (e.g., a refrigerated compartment and a regular compartment in one vehicle) (Chajakis and Guignard 2003), waste collection (Muyldermans and Pang 2010), on-farm milk collection (Dooley et al 2005) and ship scheduling (Fagerholt and Christiansen 2000a).…”

Section: Allocation Constraintsmentioning

confidence: 99%

“…They also develop an exact method that uses a branch-and-price algorithm, based on a set partitioning formulation, which can solve instances with up to 60 stations. The PSRP has been studied by Cornillier et al (2008aCornillier et al ( , b, 2009Cornillier et al ( , 2012. The aim of the PSRP is to optimize the delivery of several petroleum products to petrol stations.…”

Section: Multi-compartments Vrpmentioning

confidence: 99%

See 1 more Smart Citation

Vehicle routing problems with loading constraints: state-of-the-art and future directions

et al. 2014

View full text Add to dashboard Cite

Distributors are faced with loading constraints in their route planning, e.g.,multi-dimensional packing constraints, unloading sequence constraints, stability constraints and axle weight limits. Ignoring these constraints impairs planning and induces last-minute changes resulting in additional costs. Developing vehicle routing models incorporating loading constraints is critical to more efficient route planning. The last couple of years has seen a huge increase of contributions to this field of research with almost 60 % of these being published after 2009. Our contribution is twofold. First, we overview the recent developments in the literature on all vehicle types in which loading constraints play a key role (trucks, airplanes, ships, and automated guided vehicles), using a state-of-the-art classification scheme to identify the loading constraints considered in each article. Second, we identify research gaps and opportunities for future research.

show abstract

Section: Allocation Constraintsmentioning

confidence: 99%

Section: Multi-compartments Vrpmentioning

confidence: 99%

Vehicle routing problems with loading constraints: state-of-the-art and future directions

et al. 2014

View full text Add to dashboard Cite

show abstract

“…Cornillier et al [6] proposed two model formulations to solve the fuel replenishment problem, where these two models have totally different model's objectives and are solved sequentially. The first model is the SP problem which is used to select routes for all customers requiring a delivery.…”

Section: Related Literaturementioning

confidence: 99%

Optimization Approach for Multi-Period Fuel Replenishment

Charusakwong¹,

Lohatepanont²

2016

View full text Add to dashboard Cite

Abstract. This paper proposes mathematical models and solution approaches for solving the multi-period fuel replenishment planning problem. The model aims to search for a set of routes, determining the quantity of several petroleum products to be loaded on individual vehicle compartments, and specifying the quantity to be discharged to customer tanks over a given planning horizon in which multiple constraints are satisfied. The objective function is to minimize the transportation unit cost, equal to the total transportation cost divided by the sum of replenished quantity. As the model size grows exponentially when the number of customers, vehicles, and time period increases, an exact algorithm is not feasible. Hence, in this study, we propose two heuristic approaches: twophase method (2PM) and three-phase method (3PM). The 2PM is primarily designed for solving small problems whereas the 3PM adopts a similar approach but has the ability to solve larger problems. The proposed solutions were tested using a real-life scenario and randomly generated test instance. The results showed that our solution outperforms the solution constructed by experienced planners and also proved that considering multiple periods when devising the fuel replenishment plan, gives superior results in comparison to single periods.

show abstract

“…In its basic version, the land delivery problem, known as Petrol Station Replenishment Problem (PSRP) (see Cornillier et al 2008a) calls for the delivery of petroleum products to petrol stations by means of an heterogeneous fleet of compartmented tank vehicles. The objective is to maximize the total profit, which is given by the sales revenue minus the routing cost.…”

Section: Vehicle Routing Problems With Multi-compartment Loadingmentioning

confidence: 99%

“…• For the case where the deliveries of petrol products to the stations can be postponed or anticipated, Cornillier et al (2008a) gives a multi-phase heuristic algorithm, followed by two local search procedures. For each potential route, the loading problem is solved by a greedy heuristic followed by a simple improvement phase.…”

Section: Vehicle Routing Problems With Multi-compartment Loadingmentioning

confidence: 99%

Routing problems with loading constraints

Iori

Martello

2010

TOP

192

103

View full text Add to dashboard Cite

We consider difficult combinatorial optimization problems arising in transportation logistics when one is interested in optimizing both the routing of vehicles and the loading of goods into them. The separate problems (routing and loading) are already NP-hard, and very difficult to solve in practice. A fortiori their combination is extremely challenging and stimulating. Although the specific literature is still quite limited, a first attempt to a systematic view of this field can be useful both to academic researchers and to practitioners. We review vehicle routing problems with twoand three-dimensional loading constraints. Other combinations of routing and special loading constraints arising from industrial applications are also considered

show abstract

An exact algorithm for the petrol station replenishment problem

Cited by 87 publications

References 9 publications

Vehicle routing problems with loading constraints: state-of-the-art and future directions

Vehicle routing problems with loading constraints: state-of-the-art and future directions

Optimization Approach for Multi-Period Fuel Replenishment

Routing problems with loading constraints

Contact Info

Product

Resources

About