Computational aspects of the optimal transit path problem

Journal of Industrial and Management Optimization

Volumn 4, Issue 1, 2008, Pages 95-105

  Caccetta, Louis ^a   Loosen, Ian ^a   Rehbock, Volker ^a  

^a CURTIN UNIVERSITY   (Australia)

Author keywords

Discretization; Optimal control; Optimisation; Transit path

Indexed keywords

EID: 56649107933     PISSN: 15475816     EISSN: 1553166X     Source Type: Journal    
DOI: 10.3934/jimo.2008.4.95     Document Type: Conference Paper

References (29)

1. R. L. Ahuja, J. L. Magnanti and J. B. Orlin, "Network Flows: Theory, Algorithms and Applications," Prentice-Hall, Englewood Cliff, New Jersey, 1993.
2. Y. P. Aneja, V. Aggarwal and K. P. K. Nair, Shortest chain subject to side constraints, Networks, 13 (1983), 295-302..
3. J. E. Beasley and N. Christofides, An algorithm for the resource constrained shortest path problem, Networks, 19 (1989), 379-394.
4. L. Caccetta, Branch and cut methods for mixed integer programming problems, Progess in Optimization II, Kluwer Publishers, Applied Optimization Series, 39 (2000), 21-44.
5. L. Caccetta, I. Loosen and V. Rehbock, Optimal transit path problem for submarines, Modelling Supplementary Volume of the DCDIS, Series B, Applications & Algorithms, (2005), 874-880.
6. W. M. Carlyle and R. K. Wood, Lagrangian relaxation and enumeration for solving constrained Shortest-Path problems, Proceedings of the 38th Annual ORSNZ Conference, University of Waikato, (2003), 3-12.
7. "CPLEX 6.0 User Manual," ILOG Inc., CPLEX Division, Incline Village, NV, USA, 1997.
8. M. Desrochers and F. Soumis, A generalized permanent labelling algorithm for the shortest path problem with time windows, INFOR, 26 (1988), 191-212.
9. E. W. Dijkstra, A note of two problems in connection with graphs, Numerische Mathematik, 1 (1959), 269-271.
10. I. Dumitrescu and N. Boland, Improved preprocessing, labeling and scaling algorithms for the weight constrained shortest path problem, Networks, 42 (2003), 135-153.
11. P. E. Gill, W. Murray, M. A. Saunders and M. H. Wright, User's guide for NPSOL (Version 4.0): A Fortran package for nonlinear programming, Report SOL 86-2, Department of Operations Research, Stanford University, 1986.
12. C. L. Hallam, "Hierarchical Path Generation: an Application to Submarine Transit Paths," Honours Dissertation, Murdoch University, Western Australia, 1997.
13. G. Handler and I. Zang, A dual algorithm for the constrained shortest path problem, Networks, 10 (1980), 293-310.
14. R. Hassin, Approximation schemes for the restricted shortest path problem, Mathematics of Operations Research, 17 (1992), 36-42.
15. P. Howlett, P. Pudney and B. Benjamin, Determination of optimal driving strategies for the control of a train, in "Computational Techniques and Applications: CTAC-91," Computational Mathematics Group, Australian Mathematical Society, (1991), 241-248.
16. B. Jaumard, F. Semet and T. Vovor, A two-phase resource constrained shortest path algorithm for acyclic graphs, Les Cahier du GERAD, (1996).
17. L. S. Jennings, M. E. Fisher, K. L. Teo and C. J. Goh, MISER3: solving optimal control problems - an update, Advanced Engineering Software, 13 (1991), 190-196.
18. L. S. Jennings, K. L. Teo, M. E. Fisher and C. J. Goh, MISER3 version 2, optimal control software, theory and user manual, http://cado.maths.uwa.edu.au/miser/manual.html, Department of Mathematics, University of Western Australia.
19. H. W. J. Lee, K. L. Teo, L. S. Jennings and V. Rehbock, Control parametrization enhancing technique for time optimal control problems, Dynamic Systems and Applications, 6 (1997), 243-262.
20. H. W. J. Lee, K. L. Teo, V. Rehbock and L. S. Jennings, Control parametrization enhancing technique for Discrete-Valued control problems, Automatica, 35 (1999), 1401-1407.
21. D. H. Lorenz and D. Raz, A simple efficient approximation scheme for the restricted shortest path problem, Operations Research Letters, 28 (2001), 213-219.
22. V. Rehbock, K. L. Teo, L. S. Jennings and H. W. J. Lee, A survey of the control parametrization and control parametrization enhancing methods for constrained optimal control problems, "Progress in Optimization: Contributions from Australia," Kluwer Academic Press, 247-275, 1999.
23. V. Rehbock, L. Caccetta, C. L. Hallam and R. O'Dowd, Optimal submarine transit paths through sonar fields, Research Report, Department of Mathematics and Statistics, Curtin University of Technology, Western Australia, 2000.
24. C. Ribeiro and M. Minoux, Solving hard constrained shortest path problems by Lagrangian relaxation and Branch-and-Bound algorithms, Methods of Operations Research, 53 (1986), 303-316.
25. K. Schittkowski, NLPQL: A Fortran subroutine for solving constrained nonlinear programming problems, Annals of Operations Research, 5 (1985/86), 485-500.
26. J. F. Shapiro, A survey of Lagrangian techniques for discrete optimization, Annals of Discrete Mathematics, 5 (1979), 113-138.
27. K. L. Teo, C. J. Goh and K. H. Wong, "A Unified Computational Approach to Optimal Control Problems," Pitman Monographs and Surveys in Pure and Applied Mathematics, 55, Longman Scientific and Technical, London, 1991.
28. J. Y. Yen, Finding the k-Shortest, loopless paths in a network, Management Science, 17 (1971), 711-715.
29. J. L. Zhou and A. L. Tits, A users guide for FFSQP version 3.5: A FORTRAN code for solving constrained nonlinear (Minimax) optimization problems, generating iterates satisfyin all inequality constraints, Institute for Systems Research, University of Maryland, 1995.