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

Transportation

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

  Russo, Francesco ^a   Vitetta, Antonino ^a  

^a UNIVERSITY MEDITERRANEA OF REGGIO CALABRIA   (Italy)

Author keywords

Assignment model; Path choice model; Path perception

Indexed keywords

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

CONGESTED NETWORKS;

RANDOM PROCESSES;

ALGORITHM; LOGIT ANALYSIS; PLANNING METHOD; TRANSPORTATION PLANNING;

EID: 0037403131     PISSN: 00494488     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022598404823     Document Type: Article

References (23)

1. Ben-Akiva M, Bergman MJ, Daly AJ & Ramaswamy R (1984) Modelling inter urban route choice behaviour. Ninth International Symposium on Transportation and Traffic Theory (pp 299-330). VNU Science Press.
2. Ben Akiva M & Lerman SR (1985) Discrete Choice Analysis. Cambridge Mass: MIT Press.
3. Ben Akiva M & Boccara B (1995) Discrete choice models with latent choice sets. Int. Journal of Research in Marketing 12: 9-24.
4. Cantarella E & Cascetta GE (1995) Dynamic processes and equilibrium in transportation networks. Transportation Science 29: 305-329.
5. Cantarella GE (1997) A general fixed point approach to multi-mode multi-user equilibrium assignment with elastic demand enumeration. Transportation Science 31: 107-128.
6. 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.
7. Cascctta E (2001) Transportation System Engineering: Theory and Methods. Dordrecht/Boston/ New York: Kluwer Academic Publishers.
8. Daganzo CF (1979) Multinomial Probit: The Theory and its Applications to Demand Forecasting. New York: Academic Press.
9. De Cea J & Fernandez E (1993) Transit assignment for congested public transport system: the equilibrium model. Transportation Science 27: 133-147.
10. De La Barra T, Perez B & Anez J (1993) Multidimensional path search and assignment. Proceedings of the 21 PTRC Summer Meeting.
11. Dial RB (1971) A probabilistic multipath traffic assignment model which obviates path enumeration. Transportation Science 5: 83-111.
12. Leurent F (1993) Cost versus time equilibrium over network. European Journal of Operation Research 71: 205-221.
13. Manski C (1977) The structure of random utility models. Theory and Decisions 8: 229-254.
14. 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.
15. Nguyen S & Pallottino S (1986) Assegnamento dei passeggeri ad un sistema di linee urbane: determinazione degli ipercammini minimi. Ricerca Operativa (39): 207-230.
16. Powell WB & Sheffi Y (1982) The convergence of equilibrium algorithms with predetermined step sizěs. Transportation Science 16: 45-55.
17. 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.
18. 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).
19. Sheffi Y & Powell WB (1981) A comparison of stochastic and deterministic traffic assignment over congested network. Transportation Research 15B: 53-64.
20. Sheffi Y (1985) Urban Transportation Networks. Englewood Cliff: Prentice Hall.
21. Spiess H & Florian M (1989) Optimal strategies: A new assignment model for transit networks. Transportation Research 23B: 82-102.
22. Van Vliet D (1981) Selected node-pair analysis in Dial's assignment algorithm. Transportation Research 15B: 05-08.
23. Wu JH, Florian M & Marcotte P (1994), Transit equilibrium assignment: A model and solution algorithms. Transportation Science 28: 193-203.