Advertisement

Deterministic Time Table Transit Assignment

  • Isabelle Constantin
  • Michael Florian
  • Heinz Spiess
Part of the Advances in Spatial Science book series (ADVSPATIAL)

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 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. INRO Consultants (1998), EMME/2 User’s Manual, Release 9.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Isabelle Constantin
    • 1
  • Michael Florian
    • 1
  • Heinz Spiess
    • 1
  1. 1.INRO Consultants Inc.MontréalCanada

Personalised recommendations