A PUBLIC TRANSPORT ASSIGNMENT METHOD USING MULTIPLE ROUTE CHOICE

EEN TOEDELINGSMETHODE VOOR OPENBAAR VERVOERNETWERKEN MET MEERVOUDIGE ROUTEKEUZE

A disadvantage of all-or-nothing assignment procedures, treating public transport networks, is the neglect of the fact that one may choose between shorter waiting and longer riding on the one hand and longer waiting and shorter riding on the other. An assignment algorithm is described herewith which selects the connections used and computes the average travel time in each relation in a public transport network. The selection of the connections is based on minimization of the average travel time. The only factors which influence the selections are the length of the connections and the departing frequency of each connection. The selection can be influenced by manipulating the function which controls the influence of the length of a connection on the selection made. A number of assumptions concerning the computation of average waiting, changing and riding time restricts the application of the algorithm to networks with high frequencies. The properties of the algorithm are demonstrated in an example. (a) for covering abstract for the conference see IRRD no. 215277. /TRRL/

  • Corporate Authors:

    Colloguium Vervoersplanologisch Speurwerk

    P.O. Box 45
    Delft,   Netherlands 
  • Authors:
    • Edelman, W F
  • Publication Date: 1975

Language

  • Dutch

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00129979
  • Record Type: Publication
  • Source Agency: Institute for Road Safety Research, SWOV
  • Report/Paper Numbers: Conf Paper
  • Files: ITRD, TRIS
  • Created Date: Apr 7 1981 12:00AM