摘要
建立了客运站到发线使用的0-1规划模型,并用蚁群算法求解.用理论最优目标函数值与目标函数值的比值表达信息素,用列车使用到发线权值的倒数表达启发式信息,用2-opt的方法实现局部搜索.为提高解的性能和算法的收敛速度,按所处时段的列车密集程度和对其它列车的影响程度由大到小排序,再按该顺序求解.用哈尔滨站的实际数据验证了提出的方法的有效性.
A 0-1 programming passenger station was algorithm, the pheromone is model and for utilization of arrival and departure tracks in a railroad the model was solved by an ant colony algorithm. In the with the ratio of the theoretically optimal objective function value to the actual objective function value, the heuristics information is defined as the reciprocal of weight of trains, and local searches are realized by a 2-opt method. Trains in a station are sorted according to the density of trains in a concerned time period and its influences on other trains to improve the solutions and for quick convergence of the algorithm. Then the sorted train sequence is taken as the order to obtain the solution to the model. The feasibility of the proposed method was verified by data from Harbin railroad passenger station.
出处
《西南交通大学学报》
EI
CSCD
北大核心
2008年第2期153-158,共6页
Journal of Southwest Jiaotong University
基金
国家自然科学基金资助项目(60776826)
关键词
到发线运用计划
0-1规划
蚁群算法
铁路
客运站
utilization of arrival and departure tracks
0-1 programming
ant colony algorithm
railroad
passenger station