IDEAS home Printed from https://ideas.repec.org/a/agr/journl/v8(561)y2011i8(561)p17-30.html
   My bibliography  Save this article

Optimum Repartition of Transport Capacities in the Logistic System using Dynamic Programming

Author

Listed:
  • Gheorghe BĂŞANU

    (Bucharest Academy of Economic Studies)

  • Victor TELEAŞĂ

    (Bucharest Academy of Economic Studies)

  • Eduard ARMEANU

    (Bucharest Academy of Economic Studies)

Abstract

Transportations take an essential role in logistics, interconnecting the majority of processes and operations within logistic system. The efficient use of transportation capacity is a priority whose achievement can diminish logistic costs. This objective is today difficult to achieve due to increasing complexity of transportation monitoring and coordination. This complexity is determined by transportation number and diversity, by the volume and diversity of orders, by increasing the targets to be supplied. Dynamic programming represents a highly useful tool for logistic managers, considering that its specific techniques and methods are oriented toward solving problems related to resource optimum allocation and utilization. The present paper presents briefly a series of theoretical elements of dynamic programming applied in logistics, based on which it is shown a mathematic model to determine the optimum policy for transport capacity repartition for the area attached to a logistic centre, through three distribution centres.

Suggested Citation

  • Gheorghe BĂŞANU & Victor TELEAŞĂ & Eduard ARMEANU, 2011. "Optimum Repartition of Transport Capacities in the Logistic System using Dynamic Programming," Theoretical and Applied Economics, Asociatia Generala a Economistilor din Romania - AGER, vol. 0(8(561)), pages 17-30, August.
    • Handle: RePEc:agr:journl:v:8(561):y:2011:i:8(561):p:17-30
    as

    Download full text from publisher

    File URL: http://store.ectap.ro/articole/622.pdf
    Download Restriction: no
    File URL: http://www.ectap.ro/articol.php?id=622&rid=77
    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:agr:journl:v:8(561):y:2011:i:8(561):p:17-30. 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: Marin Dinu (email available below). General contact details of provider: https://edirc.repec.org/data/agerrea.html .

    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.