Solving a time-space network formulation for the convoy movement problem

Operations Research

Volumn 53, Issue 2, 2005, Pages 219-230

  Chardaire, P ^a   McKeown, G P ^a   Verity Harrison, S A ^b   Richardson, S B ^c  

^a UNIVERSITY OF EAST ANGLIA   (United Kingdom)

^b DEFENCE SCIENCE AND TECHNOLOGY LABORATORY   (United Kingdom)

^c QINETIQ   (United Kingdom)

Author keywords

Military: Logistics; Programming: Integer, relaxation subgradient; Transportation: Vehicle routing

Indexed keywords

ALGORITHMS; DECISION MAKING; ELECTRIC NETWORK ANALYSIS; INTEGER PROGRAMMING; LAWS AND LEGISLATION; PLANNING; PROBLEM SOLVING;

CONVOY MOVEMENT PROBLEM; EN-ROUTE; TIME-SPACE NETWORK FORMULATION; TIME-SPACE NETWORKS;

ROUTERS;

EID: 18744395787     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1040.0183     Document Type: Review

References (45)

1. Castro, J., A. Frangioni. 2001. A parallel implementation of an interior-point algorithm for multicommodity network flows, J. M. Palma, J. Dongarra, V. Hernández, eds. Vector and Parallel Processing - VECPAR 2000, Lecture Notes in Computer Science, Vol. 1981. Springer Verlag, 301-315. An extended version previously appeared as Research Report DR 2000/06, Department of Statistics and Operations Research, Universitat Politècnica de Catalunya, 2000, Spain.
2. Castro, J., N. Nabona. 1996. An implementation of linear and nonlinear multicommodity network flows. Eur. J. Oper. Res. 92 37-53.
3. Chardaire, P., A. Lisser. 2002a. Minimum-cost multicommodity flow. P. M. Pardalos, M. G. C. Resende, eds. Handbook of Applied Optimization. Oxford University Press, Oxford, UK, 404-421.
4. Chardaire, P., A. Lisser. 2002b. Simplex and interior point specialized algorithms for solving nonoriented multicommodity flow problems. Oper. Res. 50 260-276.
5. Chardaire, P., G. P. McKeown, S. A. Harrison, S. B. Richardson. 2001. Convoy planning in a digitized battlespace. J. Defence Sci. 6 168-175.
6. Chih, K. C., M. P. Bodden, M. A. Hornung, A. L. Kornhauser. 1990. Routing and inventory logistics system: A heuristic model for optimally managing intermodal double-stack trains. J. Transportation Res. Forum 31 50-62.
7. Cordeau, J.-F., P. Toth, D. Vigo. 1998. A survey of optimization models for train routing and scheduling. Transportation Sci. 32(4) 380-404.
8. Cummings, N. 1999. How OR helped pacify Bosnia. OR Newsletter (Oper. Res. Soc.) 342 15-17.
9. Farvolden, J. M., W. B. Powell, I. J. Lustig. 1993. A primal partitioning solution for the arc-chain formulation of a multicommodity flow problem. Oper. Res. 41 669-693.
10. Florian, M., G. Bushell, J. Ferland. 1976. The engine scheduling problem in a rail network. INFOR 14 121-138.
11. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA.
12. Goffin, J. L. 1974. Validation of subgradient optimization. Math. Programming 6 62-88.
13. Goffin, J. L. 1977. On the convergence rates of subgradient optimization methods. Math. Programming 13 329-347.
14. Gu, Z., E. L. Johnson, G. L. Nemhauser, Y. Wang. 1994. Some properties of the fleet assignment problem. Oper. Res. Lett. 15 59-71.
15. Haghani, A. 1989. Formulation and solution of a combined train routing and makeup, and empty car distribution model. Transportation Res. B 23B(6) 433-452.
16. Haghani, A., S. C. Oh. 1996. Formulation and solution of a multi-commodity multi-modal network flow model for disaster relief operations. Transportation Res. A 30A(3) 231-250.
17. Held, M., R. M. Karp. 1970. The travelling salesman problem and minimum spanning trees. Oper. Res. 18 1138-1162.
18. Held, M., R. M. Karp. 1971. The travelling salesman problem and minimum spanning trees: Part II. Math. Programming 1 6-25.
19. Iakovou, E., C. Douligeris, H. Li, L. Yudhbir. 1999. A maritime global route planning model for hazardous materials. Transportation Sci. 33(1) 34-48.
20. Jarrah, A. I. Z., G. Yu, N. Krishnamurthy, A. Rakshit. 1993. A decision support framework for airline flight cancellations and delays. Transportation Sci. 27(3) 266-280.
21. Kennington, J. L. 1979. A primal partitioning code for solving multicommodity flow problems (Version 1). Technical report 79009, Department of Industrial Engineering and Operations Research, Southern Methodist University, Dallas, TX.
22. Kwon, O. K., C. D. Martland, J. M. Sussman. 1998. Routing and scheduling temporal and heterogeneous freightcar traffic on rail networks. Transportation Res., Part E: Logistics Transportation Rev. 34(2) 101-115.
23. Lee, Y. N. 1995. Sequential and parallel solutions of the convoy movement problem using branch-and-bound and heuristic hybrid techniques. Ph.D. thesis, School of Information Systems, University of East Anglia, Norwich, UK.
24. Lee, Y. N., G. P. McKeown, V. J. Rayward-Smith. 1994. Solving the convoy movement problem using branch-and-bound on a network of transputers. A. De Gloria, M. R. Jaue, D. Marini, eds. Transputer Applications Systems 94. IOS Press, Amsterdam, The Netherlands.
25. Lee, Y. N., G. P. McKeown, V. J. Rayward-Smith. 1996. The convoy movement problem with initial delays. V. J. Rayward-Smith, C. R. Reeves, G. D. Smith, eds. Modern Heuristic Search Methods. John Wiley, Chichester, UK, 215-236.
26. Lobel, A. 1998. Vehicle scheduling in public transit and Lagrangean pricing. Management Sci. 44(12) 1637-1649.
27. Marner, J., R. McBride. 2000. A decomposition-based pricing procedure for large-scale linear programs: An application to the linear multi-commodity flow problem. Management Sci. 46 693-709.
28. Martelli, A. 1976. An application of heuristic search methods to edge and contour detection. Comm. ACM 19 73-83.
29. Martelli, A. 1977. On the complexity of admissable search algorithms. Artificial Intelligence 8 1-13.
30. McBride, R. D. 1998. Progress made in solving the multicommodity flow problem. SIAM J. Optim. 8 947-955.
31. McBride, R., J. Mamer. 1997. Solving multicommodity flow problems with a primal embedded network simplex algorithm. INFORMS J. Comput. 9(2) 154-163.
32. McBride, R., J. Mamer. 2001. Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm. Networks 38 181-188.
33. McKeown, G. P., V. J. Rayward-Smith, H. J. Turpin. 1991. Branch-and-bound as a higher-order function. Ann. Oper. Res. 33 379-402.
34. Minieka, E. 1978. Optimization Algorithms for Networks and Graphs. Marcel Dekker, New York.
35. Minoux, M. 1986. Mathematical Programming Theory and Algorithms. John Wiley, Chichester, UK.
36. Newman, A., L. K. Nozick, C. A. Yano. 2002. Optimization in the rail industry. P. M. Pardalos, M. G. C. Resende, eds. Handbook of Applied Optimization. Oxford University Press, Oxford, UK, 704-718.
37. Nilsson, N. 1971. Problem-Solving Methods in Artificial Intelligence. McGraw-Hill, New York.
38. Nozick, L. K., G. F. List, M. A. Turnquist. 1997. Integrated routing and scheduling in hazardous materials transportation. Transportation Sci. 31(3) 200-215.
39. Oh, S. C., A. Haghani. 1997. Testing and evaluation of a multi-commodity multi-modal network flow model for disaster relief management. J. Advanced Transportation 31(3) 249-282.
40. Rayward-Smith, V. J., S. A. Rush, G. P. McKeown. 1993. Efficiency considerations in the implementation of parallel branch-and-bound. Ann. Oper. Res. 43 123-145.
41. Schrijver, A. 1986. Theory of Linear and Integer Programming. John Wiley, Chichester, UK.
42. Shor, N. Z. 1976. Generalizations of gradient methods for nonsmooth functions and their applications to mathematical programming. Econom. Math. Methods 12 337-356.
43. Thengvall, B. G., J. F. Bard, G. Yu. 2000. Balancing user preferences for aircraft schedule recovery during irregular operations. IIE Trans. 32 181-193.
44. van den Akker, J. M., C. A. J. Hurkens, M. W. P. Savelsbergh. 2000. Time-indexed formulations for machine scheduling problems: Column generation. INFORMS J. Comput. 12 111-124.
45. West, C. L. 1996. Combinatorial algorithms for military applications (CALMA), DERA Report DRA/CIS(SE1)/608/08/07/Final_. DERA, Malvern Technology Centre, Malvern, UK.