TY - JOUR
T1 - Genetic algorithm approach for transit route planning and design
AU - Chien, Steven
AU - Yang, Zhaowei
AU - Hou, Edwin
PY - 2001/5
Y1 - 2001/5
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0035340928&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0035340928&partnerID=8YFLogxK
U2 - 10.1061/(ASCE)0733-947X(2001)127:3(200)
DO - 10.1061/(ASCE)0733-947X(2001)127:3(200)
M3 - Article
AN - SCOPUS:0035340928
SN - 0733-947X
VL - 127
SP - 200
EP - 207
JO - Journal of Transportation Engineering
JF - Journal of Transportation Engineering
IS - 3
ER -