【24h】

Programming Method for Vehicle Dispatch Problem In Emergency Centre

机译:急救中心车辆调度问题的编程方法

获取原文

摘要

Research on multi-spot emergency combination problems mainly limits to discuss vehicle paths and take into account the condition of time nowadays. However, according to angle of stable reliability and expense in the emergency systems engineering, the number of the emergency vehicles should also be supposed as the optimization goal. An present operation of genetic algorithm operators easily loses the optimal solution, which affects the entire algorithm performance in the emergency central vehicle dispatch problem. On the basis of modeling the vehicle dispatch problem with natural description, this paper combines Genetic Algorithm with Simulated Annealing Algorithm, namely GA-SA. Fitness function, crossover operation and mutation operation are also made the improvement. The computation process has considered own characteristics of the emergency center to enable the algorithm optimized performance to obtain the large scale enhancement. Finally an example is presented to illustrate the algorithm, and satisfactory results are obtained.
机译:对多点应急组合问题的研究主要局限在讨论车辆路径并考虑当今的时间条件。但是,从应急系统工程中稳定可靠和费用昂贵的角度来看,应急车辆的数量也应作为优化目标。遗传算法算子的当前操作容易失去最优解,这影响了紧急中央车辆调度问题中的整个算法性能。在对车辆调度问题进行自然描述建模的基础上,将遗传算法与模拟退火算法GA-SA相结合。适应度功能,交叉操作和变异操作也得到了改进。计算过程考虑了急救中心的自身特点,以使算法的性能得到优化,从而获得大规模的增强。最后给出一个例子说明该算法,并获得满意的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号