首页> 外文会议>International Conference on Green Energy and Sustainable Development >Ant Colony Algorithm Improvement of AGV Path Based on Soft Time Window for Waste Tobacco Recovery
【24h】

Ant Colony Algorithm Improvement of AGV Path Based on Soft Time Window for Waste Tobacco Recovery

机译:基于软时间窗口的废弃烟草恢复基于软时间窗口的蚁群算法改进

获取原文

摘要

According to the site layout of cigarette industry and the requirement of AGV soft time window for waste tobacco recycling, the change of demand for waste tobacco recycling based on soft time window ant colony algorithm is proposed. The method is based on the waste smoke recovery centered on the unit station, Considering the influence of the actual production rhythm of complex Workshop on the recovery demand time, the membership function of the time when AGV arrives at the waste smoke recovery station is used to characterize the satisfaction of the unit station to the timeliness of the waste smoke recovery business. Therefore, with the average satisfaction of AGV arrival time as the constraint condition and the minimum cost of recycling time as the objective, an optimization model of smoke recycling path with fuzzy soft time window is established, and the model is solved by ant colony algorithm. The validity and robustness of the path optimization model are verified by an example.
机译:根据卷烟行业的网站布局和AGV软时间窗口的废弃烟草回收的要求,提出了基于软时间窗蚁群算法的废弃烟草回收需求的变化。该方法基于在单位站上以储存的垃圾回收,考虑到复杂车间实际生产节律对恢复需求的影响,AGV到达废物烟雾回收站时的成员函数表征单位站的满足感到废烟回收业务的及时性。因此,随着AGV到达时间的平均满意度作为限制条件和回收时间的最小成本作为目标,建立了模糊软时间窗口的烟雾回收路径的优化模型,并通过蚁群算法解决了模型。通过示例验证了路径优化模型的有效性和鲁棒性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号