Show simple item record

contributor authorSteven Chien
contributor authorZhaowei Yang
contributor authorEdwin Hou
date accessioned2017-05-08T21:04:02Z
date available2017-05-08T21:04:02Z
date copyrightJune 2001
date issued2001
identifier other%28asce%290733-947x%282001%29127%3A3%28200%29.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/37338
description abstractThe 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.
publisherAmerican Society of Civil Engineers
titleGenetic Algorithm Approach for Transit Route Planning and Design
typeJournal Paper
journal volume127
journal issue3
journal titleJournal of Transportation Engineering, Part A: Systems
identifier doi10.1061/(ASCE)0733-947X(2001)127:3(200)
treeJournal of Transportation Engineering, Part A: Systems:;2001:;Volume ( 127 ):;issue: 003
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record