메뉴 건너뛰기




Volumn 30, Issue 2, 2003, Pages 177-201

An assignment model with modified Logit, which obviates enumeration and overlapping problems

Author keywords

Assignment model; Path choice model; Path perception

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); PROBABILITY; PROBLEM SOLVING;

EID: 0037403131     PISSN: 00494488     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022598404823     Document Type: Article
Times cited : (64)

References (23)
  • 4
    • 0029407122 scopus 로고
    • Dynamic processes and equilibrium in transportation networks
    • Cantarella E & Cascetta GE (1995) Dynamic processes and equilibrium in transportation networks. Transportation Science 29: 305-329.
    • (1995) Transportation Science , vol.29 , pp. 305-329
    • Cantarella, E.1    Cascetta, G.E.2
  • 5
    • 0031139471 scopus 로고    scopus 로고
    • A general fixed point approach to multi-mode multi-user equilibrium assignment with elastic demand enumeration
    • Cantarella GE (1997) A general fixed point approach to multi-mode multi-user equilibrium assignment with elastic demand enumeration. Transportation Science 31: 107-128.
    • (1997) Transportation Science , vol.31 , pp. 107-128
    • Cantarella, G.E.1
  • 6
    • 0002453076 scopus 로고    scopus 로고
    • A modified logit route choice model over-coming path overlapping problems, specification and some calibration results for interurban networks
    • Lyon, France, 1996. In: Lesort JB (ed) Transportation and Traffic Theory. Pergamon
    • Cascetta E, Nuzzolo A, Russo F & Vitetta A (1996) A modified logit route choice model over-coming path overlapping problems, specification and some calibration results for interurban networks. Proceedings of ISTTT conference, Lyon, France, 1996. In: Lesort JB (ed) Transportation and Traffic Theory. Pergamon.
    • (1996) Proceedings of ISTTT Conference
    • Cascetta, E.1    Nuzzolo, A.2    Russo, F.3    Vitetta, A.4
  • 9
    • 0027601356 scopus 로고
    • Transit assignment for congested public transport system: The equilibrium model
    • De Cea J & Fernandez E (1993) Transit assignment for congested public transport system: the equilibrium model. Transportation Science 27: 133-147.
    • (1993) Transportation Science , vol.27 , pp. 133-147
    • De Cea, J.1    Fernandez, E.2
  • 11
    • 0015078345 scopus 로고
    • A probabilistic multipath traffic assignment model which obviates path enumeration
    • Dial RB (1971) A probabilistic multipath traffic assignment model which obviates path enumeration. Transportation Science 5: 83-111.
    • (1971) Transportation Science , vol.5 , pp. 83-111
    • Dial, R.B.1
  • 13
    • 0002974509 scopus 로고
    • The structure of random utility models
    • Manski C (1977) The structure of random utility models. Theory and Decisions 8: 229-254.
    • (1977) Theory and Decisions , vol.8 , pp. 229-254
    • Manski, C.1
  • 14
    • 3242760011 scopus 로고    scopus 로고
    • A hybrid probabilistic choice set model with compensatory and noncompensatory choice rules
    • Oxford, UK: Pergamon. Hensher D, King J and Oum T (eds)
    • Morikawa T (1996) A hybrid probabilistic choice set model with compensatory and noncompensatory choice rules. In Hensher D, King J & Oum T (eds) Modelling Transport Systems (Proceedings of 7th WCTR, Sydney). Oxford, UK: Pergamon.
    • (1996) Modelling Transport Systems (Proceedings of 7th WCTR, Sydney)
    • Morikawa, T.1
  • 15
    • 0012833323 scopus 로고
    • Assegnamento dei passeggeri ad un sistema di linee urbane: Determinazione degli ipercammini minimi
    • Nguyen S & Pallottino S (1986) Assegnamento dei passeggeri ad un sistema di linee urbane: determinazione degli ipercammini minimi. Ricerca Operativa (39): 207-230.
    • (1986) Ricerca Operativa , Issue.39 , pp. 207-230
    • Nguyen, S.1    Pallottino, S.2
  • 16
    • 0020091589 scopus 로고
    • The convergence of equilibrium algorithms with predetermined step sizěs
    • Powell WB & Sheffi Y (1982) The convergence of equilibrium algorithms with predetermined step sizěs. Transportation Science 16: 45-55.
    • (1982) Transportation Science , vol.16 , pp. 45-55
    • Powell, W.B.1    Sheffi, Y.2
  • 17
    • 0012788384 scopus 로고    scopus 로고
    • Network and assignment models for the Italian national transportation systems
    • Hensher D, King J and Oum T (eds) Oxford, UK: Pergamon
    • Russo F & Vitetta A (1996) Network and assignment models for the Italian national transportation systems. In: Hensher D, King J & Oum T (eds) Modelling Transport Systems (Proceedings of 7th WCTR, Sydney . Oxford, UK: Pergamon.
    • (1996) Modelling Transport Systems (Proceedings of 7th WCTR, Sydney)
    • Russo, F.1    Vitetta, A.2
  • 18
    • 0030700966 scopus 로고    scopus 로고
    • The parallelization level for stochastic assignment to the transportation network
    • Power and Casares Long editors, Computational Mechanics Publications
    • Russo F & Vitetta A (1997) The parallelization level for stochastic assignment to the transportation network. Proceedings of 4th International Symposium of High Performance Computer, Power and Casares Long editors, Computational Mechanics Publications (pp 105, 115).
    • (1997) Proceedings of 4th International Symposium of High Performance Computer , pp. 105-115
    • Russo, F.1    Vitetta, A.2
  • 19
    • 0019367092 scopus 로고
    • A comparison of stochastic and deterministic traffic assignment over congested network
    • Sheffi Y & Powell WB (1981) A comparison of stochastic and deterministic traffic assignment over congested network. Transportation Research 15B: 53-64.
    • (1981) Transportation Research , vol.15 B , pp. 53-64
    • Sheffi, Y.1    Powell, W.B.2
  • 21
    • 0024650417 scopus 로고
    • Optimal strategies: A new assignment model for transit networks
    • Spiess H & Florian M (1989) Optimal strategies: A new assignment model for transit networks. Transportation Research 23B: 82-102.
    • (1989) Transportation Research , vol.23 B , pp. 82-102
    • Spiess, H.1    Florian, M.2
  • 22
    • 0019392694 scopus 로고
    • Selected node-pair analysis in Dial's assignment algorithm
    • Van Vliet D (1981) Selected node-pair analysis in Dial's assignment algorithm. Transportation Research 15B: 05-08.
    • (1981) Transportation Research , vol.15 B , pp. 05-08
    • Van Vliet, D.1
  • 23
    • 0000881715 scopus 로고
    • Transit equilibrium assignment: A model and solution algorithms
    • Wu JH, Florian M & Marcotte P (1994), Transit equilibrium assignment: A model and solution algorithms. Transportation Science 28: 193-203.
    • (1994) Transportation Science , vol.28 , pp. 193-203
    • Wu, J.H.1    Florian, M.2    Marcotte, P.3


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