结合遗传算法和贪婪算法的优点,提出了聚类贪婪遗传算法,构建了一个全自动控制交通系统的仿真系统;针对遗传算法、贪婪算法和聚类贪婪遗传算法分别进行实验,并比较其实验结果.结果表明:当系统趋于稳定时,聚类贪婪遗传算法能够提高叫车请求的平均响应时间,从而避免叫车请求饿死的情况;聚类贪婪遗传算法可用于全自动控制交通系统车辆的调度.
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.