首页> 外文会议>International Conference on Computational Materials Science >Application Research about the Chaos Ant Colony Algorithm in Emergency Logistics Distribution Routing Optimization
【24h】

Application Research about the Chaos Ant Colony Algorithm in Emergency Logistics Distribution Routing Optimization

机译:关于紧急物流分布路由优化的混沌蚁群算法的应用研究

获取原文

摘要

In this essay, the solution about emergency logistics distribution routing optimization has been analyzed by quantitative methods, and the mathematic model focusing on trying the best to shorten distribution time has been established, in which the actual situations of the pathways and the shortage of goods at each affected point have been considered in order to keep further close to the real circumstances where had suffered disaster. Using the Chaos Ant Colony Algorithm solves the mathematic model. The experimental simulation indicates that the arithmetic is feasible and effective to settle the problem about the optimization of emergency logistics distribution route.
机译:在本文中,通过定量方法分析了关于紧急物流分布路由优化的解决方案,并建立了重点阐述最佳分配时间的数学模型,其中途径的实际情况和货物的短缺已经考虑了每个受影响的观点,以便进一步接近遭受灾难的真实情况。使用Chaos蚁群算法解决了数学模型。实验模拟表明算术是可行的,有效地解决了关于应急物流分配路线优化的问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号