Lagrangian relaxation and enumeration for solving constrained shortest-path problems

Networks

Volumn 52, Issue 4, 2008, Pages 256-270

  Carlyle, W Matthew ^a   Royset, Johannes O ^a   Wood, R Kevin ^a  

^a NAVAL POSTGRADUATE SCHOOL   (United States)

Author keywords

Constrained shortest paths; Label setting algorithm; Lagrangian relaxation; Near shortest paths; Path enumeration

Indexed keywords

AIRCRAFT ROUTING; CONSTRAINED SHORTEST PATHS; ENUMERATION METHODS; FEASIBLE SOLUTIONS; GRID NETWORKS; LAGRANGIAN FUNCTIONS; LAGRANGIAN RELAXATION; LAGRANGIAN RELAXATIONS; NEAR-SHORTEST PATHS; NEW ALGORITHMS; OPTIMAL SOLUTIONS; OPTIMALITY; PATH ENUMERATION; PATH PROBLEMS; PRE-PROCESSING; PREPROCESSING STEPS; ROAD NETWORKS; SHORTEST PATHS; SIDE CONSTRAINTS;

AGGLOMERATION; COMPUTER NETWORKS; GALLIUM ALLOYS; LABELS; LAGRANGE MULTIPLIERS; MOTOR TRANSPORTATION; ROUTING ALGORITHMS; SOLUTIONS;

ALGORITHMS;

EID: 56749161545     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20247     Document Type: Article

