| 面向全自动控制交通系统的车辆调度算法 |
| |
| 引用本文： | 李爽a,杨明b,王春香a,王冰b. 面向全自动控制交通系统的车辆调度算法[J]. 上海交通大学学报, 2017, 51(2): 174 |
| |
| 作者姓名： | 李爽a 杨明b 王春香a 王冰b |
| |
| 作者单位： | 上海交通大学 a. 机器人研究所；b. 自动化系，上海市北斗导航与位置服务重点实验室，上海 200240 |
| |
| 基金项目： | 国家自然基金重大研究计划（91420101），国家自然科学基金项目（61174178/51178268）资助 |
| |
| 摘 要： | 结合遗传算法和贪婪算法的优点,提出了聚类贪婪遗传算法,构建了一个全自动控制交通系统的仿真系统;针对遗传算法、贪婪算法和聚类贪婪遗传算法分别进行实验,并比较其实验结果.结果表明:当系统趋于稳定时,聚类贪婪遗传算法能够提高叫车请求的平均响应时间,从而避免叫车请求饿死的情况;聚类贪婪遗传算法可用于全自动控制交通系统车辆的调度.
|
| 关 键 词： | 车辆 调度 全自动控制交通系统 聚类贪婪遗传算法 仿真系统 |
Scheduling Algorithm for Vehicles in Cybernetic Transportation System |
| |
| LI Shuanga,YANG Mingb,WANG Chunxianga,WANG Bingb. Scheduling Algorithm for Vehicles in Cybernetic Transportation System[J]. Journal of Shanghai Jiaotong University, 2017, 51(2): 174 |
| |
| Authors: | LI Shuanga YANG Mingb WANG Chunxianga WANG Bingb |
| |
| Affiliation: | a. Research Institute of Robotics; b. Department of Automation, Shanghai Key Laboratory of
Navigation and Location Services, Shanghai Jiao Tong University, Shanghai 200240, China |
| |
| Abstract: | Combining the advantage of greedy algorithm with that of genetic algorithm, this paper presents a new algorithm named proximity cluster greedy and genetic algorithm. This paper also designs a simulation system for cybernetic transportation system to test all the three algorithms and collect the experiment results. The results show that when the system tends to be steady, the proximity cluster greedy and genetic algorithm can efficiently decrease the response time and avoid the requests’ starving, so this algorithm is a good choice for the cybernetic transportation system. |
| |
| Keywords: | vehicles scheduling cybernetic transportation system (CTS) proximity cluster reedy and genetic algorithm simulation system |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《上海交通大学学报》浏览原始摘要信息 |
|
点击此处可从《上海交通大学学报》下载全文 |
