THE FEEDER-BUS NETWORK-DESIGN PROBLEM

The potential for improving the cost-effectiveness of public transport operations by designing better integrated feeder-bus/rail rapid transit systems has been widely recognized. This paper defines the feeder-bus network-design problem (fbndp) as that of designing a feeder-bus network to access an existing rail system. The fbndp is considered under two different demand patterns, many-to-one (m-to-1) and many-to-many (m-to-m). We present a mathematical programming model for the m-to-1 fbndp, and show that it can be generalized to the m-to-m fbndp. The fbndp is a large and difficult vehicle-routeing-type problem with an additional decision variable -operating frequency. A heuristic model is presented, which generalizes the 'savings approach' to incorporate operating frequency. The computational analysis shows that the proposed heuristic provides reasonable feeder-bus networks and consistent responses to 'what if' questions. A comparison indicates that the proposed heuristic provides solutions that are superior to manually designed networks. The advantages of this heuristic are particularly significant under variable demand.(a)

  • Availability:
  • Corporate Authors:

    MACMILLAN PRESS LIMITED

    HOUNDMILLS
    BASINGSTOKE, HAMPSHIRE  United Kingdom  RG21 6XS
  • Authors:
    • Kuah, Geok Koon
    • Perl, J
  • Publication Date: 1989-8

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00498595
  • Record Type: Publication
  • Source Agency: Transport and Road Research Laboratory (TRRL)
  • Files: ITRD, TRIS
  • Created Date: Sep 30 1990 12:00AM