Browse Econ Literature
- Working papers
- Software components
- Book chapters
- JEL classification
More features
- Subscribe to new research
RePEc Biblio
Author registration.
- Economics Virtual Seminar Calendar NEW!
Toward a class of link travel time functions for dynamic assignment models on signalized networks
- Author & abstract
- 2 References
- 7 Citations
- Most related
- Related works & more
Corrections
- Rouphail, Nagui M.
- Tarko, Andrzej
- Boyce, David E.
Suggested Citation
Download full text from publisher, references listed on ideas.
Follow serials, authors, keywords & more
Public profiles for Economics researchers
Various research rankings in Economics
RePEc Genealogy
Who was a student of whom, using RePEc
Curated articles & papers on economics topics
Upload your paper to be listed on RePEc and IDEAS
New papers by email
Subscribe to new additions to RePEc
EconAcademics
Blog aggregator for economics research
Cases of plagiarism in Economics
About RePEc
Initiative for open bibliographies in Economics
News about RePEc
Questions about IDEAS and RePEc
RePEc volunteers
Participating archives
Publishers indexing in RePEc
Privacy statement
Found an error or omission?
Opportunities to help RePEc
Get papers listed
Have your research listed on RePEc
Open a RePEc archive
Have your institution's/publisher's output listed on RePEc
Get RePEc data
Use data assembled by RePEc
Schedule-Based Dynamic Assignment Models for Public Transport Networks
Cite this chapter.
- F. Russo 5
Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 28))
309 Accesses
1 Citations
In the sphere of transit assignment, the dynamic models approach is the focus of increasing interest, because of the importance of explicit system simulations to know user flow for each run and the performance of different service networks in terms of times and comfort levels, and to enable user decisions to be evaluated if ITS is used. Urban transit systems are characterised not only by day-to-day dynamics but also within-day dynamics. Thus the evaluation process has to be represented by means of the two relative processes (within-day and day-to-day). This paper reports some extension and review on the framework of the approach proposed by Nuzzolo and Russo (1998) and generalized in Nuzzolo et al. (2001, 2002), with the study of the different aspects of path choice — on the demand side — and of operating services — on the supply side — in relation to the different assignment models that can be useful.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
- Available as EPUB and PDF
- Read on any device
- Instant download
- Own it forever
- Compact, lightweight edition
- Dispatched in 3 to 5 business days
- Free shipping worldwide - see info
- Durable hardcover edition
Tax calculation will be finalised at checkout
Purchases are for personal use only
Institutional subscriptions
Unable to display preview. Download preview PDF.
Abkowitz M.D. (1981) “An analysis of the commuter departure time decision”. Transportation, 283–297.
Google Scholar
Ben Akiva M., Lerman S.R. (1987) “Discrete choice analysis”, MIT Press, Cambridge Mass.
Cantarella G.E. and Cascetta E. (1995) Dynamic Processes and Equilibrium in Transportation Networks: Towards a Unifying Theory. Transportation Science 29, 305–329
Article Google Scholar
Chriqui C. and Robillard P. (1975) Common bus lines. Transportation Science 9, 115–121.
Crisalli U. (2001) Modelli di assegnazione doppiamente dinamica alle reti di trasporto collettivo urbano: applicazioni ed analisi sperimentali. In “Metodi e Tecnologie dell’Ingegneria dei Trasporti: Seminario 1999” G. E. Cantarella and F. Russo (eds.). Franco Angeli, Milano.
Crisalli U. and Rosati L. (2001) DYNATRANSIT: A doubly dynamic transit assignment software. In Preprint of 4th International EUROSIM Congress, Delft, The Netherlands.
Daganzo C. (1979) “Multinomial Probit”. Academic Press, New York, USA.
Daly A. (1999) The use of schedule-based assignments in public transport modelling. Proceedings of 27th European Transportation Forum, Seminar F, Cambridge, England, 149–157.
Dial R. B. (1967) Transit pathfinder algorithm. Highway Research Record 205 67–85.
Florian M. (2002) Operational aspects of a scheduled-based approach in transit modelling: a particular implementation and future modelling challenges. Preprints of the First Workshop on The Schedule-Based Approach in Dynamic Transit Modelling (SBDTM2002). Ischia, 19–34.
Lam W.H.K. and Bell M.G.H (2003) (eds) Advanced Modeling for Transit Operations and Service Planning Pergamon.
Lam W.H.K. and Wu Z.X. (2002) Estimation of transit passenger origin-destination matrices from passenger counts in congested transit networks. Preprints of the First Workshop on The Schedule-Based Approach in Dynamic Transit Modelling (SBDTM2002). Ischia. 89–94.
Nguyen S. and Pallottino S. (1988) Equilibration Traffic Assignment for Large Scale Transit Networks. European Journal of Operational Research 37, 176–186.
Nielsen O.A. (1999) The use of schedule-based assignments in public transport modelling. Proceedings of 27th European Transportation Forum, Seminar F, pp. 149157. Cambridge. England.
Nielsen O.A. (2002) A multi-class timetable-based transit assignment model with error components in the utility functions. Preprints of the First Workshop on The Schedule-Based Approach in Dynamic Transit Modelling (SBDTM2002). Ischia, 5562.
Nuzzolo A. (2003) Transit Path Choice and Assignment Model Approaches. In “Advanced Modeling for Transit Operations and Service Planning” edited by William H.K Lam and Michael G.H. Bell. Pergamon, 93–124.
Nuzzolo A., Russo F. and Crisalli U. (2001) A doubly dynamic schedule-based assignment model for transit networks. Transportation Science, Vol. 35, n° 3.
Nuzzolo A., Russo F. and Crisalli U. (2002) “Transit Network Modelling: The schedule-based dynamic approach”, Franco Angeli, Milano.
Nuzzolo A., Russo F. (1996) Stochastic assignment models for transit low frequency services. Some theoretical and operative aspects. L. Bianco, P. Toth, eds. Advanced Methods in Transportation Analysis. Springer Verlag, Berlin, 321–340.
Nuzzolo A. and Russo F. (1998), “A Dynamic Network Loading model for transit services”, Proceedings of TRISTAN I II Conference, San Juan, Puerto Rico.
Postorino M.N., Musolino G. and Velonà P. (2002) Updating o/d trip matrices for schedale-based public transport systems: an application to a real case. Preprints of the First Workshop on The Schedule-Based Approach in Dynamic Transit Modelling (SBDTM2002). Ischia, 95–101.
Russo F. (2001) “Modelli di scelta del percorso sequenziali per l’assegnazione dinamica a reti di servizi di trasporto collettivo urbano”. In “Metodi e Tecnologie dell’Ingegneria dei Trasporti: Seminario 1999” G. E. Cantarella and F. Russo (eds.). Franco Angeli, Milano.
Russo F. and Velonà P. (2002a) “Approccio day-to-day per la modellizzazione del percorso in un sistema di trasporto collettivo: valutazioni analitiche e simulative nel caso di choice set con due alternative”. In “Metodi e Tecnologie dell’Ingegneria dei Trasporti: Seminario 2001” G. E. Cantarella and F. Russo (eds). Franco Angeli, Milano.
Russo F. and Velonà P. (2002b) “Day-to-day approach for path choice models on transit system: analytical evaluations and simulation results”. Proceedings of 30th European Transportation Forum. Cambridge. England.
Spiess H., Florian M. (1989) Optimal strategies: A new assignment model for transit networks. Transportation Res. 23B.
Wong S. C. and Tong C. O. (2003) The Estimation of Origin-Destination Matrices in Transit Networks. In “Advanced Modeling for Transit Operations and Service Planning” edited by William H.K Lam and Michael G.H. Bell. Pergamon, 287–314.
Download references
Author information
Authors and affiliations.
Department of Computer Science, Mathematics, Electronic and Transportation, “Mediterranea ”University of Reggio Calabria, Feo di Vito, Reggio Calabria, Italy
You can also search for this author in PubMed Google Scholar
Editor information
Editors and affiliations.
Department of Civil and Environmental Engineering, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA
Nigel H. M. Wilson ( Professor of Civil and Environmental Engineering ) ( Professor of Civil and Environmental Engineering )
Department of Civil Engineering, “Tor Vergata” University of Rome, Rome, Italy
Agostino Nuzzolo
Rights and permissions
Reprints and permissions
Copyright information
© 2004 Springer Science+Business Media New York
About this chapter
Russo, F. (2004). Schedule-Based Dynamic Assignment Models for Public Transport Networks. In: Wilson, N.H.M., Nuzzolo, A. (eds) Schedule-Based Dynamic Transit Modeling: theory and applications. Operations Research/Computer Science Interfaces Series, vol 28. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6467-3_5
Download citation
DOI : https://doi.org/10.1007/978-1-4757-6467-3_5
Publisher Name : Springer, Boston, MA
Print ISBN : 978-1-4419-5412-1
Online ISBN : 978-1-4757-6467-3
eBook Packages : Springer Book Archive
Share this chapter
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative
- Publish with us
Policies and ethics
- Find a journal
- Track your research
IMAGES
VIDEO
COMMENTS
A handful dynamic traffic assignment (DTA) models that are based on signalized transportation networks are simulation-based [38, 39] and implicit. "implicit" means signal parameters are included in the link travel time functions or queuing delay expressions but the queue length in red time and throughput in green for each and every cycle ...
Dynamic lane assignment (DLA) is an effective method to improve traffic flow and optimize urban road resources. ... Zhang H. M., Yang X. Two-Step Optimization Model for Dynamic Lane Assignment at Isolated Signalized Intersections. Transportation Research Record ... Zhang H. M., Yang X. Increasing the Capacity of Signalized Intersections with ...
Traffic assignment model (TAM) is an important research issue of urban traffic design and planning. Most of the existing studies are conducted under deterministic conditions. In reality, the link travel time and waiting time at signalized intersections are stochastic due to many uncertain factors in transportation networks. Under this circumstance, this paper proposes a new travel time ...
DOI: 10.1016/S0191-2615(96)00036-7 Corpus ID: 153407365; Toward a class of link travel time functions for dynamic assignment models on signalized networks @article{Ran1997TowardAC, title={Toward a class of link travel time functions for dynamic assignment models on signalized networks}, author={Bin Ran and Nagui M. Rouphail and Andrzej P. Tarko and David E. Boyce}, journal={Transportation ...
In the modeling of tra c networks, a signalized junction is typically treated using a binary vari-able to model the on-and-o nature of signal operation. While accurate, the use of binary vari- ... which poses di culties in quite a few dynamic tra c assignment models. For example, a dynamic user equilibrium problem (Friesz et al., 2013) cannot ...
Traffic network models tend to become very large even for medium-size static assignment problems. Adding a time dimension, together with time-varying flows and travel times within links and queues, greatly increases the scale and complexity of the problem. In view of this, to retain tractability in dynamic traffic assignment (DTA) formulations, especially in mathematical programming ...
In macroscopic dynamic network loading, the role of the node model is to determine transfer volumes between each in- and outgoing link, while respecting in a consistent way all forward and backward-moving traffic waves (or boundary conditions) and desired turning fractions. ... spillback, dynamic traffic assignment, continuous signalized node ...
This article presents a modeling framework that represents bus priority at signalized intersections in the context of its potential network-level and intermodal effects. The model incorporates bus priority within an intermodal dynamic traffic assignment-simulation model. It dynamically assigns travelers to different modes and routes in
Continuous signalized node model. 1. Introduction. In Dynamic Traffic Assignment (DTA), a link model and a node model, cooperating in a Dynamic Network Loading (DNL) algorithm, propagate traffic through a network. For numerically solving the DNL, the simulation time dimension is typically discretized and in each time step (Δ t ), the link ...
A dynamic lane-use assignment model at signalized intersection under tidal flow is established in this paper. By solving the model, an optimal solution for lane-use assignment and signal phase can be obtained and determinations can be made whether reversible lanes need to be set up or how many reversible lanes need to be set up.
Abstract: In this article a dynamic system-optimal traffic assignment model is formulated for a congested urban road network with a number of signalized intersections. A simulation-based approach is employed for the case of multiple-origin-multiple-destination traffic flows. The artificial intelligence technique of genetic algorithms (GAs) is used to minimize the overall travel cost in the ...
In this paper, we present a cyclically time-expanded network model for simultaneous optimization of traffic assignment and traffic signal parameters, in particular, offsets, split times, and phase orders. Since travel times are of great importance for developing realistic solutions for traffic assignment and traffic signal coordination in urban ...
Downloadable (with restrictions)! This paper investigates time-dependent travel time functions for dynamic assignment on signalized arterial network links. Dynamic link travel times are first classified according to various applications. Subsequently, stochastic and deterministic travel time functions for longer and shorter time horizons are discussed separately, and two sets of functions are ...
This paper presents the development of a dynamic user equilibrium (DUE) traffic-assignment model for the congested urban road network with signalized intersections. A simulation-based approach is employed for the case of multiple-origin multiple-destination traffic flows.
Passing from path flows to link flows requires non-linear and complex flow propagation models known as network loading models. In specific technical literature, different approaches have been used to study Dynamic Network Loading models, depending on whether the link performances are expressed in an aggregate or disaggregate way, and how vehicles are traced.
Abstract. In the sphere of transit assignment, the dynamic models approach is the focus of increasing interest, because of the importance of explicit system simulations to know user flow for each run and the performance of different service networks in terms of times and comfort levels, and to enable user decisions to be evaluated if ITS is used.
This chapter will present the GLTM that is the extension of the link transmission model (LTM) to any concave fundamental diagram and node topology and compare it with the dynamic user equilibrium (DUE) algorithm and find it to be flexible, reliable, and easy to calibrate. This chapter will present the General Link Transmission Model (GLTM) that is the extension of the link transmission model ...
web page. In particular, VISTA can perform dynamic traffic assignment using a cell transmission model (CTM). The cell transmission model was developed by Daganzo (15) as a discrete version of the hydrodynamic traffic flow model. The CTM can be thought of as a simulation-based model which divides network links into shorter "cells," which then ...
A dynamic reversible lane assignment method for approaches of signalized junctions that consider the game equilibrium between road users and traffic controllers and a bi-level programming model is established to theoretically analyze the behaviors of the players involved in the leader-follower strategic game. Expand