A hybrid algorithm for Urban transit schedule optimization

被引:39
|
作者
Tang, Jinjun [1 ]
Yang, Yifan [1 ]
Qi, Yong [2 ]
机构
[1] Cent S Univ, Sch Traff & Transportat Engn, Smart Transport Key Lab Hunan Prov, Changsha 410075, Hunan, Peoples R China
[2] Nanjing Univ Sci & Technol, Sch Comp Sci & Engn, Nanjing 210094, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Urban transit; Departure schedule; Model optimization; Genetic algorithm (GA); Simulated annealing algorithm (SAA); BUS; MODEL; TIME; SYNCHRONIZATION; CAPACITY; DESIGN; DELAY;
D O I
10.1016/j.physa.2018.08.017
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Designing reasonable departure schedule is the key step to realize the urban transit priority. It can not only reduce the operating cost of bus company, but also guarantee convenience for passengers. This paper estimates the travel time between bus stations based on the historical trajectory data of the bus, and then combines the number of passengers get on and off at each station to optimize the departure timetable. In addition, several constraints including actual travel time, limited capacity and arrival time distribution type are considered in the optimization models to effectively and comprehensively estimate the passenger waiting time. Finally, a hybrid algorithm combining Genetic Algorithm (GA) and Simulated Annealing Algorithm (SAA) is proposed to search optimal solution in scheduling model. A case study is applied to testify the effectiveness of proposed models. In the experiments, we compare optimization results of proposed method to traditional genetic algorithms, and the results show the superiority and feasibility of the hybrid optimization approach. (C) 2018 Published by Elsevier B.V.
引用
收藏
页码:745 / 755
页数:11
相关论文
共 50 条
  • [31] RESEARCH ON OPTIMIZATION OF URBAN MASS TRANSIT NETWORK SCHEDULE BASED ON COORDINATION OF CONNECTING TIME BETWEEN DIFFERENT LINES
    Fang, Xiaohong
    Zhou, Leishan
    Xia, Ming
    PROCEEDINGS OF THE ASME JOINT RAIL CONFERENCE, VOL 2, 2010, : 465 - +
  • [32] A grid planning method for large urban rail transit using hybrid genetic algorithm
    Han L.D.
    Yang J.
    Wang J.
    Advances in Transportation Studies, 2023, 3 (Special Issue): : 67 - 78
  • [33] Solving the Urban Transit Routing Problem using a particle swarm optimization based algorithm
    Kechagiopoulos, Panagiotis N.
    Beligiannis, Grigorios N.
    APPLIED SOFT COMPUTING, 2014, 21 : 654 - 676
  • [34] Hybrid Stop Schedule of Urban Rail Train
    Tan, Zheng-min
    Cheng, Jie
    Peng, Qi-yuan
    Gan, Mi
    JOURNAL OF INDUSTRIAL ENGINEERING AND MANAGEMENT-JIEM, 2015, 8 (01): : 267 - 279
  • [35] Hybrid Random Regret Minimization and Random Utility Maximization in the Context of Schedule-Based Urban Rail Transit Assignment
    Li, Dewei
    Gao, Yufang
    Li, Ruoyi
    Zhou, Weiteng
    JOURNAL OF ADVANCED TRANSPORTATION, 2018,
  • [36] A novel hybrid optimization algorithm: Dynamic hybrid optimization algorithm
    Mohammad Yassami
    Payam Ashtari
    Multimedia Tools and Applications, 2023, 82 : 31947 - 31979
  • [37] A novel hybrid optimization algorithm: Dynamic hybrid optimization algorithm
    Yassami, Mohammad
    Ashtari, Payam
    MULTIMEDIA TOOLS AND APPLICATIONS, 2023, 82 (21) : 31947 - 31979
  • [38] Hybrid Random Regret Minimization and Random Utility Maximization in the Context of Schedule-Based Urban Rail Transit Assignment
    Li, Dewei (dwli.bjtu@163.com), 1600, Hindawi Limited, 410 Park Avenue, 15th Floor, 287 pmb, New York, NY 10022, United States (2018):
  • [39] Optimization of Periodic Train Schedule with Flexible Train Composition during Off-Peak Periods for Urban Rail Transit
    Li, Wei
    Chen, Siqian
    Fan, Wei
    Luo, Qin
    JOURNAL OF TRANSPORTATION ENGINEERING PART A-SYSTEMS, 2024, 150 (10)
  • [40] FMS Schedule Based on Hybrid Swarm Optimization
    Wang, Dongyun
    Lui, Huiqin
    2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 7054 - 7059