OPTIMAL TRAVEL TIME REDUCTION IN A TRANSPORT NETWORK: AN APPLICATION OF NETWORK AGGREGATION AND BRANCH AND BOUND TECHNIQUES.

The present work demonstrates, through the use of the AGgregate Search Algorithm (ASA), the feasibility of i) reducing the size of the network by a simplified network representation (Network Aggregation), and ii) using the simplified network as a proxy for the detailed, in the search for the optimal travel time reduction scheme based on the assumption that each transportation user maximizes his individual benefit (Branch and Bound Tree Search).

  • Corporate Authors:

    Massachusetts Institute of Technology

    Department of Civil Engineering, 77 Massachusetts Avenue
    Cambridge, MA  United States  02139
  • Authors:
    • Chan, Y
  • Publication Date: 1969-7

Subject/Index Terms

Filing Info

  • Accession Number: 00074527
  • Record Type: Publication
  • Source Agency: FLIGHT TRANSPORTATION LABORATORY, MIT DEPT. OF AERONAUTICS AND ASTRONAUTICS
  • Report/Paper Numbers: R69-39
  • Files: TRIS
  • Created Date: Sep 5 1974 12:00AM