RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Avtomat. i Telemekh., 2017, Issue 4, Pages 106–125 (Mi at14773)  

This article is cited in 2 scientific papers (total in 2 papers)

System Analysis and Operations Research

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

A. A. Petunina, A. A. Chentsovb, A. G. Chentsovba, P. A. Chentsovba

a Ural Federal University, Yekaterinburg, Russia
b Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Yekaterinburg, Russia

Abstract: 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.

Keywords: dynamic programming, route, precedence constraints.

Funding Agency Grant Number
Russian Academy of Sciences - Federal Agency for Scientific Organizations
Ministry of Education and Science of the Russian Federation 02.03.21.0006
This work was supported by the Program of the Presidium of the Russian Academy of Sciences in Optimal Control “Mathematical Problems of Modern Control Theory”, “Synthesizing Controls with Incomplete Data, the Reachability Problem, and Dynamic Optimization”; Proposition 211 of the Russian Government, contract no. 02.A03.21.0006.


Full text: PDF file (1841 kB)
First page: PDF file
References: PDF file   HTML file

English version:
Automation and Remote Control, 2017, 78:4, 666–681

Bibliographic databases:

Presented by the member of Editorial Board: . . 

Received: 13.10.2014

Citation: A. A. Petunin, A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints”, Avtomat. i Telemekh., 2017, no. 4, 106–125; Autom. Remote Control, 78:4 (2017), 666–681

Citation in format AMSBIB
\Bibitem{PetCheChe17}
\by A.~A.~Petunin, A.~A.~Chentsov, A.~G.~Chentsov, P.~A.~Chentsov
\paper Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
\jour Avtomat. i Telemekh.
\yr 2017
\issue 4
\pages 106--125
\mathnet{http://mi.mathnet.ru/at14773}
\elib{http://elibrary.ru/item.asp?id=28903797}
\transl
\jour Autom. Remote Control
\yr 2017
\vol 78
\issue 4
\pages 666--681
\crossref{https://doi.org/10.1134/S0005117917040087}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000399415600008}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85017475080}


Linking options:
  • http://mi.mathnet.ru/eng/at14773
  • http://mi.mathnet.ru/eng/at/y2017/i4/p106

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. G. Chentsov, A. A. Chentsov, “Modelnyi variant zadachi o posledovatelnoi utilizatsii istochnikov izlucheniya (iteratsii na osnove optimiziruyuschikh vstavok)”, Izv. IMI UdGU, 50 (2017), 83–109  mathnet  crossref  elib
    2. Petunin A.A. Chentsov A.G. Chentsov P.A., “Optimizing Insertions in a Constraint Routing Problem With Complicated Cost Functions”, J. Comput. Syst. Sci. Int., 58:1 (2019), 113–125  crossref  isi  scopus
  • Avtomatika i Telemekhanika
    Number of views:
    This page:282
    References:29
    First page:25

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019