Heuristic Scheduling Procedures for PRT System

Abstract

While rapid transit systems have been suggested as alternatives to our automobile clogged cities, they have faced a problem in providing passengers with the type of service that they expect from their automobile. In an effort to provide for a rapid transit system that offers the advantages of the automobile but has greater capacity, the Morgantown Personal Rapid Transit System was conceived. A Personal Rapid Transit (PRT) system is characterized by relatively small vehicles that provide direct station to station travel without intervening stops. Service is essentially provided on demand much the same way as an elevator operates. In order to compete with the automobile, the PRT must be operated as efficiently as possible in order to keep passenger waiting time to a minimum. This paper is concerned with the development of efficient scheduling algorithms which will keep passenger waiting times at an acceptable level while providing for efficient usage of the system. Before examining these procedures, a brief description of the Morgantown PRT system will be given.