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 条
  • [1] Dynamic programming in the generalized bottleneck problem and the start point optimization
    Chentsov, A. G.
    Chentsov, A. A.
    Sesekin, A. N.
    VESTNIK UDMURTSKOGO UNIVERSITETA-MATEMATIKA MEKHANIKA KOMPYUTERNYE NAUKI, 2018, 28 (03): : 348 - 363
  • [2] 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
  • [3] THE ROUTING PROBLEMS WITH OPTIMIZATION OF THE STARTING POINT: DYNAMIC PROGRAMMING
    Chentsov, A. G.
    Chentsov, P. A.
    IZVESTIYA INSTITUTA MATEMATIKI I INFORMATIKI-UDMURTSKOGO GOSUDARSTVENNOGO UNIVERSITETA, 2019, 54 : 102 - 121
  • [4] A GENERALIZED BOTTLENECK LINEAR-PROGRAMMING PROBLEM
    ACHARY, KK
    SESHAN, CR
    TIKEKAR, VG
    INDIAN JOURNAL OF TECHNOLOGY, 1982, 20 (01): : 5 - 9
  • [5] Solving the routing optimization problem using the dynamic programming method
    Chentsov, AA
    Chentsov, AG
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 1999, 38 (03) : 409 - 420
  • [6] On a bottleneck routing problem
    Sesekin, A. N.
    Chentsov, A. A.
    Chentsov, A. G.
    PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2011, 272 : 165 - 185
  • [7] On a bottleneck routing problem
    A. N. Sesekin
    A. A. Chentsov
    A. G. Chentsov
    Proceedings of the Steklov Institute of Mathematics, 2011, 272 : 165 - 185
  • [8] One bottleneck routing problem
    Sesekin, A. N.
    Chentsov, A. A.
    Chentsov, A. G.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2010, 16 (01): : 152 - 170
  • [9] A BILEVEL BOTTLENECK PROGRAMMING PROBLEM
    MATHUR, K
    PURI, MC
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 86 (02) : 337 - 344
  • [10] Dynamic programming in the problem of decomposition optimization
    Chentsov, AG
    Chentsov, PA
    AUTOMATION AND REMOTE CONTROL, 2002, 63 (05) : 815 - 828
12345