메뉴 건너뛰기




Volumn 59, Issue , 2015, Pages 19-31

A hyperpath-based network generalized extreme-value model for route choice under uncertainties

Author keywords

Hyperpath; Network GEV model; Route choice; Uncertainties

Indexed keywords

RANDOM PROCESSES; TRAFFIC CONTROL; TRANSPORTATION ROUTES; TRAVEL TIME;

EID: 84942984397     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2015.05.015     Document Type: Article
Times cited : (18)

References (44)
  • 1
    • 0030302511 scopus 로고    scopus 로고
    • Cyclic flows, Markov process and stochastic traffic assignment
    • Akamatsu T. Cyclic flows, Markov process and stochastic traffic assignment. Transport. Res. Part B 1996, 30(5):369-386.
    • (1996) Transport. Res. Part B , vol.30 , Issue.5 , pp. 369-386
    • Akamatsu, T.1
  • 2
    • 0036870587 scopus 로고    scopus 로고
    • Origin-based algorithm for the traffic assignment problem
    • Bar-Gera H. Origin-based algorithm for the traffic assignment problem. Transport. Sci. 2002, 36:398-417.
    • (2002) Transport. Sci. , vol.36 , pp. 398-417
    • Bar-Gera, H.1
  • 3
    • 0029515752 scopus 로고
    • Alternatives to Dial's logit assignment algorithm
    • Bell M.G.H. Alternatives to Dial's logit assignment algorithm. Transport. Res. Part B 1995, 29B(4):287-295.
    • (1995) Transport. Res. Part B , vol.29B , Issue.4 , pp. 287-295
    • Bell, M.G.H.1
  • 4
    • 55049094635 scopus 로고    scopus 로고
    • Hyperstar: a multi-path Astar algorithm for risk-averse vehicle navigation
    • Bell M.G.H. Hyperstar: a multi-path Astar algorithm for risk-averse vehicle navigation. Transport. Res. Part B: Methodol. 2009, 43:97-107.
    • (2009) Transport. Res. Part B: Methodol. , vol.43 , pp. 97-107
    • Bell, M.G.H.1
  • 6
    • 0002065514 scopus 로고    scopus 로고
    • Discrete choice methods and their applications to short-term travel decisions
    • Kluwer, R. Hall (Ed.)
    • Ben-Akiva M.E., Bierlaire M. Discrete choice methods and their applications to short-term travel decisions. Handbook of Transportation Science 1999, 5-34. Kluwer. R. Hall (Ed.).
    • (1999) Handbook of Transportation Science , pp. 5-34
    • Ben-Akiva, M.E.1    Bierlaire, M.2
  • 10
    • 57149114540 scopus 로고    scopus 로고
    • On modelling route sets in transportation networks: a synthesis
    • Bovy P. On modelling route sets in transportation networks: a synthesis. Transport. Rev. 2009, 29:43-68.
    • (2009) Transport. Rev. , vol.29 , pp. 43-68
    • Bovy, P.1
  • 11
    • 0035427714 scopus 로고    scopus 로고
    • Random utility models with implicit availability perception of choice travel for the simulation of travel demand
    • Cascetta E., Papola A. Random utility models with implicit availability perception of choice travel for the simulation of travel demand. Transport. Res. Part C 2001, 9(4):249-263.
    • (2001) Transport. Res. Part C , vol.9 , Issue.4 , pp. 249-263
    • Cascetta, E.1    Papola, A.2
  • 12
    • 84862197945 scopus 로고    scopus 로고
    • Regret theory based route choices and traffic equilibria
    • Chorus C.G. Regret theory based route choices and traffic equilibria. Transportmetrica 2012, 8(4):291-305.
    • (2012) Transportmetrica , vol.8 , Issue.4 , pp. 291-305
    • Chorus, C.G.1
  • 14
    • 0017525664 scopus 로고
    • On stochastic models of traffic assignment
    • Daganzo C.F., Sheffi Y. On stochastic models of traffic assignment. Transport. Sci. 1977, 11(3):253-274.
    • (1977) Transport. Sci. , vol.11 , Issue.3 , pp. 253-274
    • Daganzo, C.F.1    Sheffi, Y.2
  • 15
    • 29844454839 scopus 로고    scopus 로고
    • A general and operational representation of generalised extreme value models
    • Daly A., Bierlaire M. A general and operational representation of generalised extreme value models. Transport. Res. Part B 2006, 40:285-305.
    • (2006) Transport. Res. Part B , vol.40 , pp. 285-305
    • Daly, A.1    Bierlaire, M.2
  • 17
    • 0015078345 scopus 로고
    • A probabilistic multipath traffic assignment model which obviates path enumeration
    • Dial R.B. A probabilistic multipath traffic assignment model which obviates path enumeration. Transport. Res. 1971, 5:83-111.
    • (1971) Transport. Res. , vol.5 , pp. 83-111
    • Dial, R.B.1
  • 18
    • 33745865164 scopus 로고    scopus 로고
    • A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration
    • Dial R.B. A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transport. Res. Part B: Methodol. 2006, 40(10):917-936.
    • (2006) Transport. Res. Part B: Methodol. , vol.40 , Issue.10 , pp. 917-936
    • Dial, R.B.1
  • 19
    • 0032108018 scopus 로고    scopus 로고
    • Finding the K shortest paths
    • Eppstein D. Finding the K shortest paths. SIAM J. Comput. 1998, 28(2):652-673.
    • (1998) SIAM J. Comput. , vol.28 , Issue.2 , pp. 652-673
    • Eppstein, D.1
  • 20
    • 84885852874 scopus 로고    scopus 로고
    • A note on logit choices in strategy transit assignment
    • Florian M., Constantin I. A note on logit choices in strategy transit assignment. EURO J. Transport. Logistics 2012, 1:28-46.
    • (2012) EURO J. Transport. Logistics , vol.1 , pp. 28-46
    • Florian, M.1    Constantin, I.2
  • 22
    • 85015609453 scopus 로고    scopus 로고
    • Link-based route choice considering risk aversion, disappointment and regret
    • Fonzone A., Schmcker J.-D., Ma J., Fukuda D. Link-based route choice considering risk aversion, disappointment and regret. Transport. Res. Record 2012, 2322:119-128.
    • (2012) Transport. Res. Record , vol.2322 , pp. 119-128
    • Fonzone, A.1    Schmcker, J.-D.2    Ma, J.3    Fukuda, D.4
  • 24
    • 33845262457 scopus 로고    scopus 로고
    • Capturing correlation with subnetworks in route choice models
    • Freginger E., Bierlaire M. Capturing correlation with subnetworks in route choice models. Transport. Res. Part B: Methodol. 2007, 41:363-378.
    • (2007) Transport. Res. Part B: Methodol. , vol.41 , pp. 363-378
    • Freginger, E.1    Bierlaire, M.2
  • 26
    • 25144471578 scopus 로고    scopus 로고
    • Optimal routing policy problem in stochastic time-dependent networks
    • Gao S., Chabini I. Optimal routing policy problem in stochastic time-dependent networks. Transport. Res. Part B: Methodol. 2006, 40:93-122.
    • (2006) Transport. Res. Part B: Methodol. , vol.40 , pp. 93-122
    • Gao, S.1    Chabini, I.2
  • 27
    • 84943000304 scopus 로고    scopus 로고
    • Stochastic user equilibrium traffic assignment with a network GEV based route choice model (in Japanese)
    • paper No. 60
    • Hara Y., Akamatsu T. Stochastic user equilibrium traffic assignment with a network GEV based route choice model (in Japanese). JSCE Proc. Infrastruct. Plann. Rev. 2012, 46. paper No. 60.
    • (2012) JSCE Proc. Infrastruct. Plann. Rev. , vol.46
    • Hara, Y.1    Akamatsu, T.2
  • 31
    • 0002500977 scopus 로고
    • Modelling the choice of residential location
    • North Holland, Amsterdam, A. Karlquist (Ed.)
    • McFadden D. Modelling the choice of residential location. Spatial Interaction Theory and Planning Models 1978, 75-96. North Holland, Amsterdam. A. Karlquist (Ed.).
    • (1978) Spatial Interaction Theory and Planning Models , pp. 75-96
    • McFadden, D.1
  • 32
    • 0035218914 scopus 로고    scopus 로고
    • Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
    • Miller-Hooks E.D. Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. Networks 2001, 37(1):35-52.
    • (2001) Networks , vol.37 , Issue.1 , pp. 35-52
    • Miller-Hooks, E.D.1
  • 33
    • 0024104706 scopus 로고
    • Equilibrium traffic assignment for large scale transit networks
    • Nguyen S., Pallottino S. Equilibrium traffic assignment for large scale transit networks. Eur. J. Oper. Res. 1988, 37:176-186.
    • (1988) Eur. J. Oper. Res. , vol.37 , pp. 176-186
    • Nguyen, S.1    Pallottino, S.2
  • 34
    • 0000143291 scopus 로고
    • Hyperpaths and shortest hyperpaths
    • Springer, Berlin Heidelberg
    • Nguyen S., Pallottino S. Hyperpaths and shortest hyperpaths. Combinatorial Optimization 1989, vol. 1403:258-271. Springer, Berlin Heidelberg.
    • (1989) Combinatorial Optimization , vol.1403 , pp. 258-271
    • Nguyen, S.1    Pallottino, S.2
  • 35
    • 0031998314 scopus 로고    scopus 로고
    • Implicit enumeration of hyperpaths in a logit model for transit networks
    • Nguyen S., Pallottino S., Gendreau M. Implicit enumeration of hyperpaths in a logit model for transit networks. Transport. Sci. 1998, 32(1):54-64.
    • (1998) Transport. Sci. , vol.32 , Issue.1 , pp. 54-64
    • Nguyen, S.1    Pallottino, S.2    Gendreau, M.3
  • 36
    • 84880632663 scopus 로고    scopus 로고
    • A network generalized extreme value model for route choice allowing implicit route enumeration
    • Papola A., Marzano V. A network generalized extreme value model for route choice allowing implicit route enumeration. Comput.-Aided Civil Infrastruct. Eng. 2013, 28:560-580.
    • (2013) Comput.-Aided Civil Infrastruct. Eng. , vol.28 , pp. 560-580
    • Papola, A.1    Marzano, V.2
  • 37
    • 84869200631 scopus 로고    scopus 로고
    • Route choice modeling: past, present and future research directions
    • Prato C.G. Route choice modeling: past, present and future research directions. J. Choice Modell. 2009, 2:65-100.
    • (2009) J. Choice Modell. , vol.2 , pp. 65-100
    • Prato, C.G.1
  • 39
    • 84873713693 scopus 로고    scopus 로고
    • A rank-dependent expected utility model for strategic route choice with stated preference data
    • Razo M., Gao S. A rank-dependent expected utility model for strategic route choice with stated preference data. Transport. Res. Part C: Emerg. Technol. 2013, 27:117-130.
    • (2013) Transport. Res. Part C: Emerg. Technol. , vol.27 , pp. 117-130
    • Razo, M.1    Gao, S.2
  • 41
    • 0024650417 scopus 로고
    • Optimal strategies: a new assignment model for transit networks
    • Spiess H., Florian M. Optimal strategies: a new assignment model for transit networks. Transport. Res. Part B: Methodol. 1989, 23:83-102.
    • (1989) Transport. Res. Part B: Methodol. , vol.23 , pp. 83-102
    • Spiess, H.1    Florian, M.2
  • 42
    • 0008435458 scopus 로고    scopus 로고
    • The link-nested logit model of route choice: overcoming the route overlapping problem
    • Vovsha P., Bekhor S. The link-nested logit model of route choice: overcoming the route overlapping problem. Transport. Res. Record 1998, 1645:133-142.
    • (1998) Transport. Res. Record , vol.1645 , pp. 133-142
    • Vovsha, P.1    Bekhor, S.2
  • 43
    • 0030615384 scopus 로고    scopus 로고
    • Multinomial probit with structured covariance for route choice behavior
    • Yai T., Iwakura S., Morichi S. Multinomial probit with structured covariance for route choice behavior. Transport. Res. Part B: Methodol. 1997, 31(3):195-207.
    • (1997) Transport. Res. Part B: Methodol. , vol.31 , Issue.3 , pp. 195-207
    • Yai, T.1    Iwakura, S.2    Morichi, S.3
  • 44
    • 84908342420 scopus 로고    scopus 로고
    • Development of an enhanced route choice model based on cumulative prospect theory
    • Yang J., Jiang G. Development of an enhanced route choice model based on cumulative prospect theory. Transport. Res. Part C: Emerg. Technol. 2014, 47:168-178.
    • (2014) Transport. Res. Part C: Emerg. Technol. , vol.47 , pp. 168-178
    • Yang, J.1    Jiang, G.2


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