摘要
针对突发灾害事件情景下交通路网容量限定的特点,引用BRP路阻函数求解各路段车辆行驶时间,建立救援路径最短和车辆行驶时间最短双目标车辆调度模型;设计改进离散的萤火虫算法,构建算例对模型求解,求解结果与遗传算法的求解结果进行对比,验证了该算法的可行性和能更好的满足应急救援车辆调度的需要.
In view of the characteristics of traffic networks capacity under the situation of mass emergency, this paper cites the BPR impedance function to solve the vehicle travel time between the various sections. It builds the shortest path and the shortest vehicle scheduling model and designs the improved discrete Glowworm Swarm Optimization Algorithm.It constructs a numerical example to solve the model and the results are compared with the results of genetic algorithm.The feasibility of the algorithm is verified and can better meet the needs of emergency rescue vehicle scheduling.
出处
《计算机系统应用》
2017年第9期188-194,共7页
Computer Systems & Applications
基金
国家自然科学基金(71271138)
教育部人文社会科学青年基金(14YJC630119)
安徽省高校人文社科研究重大项目(SK2014ZD016)
住建部软科学研究项目(2015-R2-057)
关键词
车辆调度
路网容量
萤火虫算法
应急救援
vehicle scheduling
road network capacity
glowworm swarm optimization algorithm
emergency sescue
