A heuristic approach to the multi-period multi-commodity transportation problem

This paper describes an approach to solving a real-world problem which involves the transportation of multiple types of commodities from a number of sources to a number of destinations in discrete time periods, using a capacitated heterogeneous fleet of vehicles. The preliminary objective is to minimize the total number of discrete periods needed to complete the entire operation. The problem is first formulated as a mixed integer programme and its tractability is then greatly improved by reformulating it through backward decomposition into two separate models and solved iteratively. A heuristic approach harnessing specific features of the second approach is developed for solving large size problems to obtain near-optimal solutions within reasonable time. The design of the heuristic also takes into consideration the secondary objectives of minimizing the total vehicle capacity used and minimizing the total capacity of sources needed to satisfy the demands at the destinations. Computational results are provided for a variety of randomly generated problems as well as problems from the literature. The approach described here may be applied to the multi-period transportation of personnel and goods from multiple starting points to multiple destinations in both military and civilian applications.

[1]  C. Barnhart.  Dual‐ascent methods for large‐scale multicommodity flow problems , 1993 .

[2]  Warren B. Powell,et al.  A COMPARATIVE REVIEW OF ALTERNATIVE ALGORITHMS FOR THE DYNAMIC VEHICLE ALLOCATION PROBLEM , 1988 .

[3]  Gilbert Laporte,et al.  Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[4]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[5]  Ian P. Gent.  Heuristic Solution of Open Bin Packing Problems , 1998, J. Heuristics.

[6]  Cynthia Barnhart,et al.  Integer Muticommodity Flow Problems , 1996, IPCO.

[7]  Pravin M. Vaidya,et al.  Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[8]  Panos M. Pardalos,et al.  Encyclopedia of Optimization , 2006 .

[9]  Horst W. Hamacher,et al.  Modeling of building evacuation problems by network flows with side constraints , 1988 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[12]  Richard D. McBride,et al.  Advances in Solving the Multicommodity-Flow Problem , 1998, Interfaces.

[13]  Antoon Kolen.  Complexity of location problems on networks , 1979 .

[14]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[15]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[16]  K. K. Nambiar,et al.  Foundations of Computer Science , 2001, Lecture Notes in Computer Science.

[17]  Michel Gendreau,et al.  Metaheuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[18]  Claire Mathieu,et al.  A Self Organizing Bin Packing Heuristic , 1999, ALENEX.

[19]  José M. Valério de Carvalho,et al.  Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..

[20]  Lisa Fleischer.  Faster algorithms for the quickest transshipment problem with zero transit times , 1998, SODA '98.

[21]  L. Cooper.  Location-Allocation Problems , 1963 .

[22]  Matteo Fischetti,et al.  A polyhedral approach to an integer multicommodity flow problem , 2000, Discret. Appl. Math..

[23]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[24]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

[25]  Éva Tardos,et al.  “The quickest transshipment problem” , 1995, SODA '95.

[26]  R. Love,et al.  Properties and Solution Methods for Large Location—Allocation Problems , 1982 .

[27]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[28]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[29]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[30]  Horst W. Hamacher,et al.  On the use of lexicographic min cost flows in evacuation modeling. , 1987 .

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

[32]  J. G. Klincewicz,et al.  Heuristics for the p-hub location problem , 1991 .

[33]  Michael T. Goodrich,et al.  Selected papers from the International Workshop on Algorithm Engineering and Experimentation , 1999 .

[34]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[35]  Éva Tardos,et al.  Polynomial time algorithms for some evacuation problems , 1994, SODA '94.

[36]  M. O'Kelly,et al.  A quadratic integer program for the location of interacting hub facilities , 1987 .

[37]  Richard L. Francis,et al.  Network models for building evacuation , 1982 .

[38]  T. Aykin.  On “a quadratic integer program for the location of interacting hub facilities” , 1990 .

[39]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[40]  Emanuel Falkenauer,et al.  A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems , 1994, Evolutionary Computation.

[41]  Said Salhi,et al.  Discrete Location Theory , 1991 .

[42]  Richard D. McBride,et al.  Progress Made in Solving the Multicommodity Flow Problem , 1998, SIAM J. Optim..

[43]  Marco E. Vink.  Solving Combinatorial Problems Using Evolutionary Algorithms , 1997 .

[44]  Graham K. Rand,et al.  Facilities Location: Models and Methods , 1989 .

[45]  Colin Reeves,et al.  Hybrid genetic algorithms for bin-packing and related problems , 1996, Ann. Oper. Res..

[46]  S. Sethi,et al.  The Dynamic Transportation Problem: A Survey , 1980 .

[47]  D. Skorin-Kapov,et al.  Tight linear programming relaxations of uncapacitated p-hub median problems , 1996 .

[48]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[49]  Éva Tardos,et al.  A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..

[50]  H. D. Ratliff,et al.  Note—Some Equivalent Objectives for Dynamic Network Flow Problems , 1982 .

[51]  Jay E. Aronson,et al.  A survey of dynamic network flows , 1989 .

[52]  Cynthia Barnhart,et al.  A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems , 1993, Transp. Sci..

[53]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[54]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[55]  R. Love,et al.  A computation procedure for the exact solution of location-allocation problems with rectangular distances , 1975 .

[56]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[57]  Jean-François Cordeau,et al.  VRP with Time Windows , 1999, The Vehicle Routing Problem.

[58]  Leon Cooper,et al.  The Transportation-Location Problem , 1972, Oper. Res..