Comparison of Ways to Use Weighted Factors for Developing Vehicle Schedules in a Mass Transit System.

摘要

Traditionally, fleet vehicle schedules for mass transit systems are determined by using a minimum cost flow model. However, with constraints such as an upper bound on the number of lines that a vehicle can service in a vehicle block, the minimum cost flow structure is lost. Two heuristic procedures, a matching-based procedure and a time increment procedure, are developed for scheduling a fleet of vehicles under these additional constraints. These procedures attempt to minimize the average number of lines a vehicle block will traverse while maintaining a high average number of trips per vehicle schedule, low deadhead and waiting times and a minimum number of vehicles to service a timetable. Both procedures minimize a weighted sum cost function and have been tested on two databases including the Monterey-Salinas Transit system in California. Solutions comparable to the present vehicle schedules for the Monterey-Salinas Transit system were obtained using these procedures.