Solving a Time-Space Network Formulation for the Convoy Movement Problem

We give a formal specification for a strategic network routing problem known as the convoy movement problem (CMP) and establish that the corresponding feasibility problem is NP-complete. We then introduce an integer programming (IP) model based on the concept of a time-space network and apply a Lagrangian relaxation to this model. We discuss how the dual function may be evaluated using a modified version of Dijkstra's algorithm suitable to very large, implicitly defined graphs and show how heuristic solutions to the primal problem may be obtained. We present results for a number of instances of the CMP, most of which are based on real-world problems. The number of convoys in these instances varies between 15--25, and their movement time requires up to several thousand time units in networks ranging in size from a few dozen to several thousand vertices and edges. The most difficult instance tested involves 17 long convoys each taking four times the average link travel time to pass through a point in the network. This instance is solved within 3.3% of optimality in less than 3.5 hours of computing time on a Dell Precision 420 dual processor computer. Every other test instance is solved within 2% of the optimal value in less than 20 minutes of computing time.

[1]  George L. Nemhauser,et al.  Some properties of the fleet assignment problem , 1994, Oper. Res. Lett..

[2]  Alberto Martelli,et al.  An application of heuristic search methods to edge and contour detection , 1976, CACM.

[3]  Victor J. Rayward-Smith,et al.  Modern Heuristic Search Methods , 1996 .

[4]  Ahmad I. Jarrah,et al.  A Decision Support Framework for Airline Flight Cancellations and Delays , 1993, Transp. Sci..

[5]  Victor J. Rayward-Smith,et al.  Efficiency considerations in the implementation of parallel branch-and-bound , 1993, Ann. Oper. Res..

[6]  John W. Mamer,et al.  Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm , 1997, INFORMS J. Comput..

[7]  James Evans,et al.  Optimization algorithms for networks and graphs , 1992 .

[8]  Michael Florian,et al.  The engine scheduling problem in a railway network , 1976 .

[9]  S.-C. Oh,et al.  Testing and evaluation of a multi‐commodity multi‐modal network flow model for disaster relief management , 1997 .

[10]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[11]  J. Castro,et al.  An implementation of linear and nonlinear multicommodity network flows , 1996 .

[12]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

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

[14]  Jean-Louis Goffin,et al.  On convergence rates of subgradient optimization methods , 1977, Math. Program..

[15]  Warren B. Powell,et al.  A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem , 1993, Oper. Res..

[16]  Alberto Martelli,et al.  On the Complexity of Admissible Search Algorithms , 1977, Artif. Intell..

[17]  Jonathan F. Bard,et al.  Balancing user preferences for aircraft schedule recovery during irregular operations , 2000 .

[18]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..

[19]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[20]  J. Mamer,et al.  A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem , 2000 .

[21]  Mark A. Turnquist,et al.  Integrated Routing and Scheduling in Hazardous Materials Transportation , 1997, Transp. Sci..

[22]  Antonio Frangioni,et al.  Computational Experience with a Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows , 1999, System Modelling and Optimization.

[23]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[24]  S. A. Harrison.  Convoy Planning in a Digitized Battlespace , 2001 .

[25]  Abdel Lisser,et al.  Minimum-Cost Multicommodity Flow , 2002 .

[26]  Alain L. Kornhauser,et al.  ROUTING AND INVENTORY LOGISTICS SYSTEM (RAILS): A HEURISTIC MODEL FOR OPTIMALLY MANAGING INTERMODAL DOUBLE-STACK TRAINS , 1990 .

[27]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[28]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

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

[30]  Ali E. Haghani,et al.  Formulation and solution of a combined train routing and makeup, and empty car distribution model , 1989 .

[31]  John W. Mamer,et al.  Solving the undirected multicommodity flow problem using a shortest path‐based pricing algorithm , 2001, Networks.

[32]  Joseph M. Sussman,et al.  Routing and scheduling temporal and heterogeneous freight car traffic on rail networks , 1998 .

[33]  A Haghani,et al.  FORMULATION AND SOLUTION OF A MULTI-COMMODITY, MULTI-MODAL NETWORK FLOW MODEL FOR DISASTER , 1996 .

[34]  Paolo Toth,et al.  A Survey of Optimization Models for Train Routing and Scheduling , 1998, Transp. Sci..

[35]  Victor J. Rayward-Smith,et al.  Branch-and-bound as a higher-order function , 1991, Ann. Oper. Res..

[36]  Michel Minoux,et al.  Mathematical Programming , 1986 .

[37]  Huan Li,et al.  A Maritime Global Route Planning Model for Hazardous Materials Transportation , 1999, Transp. Sci..

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

[39]  Abdel Lisser,et al.  Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems , 2002, Oper. Res..

[40]  Ali Haghani,et al.  Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations , 1996 .