References (39)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms and applications, Prentice Hall, Englewood Cliffs, 1993, pp. 95-157, 598-648.
2. Y. Aneja, V. Aggarwal, and K. Nair, Shortest chain subject to side conditions, Networks 13 (1983), 295-302.
3. J. Beasley and N. Christofides, An algorithm for the resource constrained shortest path problem, Networks 19 (1989), 379-394.
4. D. Boerman, Finding an optimal path through a mapped minefield, Thesis, Naval Postgraduate School, Monterey, California, 1994.
5. W.M. Carlyle and R.K. Wood, Near-shortest and K-shortest simple paths, Networks 46 (2003), 98-109.
6. P.R. Day and D.M. Ryan, Flight attendant rostering for short-haul airline operations, Oper Res 45 (1997), 649-661.
7. H. De Neve and P. Van Mieghem, TAMCRA: A tunable accuracy multiple constraints routing algorithm, Comput Commun 23 (2000), 667-679.
8. M. Desrochers and F. Soumis, A generalized permanent labeling algorithm for the shortest path problem with time windows, Inform Sys and Oper Res 26 (1988), 191-212.
9. D. DeWolfe, J. Stevens, and K. Wood, Setting military reenlistment bonuses, Naval Res Logist 40 (1993), 143-160.
10. I. Dumitrescu and N. Boland, Improved preprocessing, labeling and scaling algorithm for the weight-constrained shortest path problem, Networks 42 (2003), 135-153.
11. M.L. Fisher, The Lagrangian relaxation method for solving integer programming problems, Management Sci 27 (1981), 1-18.
12. B.L. Fox and D.M. Landi, Searching for the multiplier in one-constraint optimization problems, Oper Res 18 (1970), 253-262.
13. M. Gamache, F. Soumis, M. Marquis, and J. Desrosiers, A column generation approach for large-scale aircrew rostering problems, Oper Res 47 (1999), 247-263.
14. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, 1979, p. 241.
15. E. Hadjiconstantinou and N. Christofides, An efficient implementation of an algorithm for finding K shortest simple paths, Networks 34 (1999), 88-101.
16. G. Handler and I. Zang, A dual algorithm for the constrained shortest path problem, Networks 10 (1980), 293-310.
17. J.M. Jaffe, Algorithms for finding paths with multiple constraints, Networks 14 (1984), 95-116.
18. H. Joksch, The shortest route problem with constraints, J Math Anal Appl 14(1966), 191-197.
19. A. Juttner, B. Szviatovszki, I. Mecs, and Z. Rajko, Lagrangian relaxation based method for the QoS routing problem, Proc IEEE INFOCOM 2001, Vol. 2, pp. 859-868.
20. D.E. Kaufman and R.L. Smith, Fastest paths in time-dependent networks for intelligent vehicle-highway applications, IVHS J 1 (1993), 1-11.
21. T. Korkmaz and M. Krunz, A randomized algorithm for finding a path subject to multiple QoS constraints, Comput Networks 36 (2001), 251-268.
22. T. Korkmaz and M. Krunz, Multi-constrained optimal path selection, Proc IEEE INFOCOM 2001, Vol. 2, pp. 834-843.
23. T. Korkmaz, M. Krunz, and S. Tragoudas, An efficient algorithm for finding a path subject to two additive constraints, Comput Commun 25 (2002), 225-238.
24. F. Kuipers, T. Korkmaz, M. Krunz, and P. Van Mieghem, Performance evaluation of constraint-based path selection algorithms, IEEE Network 18 (2004), 16-23.
25. J.L. Latourell, B.C. Wallet, and B. Copeland, Genetic algorithm to solve constrained routing problems with applications for cruise missile routing, Proc SPIE 1998, Vol. 3390, pp. 490-500.
26. S.H.K. Lee, Route optimization model for strike aircraft, Thesis, Naval Postgraduate School, Monterey, California, 1995.
27. Y. Li, J. Harms, and R. Holte, Fast exact multiconstraint shortest path algorithms, IEEE Int Conf Commun (2007), pp. 123-130.
28. G. Liu and K.G. Ramakrishnan, An algorithm for finding k-shortest paths subject to multiple constraints, Proc IEEE INFOCOM 2001, Vol. 2, pp. 743-749.
29. K. Nachtigall, Time depending shortest-path problems with applications to railway networks, Eur J Oper Res 83 (1995), 154-166.
30. R. Nygaard, G. Melnikov, and A.K. Katsaggelos, A rate distortion optimal ECG coding algorithm, IEEE Trans Biomedical Eng 48 (2001), 28-40.
31. U. Pape, Implementation and efficiency of Moore-algorithms for the shortest route problem, Math Prog 7 (1974), 212-222.
32. S. Russell and P. Norvig, Artificial intelligence: A modern approach, Prentice Hall, Upper Saddle River, 1995, pp. 92-107.
33. P.H. Vance, C. Barnhart, E.L. Johnson, and G.L. Nemhauser, Airline crew scheduling: A new formulation and decomposition algorithm, Oper Res 45 (1997), 188-200.
34. P. Van Mieghem, H. De Neve, and F.A. Kuipers, Hop-by-hop quality of service routing, Comput Networks 37 (2001), 407-423.
35. P. Van Mieghem and F.A. Kuipers, Concepts of exact QoS routing algorithms, IEEE/ACM Trans Network 12 (2004), 851-864.
36. P. Van Mieghem, F.A. Kuipers, T. Korkmaz, M. Krunz, M. Curado, E. Monteiro, X. Masip-Bruin, J. Sole-Pareta, and S. Sanchez-Lopez, "Quality of service routing," Quality of Future Internet Services, COST Action 263 Final Action Report, M. Smirnov, et al. (Editors), Lect Notes Comput Sci, Vol. 2856, Springer, Berlin, 2003, pp. 80-117.
37. L.A. Wolsey, Integer programming, Wiley, New York, 1998, pp. 172-173.
38. M. Zabarankin, S. Uryasev, and P. Pardalos, "Optimal risk path algorithms," Cooperative control and optimization, R. Murphey, P. Pardalos, (Editors), Kluwer, Dordrecht, Netherlands, 2001, pp. 273-299.
39. M. Ziegelmann, Constrained shortest paths and related problems, Naturwissenschaftlich-Technischen Fakultät der Universität des Saarlandes, Germany, 2001.