Parametric search and problem decomposition for approximating Pareto-optimal paths

Transportation Research Part B: Methodological

Volumn 46, Issue 8, 2012, Pages 1043-1067

  Xie, Chi ^a   Travis Waller, S ^b  

^a The University of Texas at Austin   (United States)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Biobjective shortest path; Constrained shortest path; Multiobjective problem decomposition; Parametric algorithm; Pareto optimal solution

Indexed keywords

BENCHMARKING; DECISION MAKING; GRAPH THEORY; OPTIMIZATION; PARAMETER ESTIMATION; PARETO PRINCIPLE; POLYNOMIAL APPROXIMATION; SUBROUTINES;

CONSTRAINED SHORTEST PATH; MULTI-OBJECTIVE PROBLEM; PARAMETRIC ALGORITHMS; PARETO OPTIMAL SOLUTIONS; SHORTEST PATH;

PROBLEM SOLVING;

ALGORITHM; BENCHMARKING; DECISION MAKING; DECOMPOSITION ANALYSIS; EFFICIENCY MEASUREMENT; LOGISTICS; MULTIOBJECTIVE PROGRAMMING; OPTIMIZATION; PARAMETERIZATION; PLANNING METHOD; STRATEGIC APPROACH; TRAVEL BEHAVIOR; TRAVEL TIME;

EID: 84865719274     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2012.03.005     Document Type: Article

References (65)

