IDEAS home Printed from https://ideas.repec.org/a/scn/009530/14049287.html
   My bibliography  Save this article

Задача Оптимального Планирования Работ По Обновлению Железнодорожной Линии: Постановка, Алгоритмы Решения

Author

Listed:
  • Петровец Юрий Олегович
  • Андрианов Дмитрий Леонидович

Abstract

Рассмотрена задача долгосрочного оптимального планирования работ по обновлению железнодорожной инфраструктуры. Предложен алгоритм решения задачи, основанный на идее метода ветвей и границ и применении динамического программирования для получения нижних оценок ветвей.The paper presents the long-term optimal control problem arising in planning of railway infrastructure renewal. The paper also considers the method of solving based on the idea of branch and bound algorithm using dynamic programming approach to obtain bounds.

Suggested Citation

  • Петровец Юрий Олегович & Андрианов Дмитрий Леонидович, 2013. "Задача Оптимального Планирования Работ По Обновлению Железнодорожной Линии: Постановка, Алгоритмы Решения," Проблемы управления, CyberLeninka;Общество с ограниченной ответственностью "СенСиДат-Контрол", issue 1, pages 50-56.
    • Handle: RePEc:scn:009530:14049287
    as

    Download full text from publisher

    File URL: http://cyberleninka.ru/article/n/zadacha-optimalnogo-planirovaniya-rabot-po-obnovleniyu-zheleznodorozhnoy-linii-postanovka-algoritmy-resheniya
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:scn:009530:14049287. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CyberLeninka (email available below). General contact details of provider: http://cyberleninka.ru/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.