Bicriterion shortest path problem with a general nonadditive cost

Transportation Research Part B: Methodological

Volumn 57, Issue , 2013, Pages 419-435

  Chen, Peng ^a   Nie, Y ^a  

^a Northwestern University   (United States)

Author keywords

Bicriterion shortest path; Efficient path set; K shortest path; Nonadditive cost; Path enumeration

Indexed keywords

COST FUNCTIONS; COSTS; PIECEWISE LINEAR TECHNIQUES;

BICRITERION SHORTEST PATHS; EFFICIENT PATH; K SHORTEST PATH; NON-ADDITIVE; PATH ENUMERATION;

GRAPH THEORY;

ALGORITHM; COST; NONLINEARITY; OPTIMIZATION; TRANSPORTATION;

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

References (34)

1. Agdeppa R.P., Yamashita N., Fukushima M. The traffic equilibrium problem with nonadditive costs and its monotone mixed complementarity problem formulation. Transportation Research Part B 2007, 41(8):862-874.
2. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows: Theory, Algorithms, and Applications 1993, John Wiley & Sons.
3. Ando N., Taniguchi E. Travel time reliability in vehicle routing and scheduling with time windows. Network and Spatial Economics 2006, 6(3-4):293-311.
4. Bar-Gera H., Boyce D., Nie Y. User-equilibrium route flows and the condition of proportionality. Transportation Research Part A 2012, 46(3):440-462.
5. Carlyle W.M., Royset J.O., Kevin W.R. Lagrangian relaxation and enumeration for solving constrained shortest-path problems. Networks 2008, 52(4):256-270.
6. Chen A., Oh J.S., Park D., Recker W. Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs. Applied Mathematics and Computation 2010, 217(7):3020-3031.
7. Dial R.B. A model and algorithm for multicriteria route-model choice. Transportation Research Part B 1979, 13(4):311-316.
8. Dial R.B. Bicriterion traffic assignment: efficient algorithms plus examples. Transportation Research Part B 1997, 31(5):357-379.
9. Dial R.B., Glover F., Karney D., Klingman D. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks 1979, 9(3):215-248.
10. Eppstein D. Finding the K shortest paths. SIAM Journal on Computing 1998, 28(2):652-673.
11. Frank M., Wolfe P. An algorithm for quadratic programming. Naval Research Logistics Quarterly 1956, 3(1-2):95-110.
12. Gabriel S.A., Bernstein D. Network optimization. Lecture Notes in Economics and Mathematical Systems 1997, vol. 450:72-102. Springer-Verl., New York, Chapter: Solving the nonadditive traffic equilibrium problem.
13. Gabriel S.A., Bernstein D. The traffic equilibrium problem with nonadditive path costs. Transportation Science 1997, 31(4):337-348.
14. Gabriel, S.A., Bernstein, D., 1999. Nonadditive shortest paths. Technical Report, New Jersey TIDE Center.
15. Henderson J.V. Road congestion: a reconsideration of pricing theory. Journal of Urban Economics 1974, 1(3):346-355.
16. Hendrickson C., Kocur G. Schedule delay and departure time decisions in a deterministic model. Transportation Science 1981, 15(1):62-77.
17. Henig M.I. The shortest path problem with two objective functions. European Journal of Operational Research 1985, 25(2):281-291.
18. Hjorth K., Fosgerau M. Using prospect theory to investigate the low marginal value of travel time for small time changes. Transportation Research Part B 2012, 46(8):917-932.
19. Lawphongpanich S., Yin Y. Nonlinear pricing on transportation networks. Transportation Research Part C 2012, 20(1):218-235.
20. Leurent F. Cost versus time equilibrium over a network. European Journal of Operational Research 1993, 71(2):205-221.
21. Lo H.K., Chen A. Traffic equilibrium problem with route-specific costs: formulation and algorithms. Transportation Research Part B 2000, 34(6):493-513.
22. Marcotte P., Nguyen S., Tanguay K. Implementation of an efficient algorithm for the multiclass traffic assignment problem. Proceedings of the 13th International Symposium on Transportation and Traffic Theory 1996, 217-236. Pergamo, Lyon. J.-B. Lesort (Ed.).
23. Maruyama T., Sumalee A. Efficiency and equity comparison of cordon- and area-based road pricing schemes using a trip-chain equilibrium model. Transportation Research Part A 2007, 41(7):655-671.
24. Mirchandani P.B., Wiecek M.M. Routing with nonlinear multiattribute cost functions. Applied Mathematics and Computation 1993, 54(23):215-239.
25. Nie Y. A Programmer's Manual for Toolkit of Network Modeling (TNM) 2006, University of California, Davis.
26. Nie Y., Lee D.-H. An uncoupled method for the equilibrium-based linear path flow estimator for origin-destination trip matrices. Transportation Research Record 2002, 1783:72-79.
27. Nie Y., Wu X., Homem-de-Mello T. Optimal path problems with second-order stochastic dominance constraints. Networks and Spatial Economics 2012, 12(4):561-587.
28. Nie Y. Transaction costs and tradable mobility credits. Transportation Research Part B 2012, 46(1):189-203.
29. Small K.A. The scheduling of comsumer activities: work trips. The American Economic Review 1982, 72(3):467-479.
30. Tsaggouris G., Zaroliagis C. Non-additive shortest paths. Lecture Notes in Computer Science 2004, vol. 3221:822-834. Springer, Berlin/Heidelberg. S. Albers, T. Radzik (Eds.).
31. Vickrey W.S. Congestion theory and transport investment. The American Economic Review 1969, 59(2):251-261.
32. Yang H., Fung C.S., Wong K.I., Wong S.C. Nonlinear pricing of taxi services. Transportation Research Part A 2010, 44(5):337-348.
33. Yang H., Wang X. Managing network mobility with tradable credits. Transportation Research Part B 2011, 45(3):580-594.
34. Zhang C., Chen X., Sumalee A. Robust Wardrops user equilibrium assignment under stochastic demand and supply: expected residual minimization approach. Transportation Research Part B 2011, 45(3):534-552.