首页> 外文OA文献 >Optimizing Route for Hazardous Materials Logistics Based on Hybrid Ant Colony Algorithm
【2h】

Optimizing Route for Hazardous Materials Logistics Based on Hybrid Ant Colony Algorithm

机译:基于杂交蚁群算法的危险材料物流优化路径

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Optimizing Route for Hazardous Materials Logistics (ORHML) belongs to a class of problems referred to as NP-Hard, and a strict constraint of it makes it harder to solve. In order to dealing with ORHML, an improved hybrid ant colony algorithm (HACA) was devised. To achieve the purpose of balancing risk and cost for route based on the principle of ACA that used to solve TSP, the improved HACA was designed. Considering the capacity of road network and the maximum expected risk limits, a route optimization model to minimize the total cost is established based on network flow theory. Improvement on route construction rule and pheromone updating rule was adopted on the basis of the former algorithm. An example was analyzed to demonstrate the correctness of the application. It is proved that improved HACA is efficient and feasible in solving ORHML.
机译:优化危险材料物流(ORHML)的优化路由属于一类被称为NP-Hard的问题,严格的限制使其更加难以解决。为了处理orhml,设计了一种改进的混合蚁群算法(HACA)。为了基于用于解决TSP的ACA原理,达到平衡风险和航线成本的目的,设计了改进的HACA。考虑到道路网络的能力和最大预期风险限制,基于网络流动理论建立了最小化总成本的路线优化模型。在前算法采用了路线施工规则和信息素更新规则的改进。分析了一个例子以证明应用的正确性。事实证明,改善的HACA在溶解孤立葡萄酒中是有效和可行的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号