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 条
  • [1] Elements of Dynamic Programming in Local Improvement Constructions for Heuristic Solutions of Routing Problems with Constraints
    Petunin, A. A.
    Chentsov, A. A.
    Chentsov, A. G.
    Chentsov, P. A.
    AUTOMATION AND REMOTE CONTROL, 2017, 78 (04) : 666 - 681
  • [2] Elements of dynamic programming in extremal routing problems
    Chentsov, A. A.
    Chentsov, A. G.
    Chentsov, P. A.
    AUTOMATION AND REMOTE CONTROL, 2014, 75 (03) : 537 - 550
  • [3] Elements of dynamic programming in extremal routing problems
    A. A. Chentsov
    A. G. Chentsov
    P. A. Chentsov
    Automation and Remote Control, 2014, 75 : 537 - 550
  • [4] A Semidefinite Programming Heuristic for Quadratic Programming Problems with Complementarity Constraints
    Stephen Braun
    John E. Mitchell
    Computational Optimization and Applications, 2005, 31 : 5 - 29
  • [5] A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
    Braun, S
    Mitchell, JE
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2005, 31 (01) : 5 - 29
  • [6] A Dynamic Programming Based Improvement Heuristic for a Repetitive Routing Problem of Grasp-and-Delivery Robots
    Shurbevski, Aleksandar
    Karuno, Yoshiyuki
    Nagamochi, Hiroshi
    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2012, 6 (05): : 611 - 621
  • [7] APPLICATION OF DYNAMIC PROGRAMMING TO ROUTING PROBLEMS
    JEFFERIS, RP
    FEGLEY, KA
    IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1965, SSC1 (01): : 21 - +
  • [8] HEURISTIC IMPROVEMENT OF THE DYNAMIC-PROGRAMMING TREATMENT OF THE TSP
    IVANEK, J
    MORAVEK, J
    EKONOMICKO-MATEMATICKY OBZOR, 1981, 17 (01): : 12 - 27
  • [9] Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints
    Dubois, D
    Fortemps, P
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 160 (03) : 582 - 598
  • [10] Dynamic programming and solvability of bottleneck routing problem with resource constraints
    Chentsov, A. G.
    Chentsov, A. A.
    VESTNIK UDMURTSKOGO UNIVERSITETA-MATEMATIKA MEKHANIKA KOMPYUTERNYE NAUKI, 2022, 32 (04): : 569 - 592
12345