基于并行遗传算法的智能公交排班研究  

Research on Intelligent Schedule of Public Traffic Vehicles Based on Parallel Genetic Algorithm

作　　者：衷明[1] 

机构地区：[1]同济大学交通运输工程学院,上海201804

出　　处：《计算机时代》2011年第12期18-20,共3页Computer Era

摘　　要：智能公交排班问题是公交车辆智能调度的一个典型问题之一。它可以描述为:利用某种智能化算法,在有限的步骤内,找出所有满足约束条件的最优或者接近最优的排班方案。由于排班问题搜索规模巨大,传统算法在短时间内难以获得高质量可行解。文章引入并行遗传算法,对三种主流并行模型进行评价分析,并设计了求解车辆排班问题的粗粒度并行遗传算法,编制了算法实现程序。Intelligent schedule of traffic vehicles is a typical problem for public traffic vehicle＇s intelligent dispatch. It can be described as finding the best or close to the best alternative among all the schedule methods that can meet the restricted condition with limited calculation processes through a certain intelligent arithmetic. Because of the wild scale of the schedule problem, solution with high quality can hardly be reached within a certain time. To improve this situation, this paper introduced Parallel Genetic Algorithm. Three major parallel models were evaluated and analyzed and a coarse-gained GA was designed to solve the intelligent schedule problem. Program of the algorithm was given in the end.

关 键 词：智能公交排班 智能算法 并行遗传算法 粗粒度模型 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]