Assume that we are given a network of streets on which certain bus lines have been set up. Let the total number of buses be given. Assume furthermore that the total demand for travel from certain origins as well as the total demand for travel to certain destinations is given. The requirement is to determine the complete travel pattern and decide which bus frequencies to use on the various lines. The problem is formulated as a non-linear programming problem. The model takes into account capacity constraints on the buses and the distribution of trips between different zones is influenced by the frequencies on the bus lines. The model also takes into account modal split between bus riding and walking. The model is intended for medium to long range planning. An iterative algorithm to solve this problem is developed. The algorithm is shown to converge to stationary points. As a part of the algorithm, an algorithm for the combined distribution-assignment problem in traffic planning is developed. The model has been used on the bus network in the town of Linkoeping (80000 inhabitants). /TRRL/

  • Corporate Authors:

    Linkoeping University, Sweden

    Department of Mathematics
    S-58183 Linkoeping,   Sweden 
  • Authors:
    • Scheele, S
  • Publication Date: 1977

Media Info

  • Features: Figures; References; Tables;
  • Pagination: 215 p.
  • Serial:
    • Issue Number: 12

Subject/Index Terms

Filing Info

  • Accession Number: 00163834
  • Record Type: Publication
  • Source Agency: Swedish National Road and Transport Research Institute (VTI)
  • Report/Paper Numbers: Monograph
  • Files: ITRD, TRIS, ATRI
  • Created Date: May 31 1981 12:00AM