z-logo
open-access-imgOpen Access
Novel model for integrated demand-responsive transit service considering rail transit schedule
Author(s) -
Yingjia Tan,
Bo Sun,
Li Guo,
Binbin Jing
Publication year - 2022
Publication title -
mathematical biosciences and engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.451
H-Index - 45
eISSN - 1551-0018
pISSN - 1547-1063
DOI - 10.3934/mbe.2022577
Subject(s) - schedule , transit (satellite) , transport engineering , computer science , integer programming , service (business) , operations research , public transport , pickup , ant colony optimization algorithms , heuristic , engineering , business , algorithm , marketing , artificial intelligence , image (mathematics) , operating system
This research aims to develop an optimization model for optimizing demand-responsive transit (DRT) services. These services can not only direct passengers to reach their nearest bus stops but also transport them to connecting stops on major transit systems at selected bus stops. The proposed methodology is characterized by service time windows and selected metro schedules when passengers place a personalized travel order. In addition, synchronous transfers between shuttles and feeder buses were fully considered regarding transit problems. Aiming at optimizing the total travel time of passengers, a mixed-integer linear programming model was established, which includes vehicle ride time from pickup locations to drop-off locations and passenger wait time during transfer travels. Since this model is commonly known as an NP-hard problem, a new two-stage heuristic using the ant colony algorithm (ACO) was developed in this study to efficiently achieve the meta-optimal solution of the model within a reasonable time. Furthermore, a case study in Chongqing, China, shows that compared with conventional models, the developed model was more efficient formaking passenger, route and operation plans, and it could reduce the total travel time of passengers.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here