메뉴 건너뛰기




Volumn 130, Issue 6, 2004, Pages 805-813

Logit-based stochastic user equilibrium problem for entry-exit toll schemes

Author keywords

Algorithms; Equilibrium; Mathematical models; Network analysis; Pricing; Roads; Stochastic processes; Tolls

Indexed keywords

ALGORITHMS; COSTS; FEES AND CHARGES; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

EID: 10644251769     PISSN: 0733947X     EISSN: None     Source Type: Journal    
DOI: 10.1061/(ASCE)0733-947X(2004)130:6(805)     Document Type: Article
Times cited : (12)

References (33)
  • 1
    • 0030302511 scopus 로고    scopus 로고
    • "Cycle flows, Markov process, and stochastic traffic assignment"
    • Akamatsu, T. (1996). "Cycle flows, Markov process, and stochastic traffic assignment." Transp. Res., Part B: Methodols., 30(5), 365-386.
    • (1996) Transp. Res., Part B: Methodols. , vol.30 , Issue.5 , pp. 365-386
    • Akamatsu, T.1
  • 2
    • 0031269634 scopus 로고    scopus 로고
    • "Decomposition of path choices entropy in general transportation networks"
    • Akamatsu, T. (1997). "Decomposition of path choices entropy in general transportation networks." Transp. Sci. 31(4), 349-362.
    • (1997) Transp. Sci. , vol.31 , Issue.4 , pp. 349-362
    • Akamatsu, T.1
  • 3
    • 84890245567 scopus 로고
    • Nonlinear programming: Theory and algorithms
    • Wiley, New York
    • Bazaraa, M. S., Sherali, H. D., and Shetty, C. M. (1993). Nonlinear programming: Theory and algorithms, Wiley, New York.
    • (1993)
    • Bazaraa, M.S.1    Sherali, H.D.2    Shetty, C.M.3
  • 4
    • 0029515752 scopus 로고
    • "Alternatives to Dial's logit assignment algorithm"
    • Bell, M. G. H. (1995). "Alternatives to Dial's logit assignment algorithm." Transp. Res., Part B: Methodol., 29(4), 287-295.
    • (1995) Transp. Res., Part B: Methodol. , vol.29 , Issue.4 , pp. 287-295
    • Bell, M.G.H.1
  • 5
    • 0032190763 scopus 로고    scopus 로고
    • The path flow estimator as a network observer"
    • Bell, M. G. H., and Grosso, S. (1998). "The path flow estimator as a network observer." Traffic Eng. Control, 39(10), 540-549.
    • (1998) Traffic Eng. Control , vol.39 , Issue.10 , pp. 540-549
    • Bell, M.G.H.1    Grosso, S.2
  • 7
    • 0002065514 scopus 로고    scopus 로고
    • "Discrete choice methods and their applications to short term travel decisions"
    • R. W. Hall, ed., Kluwer, Dordrecht, The Netherlands
    • Ben-Akiva, M., and Bierlaire, M. (1999). "Discrete choice methods and their applications to short term travel decisions." Handbook of transportation science, R. W. Hall, ed., Kluwer, Dordrecht, The Netherlands.
    • (1999) Handbook of Transportation Science
    • Ben-Akiva, M.1    Bierlaire, M.2
  • 9
    • 0004220854 scopus 로고    scopus 로고
    • "Solving the nonadditive traffic equilibrium problem"
    • P. M. Pardalos, D. W. Hearn, and W. W. Hager, eds., Springer, New York
    • Bernstein, D., and Gabriel, G. (1997). "Solving the nonadditive traffic equilibrium problem." Network optimization, P. M. Pardalos, D. W. Hearn, and W. W. Hager, eds., Springer, New York, 72-102.
    • (1997) Network Optimization , pp. 72-102
    • Bernstein, D.1    Gabriel, G.2
  • 10
    • 10644260794 scopus 로고    scopus 로고
    • "Stochastic equilibrium traffic assignment with value-of-time distributed among users"
    • Cantarella, G. E., and Binetti, M. (1998). "Stochastic equilibrium traffic assignment with value-of-time distributed among users." Int. Trans. Oper. Res., 5(6), 541-553.
    • (1998) Int. Trans. Oper. Res. , vol.5 , Issue.6 , pp. 541-553
    • Cantarella, G.E.1    Binetti, M.2
  • 11
    • 0035900284 scopus 로고    scopus 로고
    • "A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs"
    • Chen, A., Lo, H. K., and Yang, H. (2001). "A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs." Eur. J. Oper. Res., 135(1), 27-41.
    • (2001) Eur. J. Oper. Res. , vol.135 , Issue.1 , pp. 27-41
    • Chen, A.1    Lo, H.K.2    Yang, H.3
  • 12
    • 0020168223 scopus 로고
    • "Unconstrained extremal formulation of some transportation equilibrium problems"
    • Daganzo, C. F. (1982). "Unconstrained extremal formulation of some transportation equilibrium problems." Transp. Sci., 16(3), 332-361.
    • (1982) Transp. Sci. , vol.16 , Issue.3 , pp. 332-361
    • Daganzo, C.F.1
  • 13
    • 0000328590 scopus 로고
    • "Exact local solution of the continuous network design problem via stochastic user equilibrium assignment"
    • Davis, G. A. (1994). "Exact local solution of the continuous network design problem via stochastic user equilibrium assignment." Transp. Res., Part 13: Methodol., 28(1), 61-75.
    • (1994) Transp. Res., Part 13: Methodol. , vol.28 , Issue.1 , pp. 61-75
    • Davis, G.A.1
  • 14
    • 0015078345 scopus 로고
    • "A probabilistic multipath traffic assignment mode which obviates the need for path enumeration"
    • Dial, G. A. (1971). "A probabilistic multipath traffic assignment mode which obviates the need for path enumeration." Transp. Res., 5(1), 83-111.
    • (1971) Transp. Res. , vol.5 , Issue.1 , pp. 83-111
    • Dial, G.A.1
  • 15
    • 0019229288 scopus 로고
    • "Some developments in equilibrium traffic assignment methodology"
    • Fisk, C. K. (1980). "Some developments in equilibrium traffic assignment methodology." Transp. Res., Part B: Methodol., 14(3), 243-256.
    • (1980) Transp. Res., Part B: Methodol. , vol.14 , Issue.3 , pp. 243-256
    • Fisk, C.K.1
  • 16
    • 77957094045 scopus 로고
    • "Network equilibrium models and algorithms"
    • M. Ball et al., eds., Elsevier, New York
    • Florian, M., and Hearn, D. (1995). "Network equilibrium models and algorithms." Handbooks in operations research, Vol. 8, M. Ball et al., eds., Elsevier, New York, 485-542.
    • (1995) Handbooks in Operations Research , vol.8 , pp. 485-542
    • Florian, M.1    Hearn, D.2
  • 17
    • 0031273029 scopus 로고    scopus 로고
    • "The traffic equilibrium problem with nonadditive path costs"
    • Gabriel, A., and Bernstein, D. (1997). "The traffic equilibrium problem with nonadditive path costs." Transp. Sci., 31(4), 337-349.
    • (1997) Transp. Sci. , vol.31 , Issue.4 , pp. 337-349
    • Gabriel, A.1    Bernstein, D.2
  • 18
    • 0004312786 scopus 로고    scopus 로고
    • "Nonadditive shortest paths: Sub-problems in multi-agent competitive network models"
    • Gabriel, A., and Bernstein, D. (2000). "Nonadditive shortest paths: Sub-problems in multi-agent competitive network models." Comput. Math.l Org. Theory, 6(1), 29-45.
    • (2000) Comput. Math.l Org. Theory , vol.6 , Issue.1 , pp. 29-45
    • Gabriel, A.1    Bernstein, D.2
  • 19
    • 0032131985 scopus 로고    scopus 로고
    • "A study on logit assignment which excludes all cycle flows"
    • Huang, H.-J., and Bell, M. G. H. (1998). "A study on logit assignment which excludes all cycle flows." Transp. Res., Part B: Methodol., 32(6), 401-412.
    • (1998) Transp. Res., Part B: Methodol. , vol.32 , Issue.6 , pp. 401-412
    • Huang, H.-J.1    Bell, M.G.H.2
  • 20
    • 0142248593 scopus 로고    scopus 로고
    • "On traffic equilibrium models with a nonlinear time/money relation"
    • M. Patriksson and M. Labbe, eds., Kluwer, Dordrecht, The Netherlands
    • Larsson, L., Lindberg, P. O., Lundgren, J., Patriksson, M., and Rydergren, C. (2002). "On traffic equilibrium models with a nonlinear time/money relation." Transportation planning-State of the art, M. Patriksson and M. Labbe, eds., Kluwer, Dordrecht, The Netherlands, 19-31.
    • (2002) Transportation Planning - State of the Art , pp. 19-31
    • Larsson, L.1    Lindberg, P.O.2    Lundgren, J.3    Patriksson, M.4    Rydergren, C.5
  • 21
    • 0034121259 scopus 로고    scopus 로고
    • "Traffic equilibrium problem with route-specific costs: Formulations and algorithms"
    • Lo, H. K., and Chen, A. (1999). "Traffic equilibrium problem with route-specific costs: Formulations and algorithms." Transp. Res., Part B: Methodol., 34(6), 493-513.
    • (1999) Transp. Res., Part B: Methodol. , vol.34 , Issue.6 , pp. 493-513
    • Lo, H.K.1    Chen, A.2
  • 22
    • 0004037768 scopus 로고
    • Urban travel demand modeling: From individual choice to general equilibrium
    • Wiley, New York
    • Oppenheim, N. (1994). Urban travel demand modeling: From individual choice to general equilibrium, Wiley, New York.
    • (1994)
    • Oppenheim, N.1
  • 23
    • 0003586775 scopus 로고
    • The traffic assignment problems: Models and methods
    • VSP, Utrecht, The Netherlands
    • Patriksson, M. (1994). The traffic assignment problems: Models and methods, VSP, Utrecht, The Netherlands.
    • (1994)
    • Patriksson, M.1
  • 24
    • 0020091589 scopus 로고
    • "The convergence of equilibrium algorithm with predetermined step size"
    • Powell, W., and Sheffi, Y. (1982). "The convergence of equilibrium algorithm with predetermined step size." Transp. Sci., 16(1), 45-55.
    • (1982) Transp. Sci. , vol.16 , Issue.1 , pp. 45-55
    • Powell, W.1    Sheffi, Y.2
  • 25
    • 0002456770 scopus 로고    scopus 로고
    • "Investigation of stochastic network loading procedures"
    • Transportation Research Board, Washington, D.C
    • Prashker, J. N., and Bekhor, S. (1998). "Investigation of stochastic network loading procedures." Transportation Research Record 1645, Transportation Research Board, Washington, D.C., 94-102.
    • (1998) Transportation Research Record 1645 , pp. 94-102
    • Prashker, J.N.1    Bekhor, S.2
  • 26
    • 0034432838 scopus 로고    scopus 로고
    • "Congestion, stochastic and similarity effects in stochastic user equilibrium models"
    • Transportation Research Board, Washington, D.C
    • Prashker, J. N., and Bekhor, S. (2000). "Congestion, stochastic and similarity effects in stochastic user equilibrium models." Transportation Research Record 1733, Transportation Research Board, Washington, D.C., 80-87.
    • (2000) Transportation Research Record 1733 , pp. 80-87
    • Prashker, J.N.1    Bekhor, S.2
  • 29
    • 0019392694 scopus 로고
    • "Selected node-pair analysis in Dial's assignment algorithm"
    • Van Vliet, D. (1981). "Selected node-pair analysis in Dial's assignment algorithm." Transp. Res., Part B: Methodol., 15(1 ), 65-68.
    • (1981) Transp. Res., Part B: Methodol. , vol.15 , Issue.1 , pp. 65-68
    • Van Vliet, D.1
  • 30
    • 0008435458 scopus 로고    scopus 로고
    • "The link nested logit model: Overcoming the route overlapping problem"
    • Transportation Research Board, Washington, D.C
    • Vovsha, P., and Bekhor, S. (1998). "The link nested logit model: Overcoming the route overlapping problem." Transportation Research Record, Transportation Research Board, Washington, D.C., 133-142.
    • (1998) Transportation Research Record , pp. 133-142
    • Vovsha, P.1    Bekhor, S.2
  • 31
    • 0035546324 scopus 로고    scopus 로고
    • "Modeling user adoption of advanced traveler information systems: Dynamic evolution and stationary equilibrium"
    • Yang, H., and Meng, Q. (2001). "Modeling user adoption of advanced traveler information systems: Dynamic evolution and stationary equilibrium." Transp. Res., Part A: Policy Pract., 35(10), 895-912.
    • (2001) Transp. Res., Part A: Policy Pract. , vol.35 , Issue.10 , pp. 895-912
    • Yang, H.1    Meng, Q.2
  • 32
    • 0035326953 scopus 로고    scopus 로고
    • "Simultaneous estimation of the origin-destination matrices and travel cost coefficient for congested networks in a stochastic equilibrium"
    • Yang, H., Meng, Q., and Bell, M. G. H. (2001). "Simultaneous estimation of the origin-destination matrices and travel cost coefficient for congested networks in a stochastic equilibrium." Transp. Sci., 35(2), 107-123.
    • (2001) Transp. Sci. , vol.35 , Issue.2 , pp. 107-123
    • Yang, H.1    Meng, Q.2    Bell, M.G.H.3
  • 33
    • 0346119997 scopus 로고    scopus 로고
    • "Modeling private highways in networks with entry-exit based toll charges"
    • Yang, H., Zhang, X., and Meng, Q. (2004). "Modeling private highways in networks with entry-exit based toll charges." Transp. Res., Part B: Methodol. 38(3), 191-213.
    • (2004) Transp. Res., Part B: Methodol. , vol.38 , Issue.3 , pp. 191-213
    • Yang, H.1    Zhang, X.2    Meng, Q.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.