• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Technology Journal >The Study on Hybrid Scheduling Optimizing of Industrial Solid Waste Recycling Vehicle Routing with Time Window
【24h】

The Study on Hybrid Scheduling Optimizing of Industrial Solid Waste Recycling Vehicle Routing with Time Window

机译：有时间窗的工业固体废物回收车辆路径混合调度优化研究

获取原文
       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Industrial Solid Waste Recycling Vehicle Routing problem with Time Window is studied. Based on the characteristics of industrial solid waste recycling and reusing, a vehicle hybrid scheduling optimization model is proposed. In which, Vehicle Routing problem with full load and Vehicle Routing problem with not-full load are combined. The sum of employed vehicle cost, travel cost, handling cost and time penalty cost for waiting or delaying is took as the objective function in the model. Two constraints of time window and maximal vehicle travel length are presented. Finally, an improved ant colony optimization algorithm is proposed for solving the problem. Dalian industrial solid waste recycling network is token as case to verify effective of the proposed model and algorithm. . The result shows that the proposed ant colony algorithm can search the satisfactory solution quickly and efficiently with small error and proposed model can save the number of employed vehicles and total cost.
机译：研究了带有时间窗的工业固体废物回收车辆的路径问题。根据工业固体废物回收再利用的特点，提出了一种车辆混合调度优化模型。其中，将满载车辆路径问题和非满载车辆路径问题组合在一起。模型中将目标车辆的使用成本，行驶成本，搬运成本和等待或延误的时间成本总和作为目标函数。给出了时间窗和最大车辆行驶长度的两个约束。最后，提出了一种改进的蚁群优化算法。以大连工业固体废物回收网络为例，验证了所提出模型和算法的有效性。 。结果表明，所提出的蚁群算法可以快速，有效地寻找满意的解，且误差很小，所提出的模型可以节省使用车辆数量和总成本。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号