1. Aneja Y.P., Nair K.P.K. Bicriterion transportation problem. Management Science 1979, 25(1):73-78.
2. Aneja Y.P., Aggarwal V., Nair K.P.K. Shortest chain subject to side constraints. Networks 1983, 13(2):295-302.
3. Beasley J.E., Christofides N. An algorithm for the resource constrained shortest path problem. Networks 1989, 19(4):379-394.
4. Bellman R. Dynamic Programming 1957, Princeton University Press, Princeton, NJ.
5. Boffey B. Multiobjective routing problems. Top 1995, 3(2):167-220.
6. Bonzon P. Necessary and sufficient conditions for dynamic programming of combinatorial type. Journal of Association for Computing Machinery 1970, 17(4):675-682.
7. Brown T.A., Strauch R.E. Dynamic programming in multiplicative lattices. Journal of Mathematics and Applications 1965, 12(2):364-370.
8. Brumbaugh-Smith J., Shier D. An empirical investigation of some bicriterion shortest path algorithms. European Journal of Operational Research 1989, 43(2):216-224.
9. Carlyle W.M., Royset J.O., Wood R.K. Lagrangian relaxation and enumeration for solving constrained shortest-path problems. Networks 2008, 52(4):256-270.
10. Chang T.S., Nozick L.K., Turnquist M.A. Multiobjective path finding in stochastic dynamic networks with application to routing hazardous materials shipments. Transportation Science 2005, 39(3):383-399.
11. Cli{dotless}́maco J.C.N., Martins E.Q.V. A bicriterion shortest path algorithm. European Journal of Operational Research 1982, 11(4):399-404.
12. Cohon J.L. Multiobjective Programming and Planning 1978, Academic Press, New York, NY.
13. Corley H.W., Moon I.D. Shortest path in networks with vector weights. Journal of Optimization Theory and Applications 1985, 46(1):79-86.
14. Coutinho-Rodrigues J.M., Cli{dotless}́maco J.C.N., Current J.R. An interactive biobjective shortest path approach: searching for unsupported nondominated solutions. Computers and Operations Research 1999, 26(6):789-798.
15. Cox, R.G., 1984. Routing and Scheduling of Hazardous Materials Shipments: Algorithmic Approaches to Managing Spent Nuclear Fuel Transport. PhD thesis. School of Civil and Environmental Engineering, Cornell University, Ithaca, NY.
16. Current J.R., Min H. Multiobjective design of transportation networks: Taxonomy and annotations. European Journal of Operational Research 1986, 26(1):187-201.
17. Current J.R., Marsh M. Multiobjective transportation network design and routing problems: Taxonomy and annotation. European Journal of Operational Research 1993, 65(1):4-19.
18. Current J.R., ReVelle C.S., Cohon J.L. An interactive approach to identify the best compromise solution for two objective shortest path problems. Computers and Operations Research 1990, 17(2):187-198.
19. Daellenbach H.G., De Kluyver C.A. Note on multiple objective dynamic programming. Journal of the Operational Research Society 1980, 31(7):591-594.
20. Desrochers M., Soumis F. A generalized permanent labeling algorithm for the shortest path problem with time windows. Information Systems and Operational Research 1988, 26(3):193-214.
21. Desrosiers J., Dumas Y., Solomon M., Soumis F. Time constrained routing and scheduling. Network Routing 1995, vol. 8:35-139. North-Holland, Amsterdam. M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.).
22. Dumitrescu I., Boland N. Algorithms for the weight constrained shortest path problems. International Transaction in Operations Research 2001, 8(1):15-29.
23. Dumitrescu I., Boland N. Improved preprocessing labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 2003, 42(3):135-153.
24. Ehrgott M., Gandibleux X. A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum 2000, 22(4):425-460.
25. Ekrut, E., Tjandra, S.A., Verter, V., 2007. Hazardous materials transportation. In: Barnhart, C., Laporte, G., (Eds.), Transportation Handbooks in Operations Research and Management Science, vol. 14, Elsevier, Amsterdam, The Netherlands, pp. 539-621.
26. Fruhwirth B., Burkard R.E., Rote G. Approximation of convex curves with application to the bicriterial minimum cost flow problem. European Journal of Operational Research 1989, 42(3):326-338.
27. Garey M., Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness 1979, Freeman, San Francisco, CA.
28. Guerriero F., Musmanno R. Label correcting methods to solve multicriteria shortest path problems. Journal of Optimization Theory and Applications 2001, 111(3):589-613.
29. Handler G.Y., Zang I. A dual algorithm for the constrained shortest path problem. Networks 1980, 10(4):293-309.
30. Hansen P. Bicriterion path problems. Lecture Notes in Economics and Mathematics Systems 1979, vol. 17:109-127. Springer-Verlag, Heidelberg, Germany. G. Fandel, T. Gal (Eds.).
31. Hassin R. Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research 1992, 17(1):36-42.
32. Henig M.I. The shortest path problem with two objective functions. European Journal of Operational Research 1985, 25(2):281-291.
33. Ignizio J.P. Goal Programming and Extensions 1976, Lexington Books, Lanham, MD.
34. Jaffe J.M. Algorithms for finding paths with multiple constraints. Networks 1984, 14(1):95-116.
35. Jaumard, B., Semet, F., Vovor, T., 1996. A Two-Phase Resource Constrained Shortest Path Algorithm for Acyclic Graphs. Les Cahier du GERAD, G-96-48, Université de Montréal, Montréal, QC.
36. Lawler E.L. Combinatorial Optimization: Networks and Matroids 1976, Holt Rinehart and Winston, New York, NY.
37. Lorenz D.H., Raz D. A simple efficient approximation scheme for the restricted shortest path problem. Operations Research Letters 2001, 28(5):213-219.
38. Loui R. Optimal paths in graphs with stochastic or multidimensional weights. Communications of the Association for Computing Machinery 1983, 26(9):670-676.
39. Martins E.Q.V. On a multicriteria shortest path problem. European Journal of Operational Research 1984, 16(2):236-245.
40. Meng Q., Lee D.H., Cheu R.L. Multiobjective vehicle routing and scheduling problem with time window constraints in hazardous material transportation. Journal of Transportation Engineering 2009, 131(9):699-707.
41. Mote J., Murthy I., Olson D.L. A parametric approach to solving bicriterion shortest path problems. European Journal of Operational Research 1991, 53(1):81-92.
42. Nielsen L.R., Andersen K.A., Pretolani D. Bicriterion shortest hyperpaths in random time-dependent networks. Journal of Management Mathematics 2003, 14(3):271-303.
43. Nozick L.K., List G.F., Turnquist M.A. Integrated routing and scheduling in hazardous materials transportation. Transportation Science 1997, 31(3):200-215.
44. Opasanon S., Miller-Hooks E. Multicriteria adaptive paths in stochastic time-varying networks. European Journal of Operational Research 2006, 173(1):72-91.
45. özpeynirci ö., Köksalan M. An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs. Management Science 2010, 56(12):2302-2315.
46. Przybylski A., Gandibleux X., Ehrgott M. A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS Journal on Computing 2010, 22(3):371-386.
47. Przybylski A., Gandibleux X., Ehrgott M. A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Discrete Optimization 2010, 7(3):149-165.
48. Raith A., Ehrgott M. A comparison of solution strategies for biobjective shortest path problems. Computers and Operations Research 2009, 36(4):1299-1331.
49. Reeves D.S., Salama H.F. A distributed algorithm for delay-constrained unicast routing. IEEE/ACM Transactions on Networking 2000, 8(2):239-250.
50. Rennen G., van Dam E.R., den Hertog D. Enhancement of sandwich algorithms for approximating higher-dimensional convex Pareto sets. INFORMS Journal on Computing 2011, 23(4):493-517.
51. Ribeiro C., Minoux M. A heuristic approach to hard constrained shortest path problems. Discrete Applied Mathematics 1985, 10(2):125-137.
52. Robbins, J.C., 1983. Routing Hazardous Material Shipments. PhD thesis. Department of Geography, Indiana University, Bloomington, IN.
53. Sastry V.N., Janakiraman T.N., Mohideen S.I. New algorithms for multi-objective shortest path problem. Opsearch 2003, 40(4):278-298.
54. Serafini P. Some considerations about computational complexity for multi-objective combinatorial problems. Lecture Notes in Economics and Mathematical Systems 1986, vol. 294:222-232. Springer-Verlag, Berlin. J. Jahn, W. Krabs (Eds.).
55. Skriver A.J.V., Andersen K.A. A label correcting approach for solving bicriterion shortest-path problems. Computers and Operations Research 2000, 27(6):507-524.
56. Sun Q., Langendörfer H. A new distributed routing algorithm for supporting delay-sensitive applications. Computer Communications 1998, 21(6):572-578.
57. Tung T.C., Chew K.L. A bicriterion Pareto-optimal path algorithm. Asia-Pacific Journal of Operational Research 1988, 5(2):166-172.
58. Tung T.C., Chew K.L. A multicriteria Pareto-optimal path algorithm. European Journal of Operational Research 1992, 6(2):203-209.
59. Turnquist M.A. Routes schedules and risks in transporting hazardous materials. Strategic Planning in Energy and Natural Resources 1987, 289-302. Elsevier Science, Amsterdam, The Netherlands. B. Lev (Ed.).
60. Ulungu E.L., Teghem J. Multiobjective combinatorial optimization problems: a survey. Journal of Multi-Criteria Decision Analysis 1994, 3(2):83-104.
61. Vincke P. Problèmes multicritères. Cahiers du Centre D'Etudes de Recherche Opérationnelle 1974, 16:425-439.
62. Warburton A. Approximation of Pareto optima in multiple-objective shortest-path problems. Operations Research 1987, 35(1):70-79.
63. White D.J. The set of efficient solutions for multiple objective shortest path problems. Computers and Operations Research 1982, 9(2):101-107.
64. White D.J. A bibliography on the applications of mathematical programming multiple-objective methods. The Journal of the Operational Research Society 1990, 41(8):669-691.
65. Xiao Y., Thulasiraman K., Xue G., Jüttnet A. The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization. International Journal of Graphs and Combinatorics 2005, 2(2):63-86.