Application of simplex method in coast points searching for urban mass transit trains

doi:10.3778/j.issn.1002-8331.2009.14.067

Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (14): 217-219.DOI: 10.3778/j.issn.1002-8331.2009.14.067

• 工程与应用 • Previous Articles Next Articles

Application of simplex method in coast points searching for urban mass transit trains

ZHAO Ya-hui¹,XIE Wei-da²

1.College of Electronic and Information Engineering，Tongji University，Shanghai 200092，China
2.Railway and Urban Mass Transit Research Institute，Tongji University，Shanghai 200092，China

Received:2008-10-22 Revised:2009-01-13 Online:2009-05-11 Published:2009-05-11
Contact: ZHAO Ya-hui

单纯形法在城轨列车惰行点搜索中的应用

赵亚辉¹,谢维达²

1.同济大学电子与信息工程学院，上海 200092
2.同济大学铁道与城市轨道交通研究院，上海 200092

通讯作者: 赵亚辉

Abstract

Abstract: The paper discusses an application of simplex method in coast points searching for urban mass transit trains.Identifying the necessary coast starting points under the constraints of current conditions is not simple as train movement is governed by multiple factors.The characteristic，restricting and solution space etc about coast points searching in inter-station run are analyzed.The approaching of two-dimensional simplex method in coast points searching is introduced in detail.With the aid of a single train simulator，the feasibility and performance of this searching measure in locating coast points are also be investigated according to searching results.

Key words: simplex method, coast points searching, runtime, inter-station run

摘要： 讨论了单纯形优化算法在城市轨道交通列车惰行点搜索方面的应用，列车运行因受多重因素影响，确定必要的惰行起点在实际情况的约束下并不容易。通过分析列车站内运行惰行点搜索特点、约束条件及寻解空间等，详细介绍了二维空间中单纯形法寻找合适列车惰行点的实现过程。借助于单列车仿真系统的帮助，通过问题的寻优结果分析，研究了这种启发式搜索方法在确定惰行点方面的可行性和性能表现。

关键词: 单纯形法, 惰行点搜索, 运行时间, 站间运行

ZHAO Ya-hui¹,XIE Wei-da². Application of simplex method in coast points searching for urban mass transit trains[J]. Computer Engineering and Applications, 2009, 45(14): 217-219.

赵亚辉¹,谢维达². 单纯形法在城轨列车惰行点搜索中的应用[J]. 计算机工程与应用, 2009, 45(14): 217-219.

[1]	SU Hongsheng, YIN Kaile. Nelder-mead simplex method based improved artificial bee colony [J]. Computer Engineering and Applications, 2016, 52(24): 50-56.
[2]	XIE Wenbing1，2, MA Xiaodong1, LI Zhongsheng1, NIU Xiamu2. Detection of buffer overflow by duplication of control flow data [J]. Computer Engineering and Applications, 2016, 52(11): 101-107.
[3]	LI Wenming, CHEN Zhe, LI Xurong, HUANG Zhiqiu. Runtime verification of array bounds overflow of C programs [J]. Computer Engineering and Applications, 2015, 51(11): 190-195.
[4]	YIN Huayi, ZHU Shunzhi, LIU Lizhao. Hybrid electromagnetism-like mechanism algorithm based on simplex method [J]. Computer Engineering and Applications, 2015, 51(10): 1-5.
[5]	WU Qingfeng. Improved iterative calculation methods of simplex algorithm [J]. Computer Engineering and Applications, 2014, 50(18): 59-62.
[6]	LIU Xiaojuan, DENG Ziyuan. Improved nested partitions algorithm and its application in energy-saving coast control [J]. Computer Engineering and Applications, 2013, 49(10): 239-242.
[7]	CHEN Ning, LI Xing. Detection of business constraint based on AOP [J]. Computer Engineering and Applications, 2012, 48(22): 74-78.
[8]	LIU Libin1，OUYANG Aijia2，3，YUE Guangxue2，3，LI Kenli2. Parameters optimization of soil water characteristic curve based on hybrid particle swarm algorithm [J]. Computer Engineering and Applications, 2011, 47(35): 218-221.
[9]	DU Junli，GUO Qingyu. Study on real-time medical image registration based on mutual information [J]. Computer Engineering and Applications, 2011, 47(28): 162-165.
[10]	ZHAO Sheng，WANG Yuanyuan. Runtime prediction and fault-aware oriented grid resource allocation [J]. Computer Engineering and Applications, 2011, 47(16): 65-68.
[11]	OUYANG Aijia1，LIU Libin2，YUE Guangxue1，3，LI Kenli3. Adaptive hybrid particle swarm optimization for solving parameters of pharmacokinetics [J]. Computer Engineering and Applications, 2011, 47(16): 221-225.
[12]	ZHANG Wei-ping，ZHAO Nan-nan，LI Pei-hua. Improved EMD object tracking method [J]. Computer Engineering and Applications, 2010, 46(33): 151-154.
[13]	YE Cheng-xu¹，LI He-cheng^2，3. Genetic algorithm for a class of nonconvex optimization problems [J]. Computer Engineering and Applications, 2009, 45(24): 60-62.
[14]	LIU Chong-yang. Optimize operating conditions in microbial batch culture by improved simplex method [J]. Computer Engineering and Applications, 2008, 44(17): 246-248.
[15]	SHEN Mao-xing^1,2,XU Jin¹. Direct way of simplex method for solving linear programming model [J]. Computer Engineering and Applications, 2007, 43(30): 94-96.

Application of simplex method in coast points searching for urban mass transit trains

单纯形法在城轨列车惰行点搜索中的应用

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics