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.