Counting the different efficient paths for transportation networks and its applications

Journal of Advanced Transportation

Volumn 39, Issue 2, 2005, Pages 193-220

  Meng, Qiang ^a   Lee, Der Horng ^a   Cheu, Ruey Long ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

P complete problem; Counting the simple path; Polynomial time algorithm; The efficient path; Traffic counting location problem

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING;

#P-COMPLETE PROBLEM; COUNTING THE SIMPLE PATH; POLYNOMIAL-TIME ALGORITHM; THE EFFICIENT PATH; TRAFFIC COUNTING LOCATION PROBLEM;

TRANSPORTATION ROUTES;

EID: 23844434088     PISSN: 01976729     EISSN: None     Source Type: Journal    
DOI: 10.1002/atr.5670390205     Document Type: Article

References (40)

1. Ahuja, R. K., Magnanti, T. L. and Orlin, J. B. 1993 Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, N. J.
2. Akamatsu, T. 1996 Cyclic flow, Markov process and stochastic traffic assignment. Transportation Research 30B:369-386.
3. Akamatsu, T. 1997 Decomposition of path choice entropy in general transport network. Transportation Science 31:349-362.
4. Bell, M. G. H. 1995 Alternatives to Dial's Logit Assignment Algorithm. Transportation Research 298:287-295.
5. Bell, M. G. H. and Iida, Y. 1997 Transport Network Analysis. John Wiley & Sons, New York
6. Ben-Akiva, M. and Boccara, B. 1995 Discrete Choice Models with Latent Choice Sets. International journal of Research in Marketing 12:9-24.
7. Berman, O., Krass, D. and Xu, C. W. 1995 Locating Discretionary Service Facilities Based on Probabilistic Customer Flows. Transportation Science 29: 276-290.
8. Berman, O., Larson, R. C. and Fouska, N. 1992 Optimal Location of Discretionary Service Facilities. Transportation Science 26:201-211.
9. Bianco, T, Confessore, G and Reverberi, P. 2001 A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates. Transportation Science 35: 50-60.
10. Cascetta, E., Nuzzolo, A., Russo, F. and Vitetta, A. 1996 A Modified Logit Route Choice model Overcoming Path Overlapping Problems, Specification and Some Calibration Results for Interurban Networks. Proceedings of the 13 International Symposium on Transportation and Traffic Theory, Pergamon, Oxford, New York, pp 697-711.
11. Ceylan, H. and Bell, m. G. H. 2004 Sensitivity Analysis on Stochastic Equilibrium Transportation Network Using Genetic Algorithm. Journal of Advanced Transportation 38: 291-321.
12. Chabini, I. 1997 Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time. Transportation Research Record 1645: 170-175.
13. Chootinan, P., Chen, A. and Yang, H. 2005 A Bi-objective Traffic Counting Location Problem for Origin-destination Trip Table Estimation. Transportmetrica 1:65:80.
14. Daskin, M. S. 1995 Network and Discrete Location: Models, Algorithms and Applications. John Wiley & Sons, Inc., New York.
15. Dial, R. B. 1971 A Probabilistic Multipath Assignment Model which Obviates Path Enumeration. Transportation Research 5:83-111.
16. Florian, M. and Chen, Y. 1995 A Coordinate Descent Method for the Bi-Level O-D Matrix Adjustment Problem. International Transaction in Operation Research, 2:165-179.
17. Floyd, R. W. 1962 Algorithm 97: Shortest Path. Communication of ACM, 5:345.
18. Garey, M. R. and Johnson, D. S. 1979 Computers and Intractability- A Guide to the Theory of NP-Completeness. W. H. Free many and Company, New York, NY.
19. Hodgson, M. J. 1990 A Flow-Capturing Location-Allocation Model. Geographical Analysis 22: 271-279.
20. Huang, H.-J. and Bell, M. G. H. 1998 A study on logit assignment which excludes all cyclic flows. Transportation Research 32B:401-412.
21. Lam, W. H. K., Gao, Z. Y. and Chan, K. S. A. 1999 Stochastic User Equilibrium Assignment model for Congested Transit Networks. Transportation Research, 33B: 356-381.
22. Lam, W. H. K., Zhou, J. and Sheng, Z. 2002 A Capacity Restraint Transit Assignment With Elastic Line Frequency. Transportation Research 36B:919-938.
23. Maher, M. 1998 Algorithm for Logit-based Stochastic User Equilibrium Assignment. Transportation Research 32B:539-549.
24. Meng, Q. Lee, D-H and Cheu, R. L. 2004 Logit-based Stochastic User Equilibrium Problem for Entry-exit Toll Schemes. Journal of Transportation Engineering 130:805-813.
25. Nguyen, S. and Dupuis, C. 1984 An Efficient Method for Computing Traffic Equilibria in Networks With Asymmetric Transportation Costs. Transportation Science 18: 185-202.
26. Papadimitriou, C. H. 1994 Computational Complexity. Addison-Wesley.
27. Patriksson, M. 1994 The Traffic Assignment Problems: Models and Methods. VSP, Utrecht, the Netherlands.
28. Ran, B. and Boyce, D. E. 1996 Modeling Dynamic Transportation Network: An Intelligent Transportation Systems Oriented Approach. Second Edition, Springer, New York.
29. Sheffi, Y. 1985 Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice Hall, Englewood Cliffs, N. J.
30. Tong, C. O. and Wong, S. C. 1999 A Stochastic Transit Assignment Model using a Dynamic Schedule-based Network. Transportation Research 33B: 107-121.
31. Valiant, L. 1979a The Complexity of Computing the Permanent. Theoretical Computer Science 8:189-201.
32. Valiant, L. 1979b The Complexity of Enumeration and Reliability Problems. SIAM Journal on Computing 8:410-420.
33. Van Vliet, D. 1981 Selected node-pair analysis in Dial's assignment algorithm. Transportation Research 15B: 65-68.
34. Warshall, S. 1962 A Theorem on Boolean Matrices. Journal of the ACM 9:11-12.
35. Welsh, D. J. A. 1993 Complexity: Knotes, Colouring and Counting. Cambridge University Press.
36. Wong, S. C. 1999 On the Convergence of Bell's Logit Assignment Formulation. Transportation Research 33B:609-616.
37. Yang, H. and Zhou, J. 1998 Optimal Traffic Counting Locations for Origin-Destination Matrix Estimation. Transportation Research 32B:109-126.
38. Yang, H., Iida, Y. and Sakasi, T. 1991 An Analysis of the Reliability of an Origin-Destination Trip Matrix Estimated From Traffic Counts. Transportation Research 25B: 351-363.
39. Yim, P. K. N. and Lam, W. H. K. 1998 Evaluation of Count Location Selection Methods for Estimation of O-D Matrices. Journal of Transportation Engineering 124:376-382.
40. Ziliaskopouos, A. K. and Mahmassani, H. S. 1993 A Time-Dependent Shortest Path Algorithm for Real-Time Intelligent Vehicle/Highway System. Transportation Research Record 1408: 94-104.