Deterministic Time Table Transit Assignment

Isabelle Constantin, Michael Florian and Heinz Spiess
Additional contact information
Isabelle Constantin: INRO Consultants Inc.
Michael Florian: INRO Consultants Inc.
Heinz Spiess: INRO Consultants Inc.

Chapter 6 in National Transport Models, 2002, pp 61-78 from Springer

Abstract: Abstract The basic timetable based assignment problem is to find an optimal path for a passenger, given an origin node, a destination node, and departure or arrival time information. The deterministic transit assignment does not necessarily minimize the total elapsed travel time, but rather uses weight factors and non-time-based cost elements in determining the optimal path. Therefore, the algorithm tracks both time (to determine the feasibility of a path) and cost (to determine the attractiveness of a path).

Keywords: Optimal Path; Penalty Factor; Target Time; Transit Line; Allowed Time (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:adspcp:978-3-662-04853-5_6

Ordering information: This item can be ordered from
http://www.springer.com/9783662048535

DOI: 10.1007/978-3-662-04853-5_6

Access Statistics for this chapter

More chapters in Advances in Spatial Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().