A Heuristic Algorithm Based on Travel Demand for Transit Network Design

Yuan Liu, Heshan Zhang (), Tao Xu and Yaping Chen
Additional contact information
Yuan Liu: College of Traffic and Transportation, Chongqing Jiaotong University, Chongqing 400074, China
Heshan Zhang: College of Traffic and Transportation, Chongqing Jiaotong University, Chongqing 400074, China
Tao Xu: College of Traffic and Transportation, Chongqing Jiaotong University, Chongqing 400074, China
Yaping Chen: Department of Civil Engineering Design, Chongqing Architectural Design Limited Company, Chongqing 401122, China

Sustainability, 2022, vol. 14, issue 17, 1-17

Abstract: This study proposes a simultaneous optimization model that considers flow assignment and vehicle capacity for the problem of transit network design to determine the route structure and frequencies simultaneously. The problem is focused on reducing the total travel time and the number of transfers. A heuristic algorithm is developed to solve this problem. In the proposed algorithm, the initial routes are generated according to a changing demand matrix, which can reflect the real-time demand with transfers and ensure that the direction of route generation maximizes the percentage of direct service. A regulating method for a sequence of stops is used during route generation to guarantee the shortest trip time for a formed route. Vehicles are allocated to each route according to the flow share. The concept of vehicle difference is introduced to evaluate the distinction between actual allocated vehicles and required vehicles for each route. The optimization process of frequencies based on vehicle difference can ensure that the solution meets the constraints. Two scale networks are used to illustrate the performances of the proposed method. Results show that route structure and frequencies can be optimized simultaneously through the proposed method. Different scenarios are created to test the algorithm properties via various parameter values. The test result indicates that the upper bound is a key parameter to balance the proportion of direct service and average in-vehicle travel time (AIVTT), and the increased number of planning routes can improve the proportion of direct service.

Keywords: heuristics; transportation; transit network design; simultaneous optimization (search for similar items in EconPapers)
JEL-codes: O13 Q Q0 Q2 Q3 Q5 Q56 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.mdpi.com/2071-1050/14/17/11097/pdf (application/pdf)
https://www.mdpi.com/2071-1050/14/17/11097/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jsusta:v:14:y:2022:i:17:p:11097-:d:907291

Access Statistics for this article

Sustainability is currently edited by Ms. Alexandra Wu

More articles in Sustainability from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().