Author
Listed:
- Yingxin Liu
- Xinggang Luo
- Shengping Cheng
- Yang Yu
- Jiafu Tang
- Xuanzhu Shang
- Tingsong Wang
Abstract
Dynamic bus scheduling refers to adjusting the departure time according to the latest time-varying information or adjusting bus speed in the process of operation. These control strategies can prevent bus bunching and alleviate traffic pressure. The paper studies the multiline bus dynamic scheduling with consideration of departure time and speed meanwhile. The hyperheuristic algorithm is proposed, and low-level heuristics (LLH) operators are designed. The simulation experiment is performed for the passenger flow distribution of different strengths and types of different scenarios. By comparing the experimental results of genetic algorithm (GA) and hyperheuristic algorithm in solving different scenarios, the results show that in smooth, increasing, decreasing, and multiconvex passenger flow mode, the performance of the hyperheuristic algorithm is higher than that of GA. The promotion rate reaches 18∼28%, and especially the average value of the hyperheuristic algorithm designed under multiconvex passenger flow is up to 28.62%, significantly reducing passengers’ waiting time. By comparing the stability of the three passenger flow modes, the results illustrate that the stability of the hyperheuristic algorithm is lower than that of GA. For the smooth passenger flow mode, the stability of medium and lower density of GA is higher than that of the hyperheuristic algorithm. In comparison, the high-density stability of the hyperheuristic algorithm is better than that of GA.
Suggested Citation
Yingxin Liu & Xinggang Luo & Shengping Cheng & Yang Yu & Jiafu Tang & Xuanzhu Shang & Tingsong Wang, 2022.
"Comparison of Two Algorithms for Multiline Bus Dynamic Dispatching,"
Discrete Dynamics in Nature and Society, Hindawi, vol. 2022, pages 1-13, January.
Handle:
RePEc:hin:jnddns:2086717
DOI: 10.1155/2022/2086717
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnddns:2086717. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.