A heuristic for the multi-period petrol station replenishment problem, Abstract 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… (More)
The petrol station replenishment problem with time windows, Abstract In the Petrol Station Replenishment Problem with Time Windows (PSRPTW) the aim is to optimize the delivery of several petroleum products to a set of petrol stations using a limited heterogeneous fleet of tank-trucks. More specifically, one must determine the quantity of each product to… (More)
We introduce a variable depth search branching, an extension to the local branching for solving Mixed-Integer Programs. Two strategies are assessed, a best improvement strategy and a first improvement strategy. The extensive computational assessment evidences a significant improvement over the local branching for both strategies.
1 Assigning trips to the vehicles of a given fleet is known as the trip packing problem. Generally, each trip has a known duration and the working time of vehicles is limited and the fleet is composed of a limited number of non identical vehicles. This paper considers a special version of this problem we met in petrol products transportation. In this… (More)