Modeling and Analysis for Optimization Mode of City Bus Operator Scheduling Management

Article Preview

Abstract:

This paper proposes a bus route scheduling management model based on Ant Colony Optimization and traditional scheduling model. It optimizes the existing bus route scheduling management model according to Ant Colony algorithm, enhances the performance of both Ant Colony algorithm and the traditional scheduling model, and improves the optimal performance of the combining algorithm. The experiment results show that, the proposed algorithm can effectively deal with the bus route scheduling management, and the optimization result obtained is obviously better than the traditional algorithms. Furthermore, it solve the problems exist in the traditional algorithms, therefore has great application value.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3220-3223

Citation:

Online since:

February 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Zhong Xueling Wang Xiongzhi. Open vehicle routing problem of hybrid algorithm [J] computer simulation, preceding 2011: 207-210.

Google Scholar

[2] Xie Binglei, li, Guo Yaohuang. Full of vehicle scheduling problem with time Windows genetic algorithm [J]. Journal of systems engineering, 2000, 15 (3) : 290 ~ 294.

Google Scholar

[3] liang, Luo Wenjian. Based on the ecological predator-prey model of multi-objective optimization problem solving algorithm [J]. Journal of China university of science and technology, 2005, 35 (3) : 360-366.

Google Scholar

[4] Liu Fanghua Zhao Jianmin, Xu Huiying. Logistics distribution path optimization research based on mergers and acquisitions algorithm [J]. Computer and digital engineering, 2009, 37 (8) : 25 to 28.

Google Scholar

[5] LangMaoXiang. Logistics distribution route optimization problem based on genetic algorithm research [J]. China journal of highway, 2002 (15) 3: 7 6 ~ 79.

Google Scholar