Open AccessStudy on the Algorithm for Train Operation Adjustment Based on Ordinal Optimization
Author(s) -
Yongjun Chen,
Jiang Yu,
Leishan Zhou,
Tao Qing
Publication year - 2013
Publication title -
advances in mechanical engineering/advances in mechanical engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.318
H-Index - 40
eISSN - 1687-8140
pISSN - 1687-8132
DOI - 10.1155/2013/175347
Subject(s) - ordinal optimization , train , computer science , mathematical optimization , algorithm , heuristic , function (biology) , plan (archaeology) , mathematics , ordinal regression , artificial intelligence , history , cartography , archaeology , machine learning , geography , evolutionary biology , biology
It is a crucial and difficult problem in railway transportation dispatch mechanism to automatically compile train operation adjustment (TOA) plan with computer to ensure safe, fast, and punctual running of trains. Based on the proposed model of TOA under the conditions of railway network (RN), we take minimum travel time of train as objective function of optimization, and after fast preliminary evaluation calculation on it, we introduce the theory and method of ordinal optimization (OO) to solve it. This paper discusses in detail the implementation steps of OO algorithm. A practical calculation example of Datong-Qinhuangdao (hereinafter referred to as Da-Qin) heavy haul railway is performed with the proposed algorithm to prove that OO can ensure getting good enough solution with high probability. Particularly, for complex optimization problems with large amount of calculation, OO can greatly increase computational efficiency, and it can save at least one order of magnitude of calculation amount than general heuristic algorithm. Thus, the proposed algorithm can well satisfy the requirements in engineering