Problem difficulty of real instances of convoy planning

Journal of the Operational Research Society

Volumn 56, Issue 7, 2005, Pages 763-775

  Tuson, A L ^a   Harrison, S A ^b  

^a CITY UNIVERSITY   (United Kingdom)

^b DEFENCE SCIENCE AND TECHNOLOGY LABORATORY   (United Kingdom)

Author keywords

Convoys; Heuristics; Military

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; OPERATIONS RESEARCH; PROBLEM SOLVING; STRATEGIC PLANNING;

CONVOYS; MILITARY; OPTIMIZATION MODELS;

MILITARY OPERATIONS;

EID: 20444467670     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601863     Document Type: Article

References (12)

1. West CL (1996). Combinatorial Algorithms for Military Applications (CALMA), DERA Report DRA/CIS(SE1)/608/08/07/ Final_1, DERA.
2. Chardaire P, McKeown GP, Harrison SA and Richardson SB. (1999). Solving a time-space formulation for the convoy movement problem. Opns Res, to appear.
3. Lee YN, McKeown GP and Rayward-Smith VJ (1996). The convoy movement problem with initial delays. In: Rayward-Smith VJ, Reeves C, Smith GD (eds). Modern Heuristic Search Methods. John Wiley: New York, pp 215-236.
4. Iakovou E, Douligeris C, Li H and Yudhbir L (1999). A maritime global route planning model for hazardous materials. Transp Sci 33(1): 34-48.
5. Chih K, Bodden MP, Hornung MA and Kernhauser AL (1990). Routing and inventory logistics system: a heuristic model for optimally managing intermodal double-stack trains. J Tramp Res Forum 31: 56-62.
6. Florian M, Bushell G and Ferland J (1976). The engine scheduling problem in a rail network. INFOR 14: 121-138.
7. Kwon OK, Martland CD and Sussman JM (1998). Routing and scheduling temporal and heterogeneous freightcar traffic on rail networks. Transp Res E Logist Transp Rev 34(2): 101-115.
8. Garey M and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman: New York.
9. Lee YN (1995). Sequential and parallel solutions of the convoy movement problem using branch-and-bound and heuristic hybrid techniques. PhD thesis, School of Information Systems, University of East Anglia, Norwich, UK.
10. Harrison SA (1998). A greedy heuristic for the convoy movement problem with initial delays. Symposium on Combinatorial Optimization: Recent Advances in Theory and Practice, Universite Libres de Bruxelles, Belgium, April 1998.
11. Cohen PR (1995). Empirical Methods for Artificial Intelligence. MIT Press: Cambridge, MA.
12. Ahuja RK, Magnanti TL and Orlin JB (1993). Network Flows: Theory, Algorithms, and Applications. Prentice-Hall: Englewood Cliffs, NJ.