OPTIMAL SCHEDULING OF URBAN TRANSIT SYSTEMS USING GENETIC ALGORITHMS

Proper scheduling increases the efficiency of the public transport system and minimizes the waiting time of passengers as well as the transfer time from one route to another. Optimal scheduling, however, is extremely difficult due to the large number of variables and constraints, the discrete nature of variables, and the nonlinearities involved in the objective function and the constraints. In this paper, the authors use genetic algorithms to solve the scheduling problem at one transfer station. The main advantage of using genetic algorithms is that the problem can be reformulated in a manner that is computationally more efficient than the original problem. Results from a number of test problems demonstrate their effectiveness in finding optimal scheduling solutions with reasonable computational resources. A number of extensions to the present problem are presented and plausible solution techniques using genetic algorithms are discussed. Genetic algorithms have been proven as a solution tool for similar optimization problems in transportation systems.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00712769
  • Record Type: Publication
  • Files: TRIS, ATRI
  • Created Date: Oct 26 1995 12:00AM