Solving a fuel delivery problem by heuristic and exact approaches

Abstract In this paper we study the case of a company that delivers different types of fuel to a set of fuel pumps. The company has one warehouse and supplies the pumps by a fleet of trucks with several tanks of differing capacities. The company’s aim is to satisfy the orders using the available resources (trucks and drivers) with the minimum total travel cost for delivery. The problem has been formulated as a Set Partitioning model, solved by a Branch-and-Price algorithm. A fast combinatorial heuristic was adopted both to find a good feasible solution very quickly and to provide an initial set of columns for the Branch-and-Price algorithm. Computational results are reported. The exact approach shows low computation time for the real instances provided by the company.

[1]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[2]  E. Lawler,et al.  Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1986 .

[3]  C. Rego,et al.  Using Tabu search for solving a dynamic multi-terminal truck dispatching problem , 1995 .

[4]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[5]  M. Salomon,et al.  Reconsidering the distribution structure of gasoline products for a large oil company , 1995 .

[6]  Gerald G. Brown,et al.  Real-Time Dispatch of Petroleum Tank Trucks , 1981 .

[7]  Gerald G. Brown,et al.  Real-Time, Wide Area Dispatch of Mobil Tank Trucks , 1987 .

[8]  D. Simchi-Levi.  New worst‐case results for the bin‐packing problem , 1994 .

[9]  Michel Gendreau,et al.  DYNAMIC VEHICLE ROUTING AND DISPATCHING , 1998 .

[10]  Gilbert Laporte,et al.  Routing problems: A bibliography , 1995, Ann. Oper. Res..

[11]  Ronald H. Ballou,et al.  Business logistics management : planning, organizing, and controlling the supply chain , 1999 .

[12]  Harvey M. Salkin,et al.  A set-partitioning-based exact algorithm for the vehicle routing problem , 1989, Networks.

[13]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[14]  R. Kraut,et al.  Vehicle scheduling in public transit and Lagrangean pricing , 1998 .

[15]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[16]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

[17]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .