...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Applied mathematics and computation >Enhanced savings calculation and its applications for solving capacitated vehicle routing problem
【24h】

Enhanced savings calculation and its applications for solving capacitated vehicle routing problem

机译：增强的节省额计算及其在解决拥堵车辆路径问题中的应用

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The vehicle routing problem (VRP) is one of the most explored combinatorial problems in operations research. A very fast and simple algorithm that solves the VRP is the well known Clarke–Wright savings algorithm. In this paper we introduce a new way of merging routes and the corresponding formula for calculating savings. We also apply the enhanced merging to develop a new heuristic – Extended Savings Algorithm (ESA) that dynamically recalculates savings during iterations. Computational results show that, on average ESA gives better solutions than the original savings algorithm. Implementing randomization of some steps of our heuristic we obtained even better results which competes with more complex and well known heuristics. The ESA is further used to generate good routes as part of a setcovering-based algorithm for the Capacitated VRP (CVRP). The numerical results of our experiments are reported.
机译：车辆路径问题（VRP）是运筹学中研究最多的组合问题之一。解决VRP的一种非常快速且简单的算法是著名的Clarke-Wright节省算法。在本文中，我们介绍了一种合并路线的新方法以及用于计算节省的相应公式。我们还应用了增强的合并功能来开发新的启发式-扩展储蓄算法（ESA），该算法在迭代过程中动态地重新计算储蓄。计算结果表明，平均而言，ESA比原始的节省算法提供了更好的解决方案。通过对我们的启发式算法的某些步骤进行随机化，我们获得了更好的结果，可以与更复杂和众所周知的启发式算法竞争。作为Capacitated VRP（CVRP）的基于setcovering的算法的一部分，ESA还用于生成良好的路由。报告了我们实验的数值结果。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号