Optimization of a feeder-bus route design by using a multiobjective programming approach
This paper presents a feeder-bus route design model, capable of minimizing route length, minimizing maximum route travel time of planned routes, and maximizing service coverage for trip generation. The proposed model considers constraints of route connectivity, subtour prevention, travel time upper bound of a route, relationships between route layout and service coverage, and value ranges of decision variables. Parameter uncertainties are dealt with using fuzzy numbers, and the model is developed as a multiobjective programming problem. A case study of a metro station in Taichung City, Taiwan is then conducted. Next, the programming problem in the case study is solved, based on the technique for order preference by similarity to ideal solution approach to obtain the compromise route design. Results of the case study confirm that the routes of the proposed model perform better than existing routes in terms of network length and service coverage. Additionally, increasing the number of feeder-bus routes decreases maximum route travel time, increases service coverage, and increases network length. To our knowledge, the proposed model is the first bus route design model in the literature to consider simultaneously various stakeholder needs and support for bus route planners in developing alternatives for further evaluation efficiently and systematically.
Year of publication: |
2014
|
---|---|
Authors: | Lin, Jen-Jia ; Wong, Huei-In |
Published in: |
Transportation Planning and Technology. - Taylor & Francis Journals, ISSN 0308-1060. - Vol. 37.2014, 5, p. 430-449
|
Publisher: |
Taylor & Francis Journals |
Saved in:
Saved in favorites
Similar items by person
-
Structural Analysis of How Urban Form Impacts Travel Demand: Evidence from Taipei
Lin, Jen-Jia, (2009)
-
A bikeway network design model for urban areas
Lin, Jen-Jia, (2013)
-
Analysis of property prices before and after the opening of the Taipei subway system
Lin, Jen-Jia, (2004)
- More ...