Abstract
The network flow constraints construct the feasible region for dynamic travel choice models. Although the feasible region associated with each dynamic travel choice model may be different, the basic components of the network flow constraints are essentially the same. The complete requirements of dynamic travel choice models include the constraints of flow conservation, flow propagation, nonnegativity, definition, first-in-first-out (FIFO) and oversaturation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chen, HK. (1999). Network Flow Constraints and Link Travel Time Function Analysis. In: Dynamic Travel Choice Models. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59980-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-59980-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64207-4
Online ISBN: 978-3-642-59980-4
eBook Packages: Springer Book Archive