Generalized a bottleneck routing problem: dynamic programming and the start point optimization

被引：0
|
作者：
Chentsov, Alexei A. [1 ]
Chentsov, Alexander G. [1 ,2 ]
Sesekin, Alexander N. [1 ,2 ]
机构：
[1] Inst Math & Mech UB RAS, Ekaterinburg, Russia
[2] Ural Fed Univ, Ekaterinburg, Russia
来源：
IFAC PAPERSONLINE | 2018年 / 51卷 / 32期
关键词：
Routing problem; nonadditive criterion; dynamic programming;
D O I：
10.1016/j.ifacol.2018.11.412
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
One routing problem with constraints is considered. These constraints are reduced to precedence conditions which be to visiting sequence of megalopolises. This sequence is selected together with concrete trajectory and initial state for minimization of nonadditive criterion. These criterion is some generalization of known criterion for the bottleneck routing problem. The basis singularity of the used solving method consists of using of unique dynamic programming procedure for all initial states. The used criterion includes a controlled parameter influences on significance of different fragments of solution. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
引用
收藏
页码：373 / 377
页数：5
相关论文
共 50 条
12345