...
首页> 外文期刊>Journal of Combinatorial Optimization >An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
【24h】

An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems

机译:松弛算法的扩展,用于解决特殊情况下的电容弧布线问题

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we propose an exact method for solving a special integer program associated with the classical capacitated arc routing problems (CARPs) called split demand arc routing problems (SDARP). This method is developed in the context of monotropic programming theory and bases a promising foundation for developing specialized algorithms in order to solve general integer programming problems. In particular, the proposed algorithm generalizes the relaxation algorithm developed by Tseng and Bertsekas (Math. Oper. Res. 12(4):569–596, 1987) for solving linear programming problems. This method can also be viewed as an alternative for the subgradient method for solving Lagrangian relaxed problems. Computational experiments show its high potential in terms of efficiency and goodness of solutions on standard test problems.
机译:在本文中,我们提出了一种精确的方法,用于解决与经典电容电弧弧布线问题(CARP)相关的特殊整数程序,该问题称为拆分需求弧弧布线问题(SDARP)。该方法是在单向编程理论的背景下开发的,为开发专用算法以解决一般整数编程问题奠定了有希望的基础。特别地,所提出的算法概括了由Tseng和Bertsekas开发的松弛算法(Math。Oper。Res。12(4):569–596,1987),用于解决线性规划问题。该方法也可以看作是解决Lagrangian松弛问题的次梯度方法的替代方法。计算实验显示出其在解决标准测试问题的效率和优良性方面的巨大潜力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号