Accession Number : AD0693095

Title :   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.

Descriptive Note : Research rept.,

Corporate Author : MASSACHUSETTS INST OF TECH CAMBRIDGE DEPT OF CIVIL ENGINEERING

Personal Author(s) : Chan,Yu-Po

Report Date : JUL 1969

Pagination or Media Count : 200

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)

Descriptors :   (*TRANSPORTATION, *MANAGEMENT PLANNING AND CONTROL), (*TRAFFIC, MATHEMATICAL MODELS), NETWORKS, ALGORITHMS, TIME, REDUCTION, COSTS, SET THEORY, DECISION MAKING, EQUILIBRIUM(PHYSIOLOGY), THESES

Subject Categories : Administration and Management
      Surface Transportation and Equipment

Distribution Statement : APPROVED FOR PUBLIC RELEASE