Genetic algorithm approach for transit route planning and design
Document Type
Article
Publication Date
5-1-2001
Abstract
The problem of determining an optimal feeder bus route, feeding a major intermodal transfer station (or a central business district), in a service area is considered. Subject to geographic, capacity, and budget constraints, a total cost function, consisting of user and supplier costs, is developed for determining the optimal bus route location and its headway considering intersection delays, irregular grid street patterns, heterogeneous demand distributions, and realistically geographic variations. The criterion for the optimality is to minimize the total cost objective function. The number of feasible bus routes increases drastically with the increased number of the links (streets), and thus this problem is computationally intractable for realistic urban networks. This paper presents examples and demonstrates that the proposed genetic algorithm efficiently converges to the optimal solution, which is validated by the optimal solution obtained by applying an exhaustive search algorithm.
Identifier
0035340928 (Scopus)
Publication Title
Journal of Transportation Engineering
External Full Text Location
https://doi.org/10.1061/(ASCE)0733-947X(2001)127:3(200)
ISSN
0733947X
First Page
200
Last Page
207
Issue
3
Volume
127
Recommended Citation
Chien, Steven; Yang, Zhaowei; and Hou, Edwin, "Genetic algorithm approach for transit route planning and design" (2001). Faculty Publications. 15181.
https://digitalcommons.njit.edu/fac_pubs/15181