首页> 外文会议>International conference on mechatronics and applied mechanics >Study on Vehicle Routing and Scheduling Problems in Underground Mine Based on Adaptively ACA
【24h】

Study on Vehicle Routing and Scheduling Problems in Underground Mine Based on Adaptively ACA

机译:基于自适应ACA的地下矿区车辆路由和调度问题研究

获取原文

摘要

For vehicle routing optimization problem in the underground mine, a famous NP- Hard problem is put forward. This paper uses improved ant colony algorithm (ACA) to solve the problem. Basic ant colony algorithm (ACA) has many shortages, such as long searching time, slow convergence rate and easily limited to local optimal solution etc. The improved ant colony algorithm is proposed to overcome these shortcomings and improve its performance adaptively. In every iteration of the ant colony algorithm, adaptive evaporating coefficient is selected to control the convergence rate at first. And the power of this approach was demonstrated on a test case. The results derived from basic ACA and the improved ACA are compared and analyzed in the experiment. It proved that the improved ant colony algorithm is effective.
机译:对于地下矿区的车辆路由优化问题,提出了着名的NP-Hard问题。本文采用改进的蚁群算法(ACA)来解决问题。基本蚁群算法(ACA)具有许多短缺,如长的搜索时间,慢收敛速度,并且容易限制为局部最佳解决方案等。提出了改进的蚁群算法以克服这些缺点并自适应地提高其性能。在蚁群算法的每一次迭代中,选择自适应蒸发系数以首先控制收敛速率。在测试案例上证明了这种方法的力量。在实验中比较和分析源自碱性ACA和改进的ACA的结果。事实证明,改进的蚁群算法是有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号