Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints

被引：0
|
作者：
A. A. Petunin
A. A. Chentsov
A. G. Chentsov
P. A. Chentsov
机构：
[1] Ural Federal University,Institute of Mathematics and Mechanics
[2] Ural Branch of the Russian Academy of Sciences,undefined
来源：
Automation and Remote Control | 2017年 / 78卷
关键词：
dynamic programming; route; precedence constraints;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We consider methods for solving routing problems with precedence constraints that use iterative modes based on Bellman insertions while recomputing precedence constraints of the original problem; we assume that the dimension of the latter is sufficiently large, which does not let us, due to complexity of computations, immediately apply dynamic programming in the “global” version.
引用
收藏
页码：666 / 681
页数：15
相关论文
共 50 条
12345