快速公交线路组合频率优化的禁忌模拟退火算法仿真  

Simulation of tabu simulated annealing algorithm for optimizing BRT line combination frequency

作　　者：白子建[1] 宋瑞[2] 贺国光[1] 林建新[2] 

机构地区：[1]天津大学系统工程研究所,天津300072 [2]北京交通大学交通运输学院,北京100044

出　　处：《计算机应用研究》2008年第2期355-358,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(70371014);国家“863”计划资助项目(2006AA11Z203)

摘　　要：针对快速公交(BRT)线路组合的频率优化目标,建立了兼顾公交运营效益和乘客服务要求的BRT运营作业安排数学模型。根据问题的特点,将禁忌算法与模拟退火算法相结合,对BRT线路组合的频率进行优化。多次仿真运算结果及分析表明,该算法具有比禁忌算法、模拟退火算法都更好的效率,是解决该类问题的一个有效途径。Focusing on the frequency optimization of BRT line combination, a mathematical model for the arrangement of BRT operation task was set up with attention to bus operation benefit and passenger service requirement. Based on the characteristics of the problem, simulated annealing algorithm was combined with tabu search algorithm to optimize the frequency of BRT line combination. After several simulation experiments and analysis, this algorithm show more efficiency than tabu search algorithm or simulated annealing algorithm separately, and is proved to be an effective approach to solve this kind of problems.

关 键 词：快速公交 线路组合 模拟退火算法 禁忌算法 优化 仿真 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]