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

A. A. Petunin; A. A. Chentsov; A. G. Chentsov; P. A. Chentsov

doi:10.1134/S0005117917040087

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.¹^,2, Chentsov P.A.¹^,2
Мекемелер:
1. Ural Federal University
2. Institute of Mathematics and Mechanics
Шығарылым: Том 78, № 4 (2017)
Беттер: 666-681
Бөлім: System Analysis and Operations Research
URL: https://ogarev-online.ru/0005-1179/article/view/150578
DOI: https://doi.org/10.1134/S0005117917040087
ID: 150578

Дәйексөз келтіру

Толық мәтін

Ашық рұқсат
Рұқсат жабық

Рұқсат берілді
Рұқсат жабық

Тек жазылушылар үшін

Аннотация
Авторлар туралы
Әдебиет тізімі
Қосымша файлдар
Статистика

Аннотация

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.