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

Нестационарная Задача Управления Маршрутом Транспортного Средства

Author

Listed:
  • Бронштейн Ефим Михайлович

    (Уфимский государственный авиационный технический университет)

  • Давлетбаев Арвид Артурович

    (Уфимский государственный авиационный технический университет)

Abstract

Рассмотрена задача построения циклического маршрута, по которому можно доставить однородный груз от некоторого множества производителей потребителям с минимальными затратами, используя транспортное средство ограниченной вместимости. Предполагается, что стоимость транспортировки груза между пунктами зависит от времени. Построена соответствующая линейная целочисленная модель. Проведен вычислительный эксперимент.The problem of constructing a cyclic route with minimal transport cost for delivering a homogeneous cargo from a set of producers to consumers by limited capacity vehicle is considered. It is assumed that the cost of transportation between points depends on time. The corresponding integer linear model is constructed. Computer experiments were carried out.

Suggested Citation

  • Бронштейн Ефим Михайлович & Давлетбаев Арвид Артурович, 2014. "Нестационарная Задача Управления Маршрутом Транспортного Средства," Проблемы управления, CyberLeninka;Общество с ограниченной ответственностью "СенСиДат-Контрол", issue 3, pages 23-28.
  • Handle: RePEc:scn:009530:15580278
    as

    Download full text from publisher

    File URL: http://cyberleninka.ru/article/n/nestatsionarnaya-zadacha-upravleniya-marshrutom-transportnogo-sredstva
    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:15580278. 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.