首页> 外文会议>IEEE International Conference on Industrial Engineering and Engineering Management >Optimization of forest vehicle routing using reactive tabu search metaheuristic
【24h】

Optimization of forest vehicle routing using reactive tabu search metaheuristic

机译:基于反应禁忌元启发式算法的森林车辆路径优化

获取原文

摘要

Forest vehicle routing is an important step in optimization of forest transportation system to minimize the total cost. To perform this work, we propose a mathematical model and use a reactive tabu search metaheuristic approach. The objective is to minimize the total cost by respecting the time window of all customers which is sometimes important in this field. Finally, the experimental results obtained with the reactive tabu search metaheuristic approach of the named vehicle routing problem is showed, and compared to its extended great deluge results.
机译:森林车辆路线选择是优化森林运输系统以最大程度降低总成本的重要步骤。为了完成这项工作,我们提出了一个数学模型,并使用了反应性禁忌搜索元启发式方法。目的是通过尊重所有客户的时间窗口来最小化总成本,这在该领域有时很重要。最后,给出了使用反应性禁忌搜索元启发式方法求解命名车辆路径问题的实验结果,并与扩展后的大量洪水结果进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号