Research on the High-Speed Railway Energy-Saving Operation Strategy Based on Heuristic Algorithm

Article Preview

Abstract:

High-speed Railway Energy-saving Operation is a NP complete problem and it’s difficult to seek the optimal solution by tradition method. In this paper, considering the influence braking utilization to train operation, we established a high-speed railway minimum energy cost model, in which the optimization objective are maximizing the Interval efficiency and minimizing the total energy consumption. Then the model is solved by heuristic algorithm and the operation strategies are gotten. The simulation experiment result showed that when the braking utilization is equal to 0, the energy will be largely saved if the operation time is increased slightly; with the increasing of braking utilization, the percentage of saved energy will decrease correspondingly. So, the high-speed railway energy-saving operation strategy based on heuristic algorithm performed well.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2155-2159

Citation:

Online since:

September 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] P. Chen. Heuristic Algorithm and the Application in Vehicle Routing Problem. [D]. Beijing: Beijing jiaotong university, (2009).

Google Scholar

[2] X.J. Zhou. Analysis on Effect of Low Carbon Environmental Protection of High-Speed Railway Train [J]. Energy and Power. 2013, 34(3): 212-216.

Google Scholar

[3] HongTao Z, Tao W, Qi Z. A heuristic algorithm for dispatching policy based on Vague Set's evaluation and optimization[C]/Intelligent Control and Information Processing (ICICIP), 2013 Fourth International Conference on. IEEE, 2013: 19-24.

DOI: 10.1109/icicip.2013.6568032

Google Scholar

[4] M.Q. Quan. Model of Cyclic Train Timetable [J]. Journal of the China Railway ocitedy. 2009, 31(4): 7-13.

Google Scholar

[5] T. Wang, A Method for Generation and Optimization of Train Operation Adjustment Plan Based on Alternative Graph, China Railway Sciences, 2013, 34(5): 126-133.

Google Scholar

[6] Xingye Dong, Hongkuan Huang, Ping Chen. An improved NEH-base heuristic for the permutation flowshop problem [J], Computers & Operations Research, 2008, 35(12): 3962-3968.

DOI: 10.1016/j.cor.2007.05.005

Google Scholar

[7] Wang Meihua, Tian Xuhong, Chang Shan, et al. Hybrid ant colony optimization algorithm for two echelon vehicle routing optimization[J]. Procedia Engineering, 2011, 15: 3361-3365.

DOI: 10.1016/j.proeng.2011.08.630

Google Scholar

[8] Mojtaba Heydar, Matthew E.H. Petering, Dietrich R. Bergmann. Mixed integer programming for minimizing the period of a cyclic railway timetable for a single track with two train types[J]. Computers & Industrial Engineering, 2013, 66: 171-185.

DOI: 10.1016/j.cie.2013.06.003

Google Scholar