SEARCH AND CHOICE IN TRANSPORT SYSTEMS PLANNING. VOLUME XX. OPTIMAL TRAVEL TIME REDUCTION IN A TRANSPORT NETWORK: AN APPLICATION OF NETWORK AGGREGATION AND BRANCH AND BOUND TECHNIQUES.
Abstract
Given a transport network and the origin-destination trip-making desires of its users, a not too uncommon problem of planning is 'What is the least costly way to reduce the travel time in the network to satisfy a certain measure of effectiveness.' The present work demonstrates, through the use of the aggregate search algorithm, the feasibility of reducing the size of the network by a simplified network aggregation, and 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. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1969
- Accession Number
- AD0693095
Entities
People
- Yu-po Chan
Organizations
- Massachusetts Institute of Technology