IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/1979275.html
   My bibliography  Save this article

Dynamic Network Planning of Underground Logistics System on Uncertainty Graph

Author

Listed:
  • YiHua Zhong
  • ShiMing Luo
  • Min Bao
  • XiaoDie Lv

Abstract

When designing the underground logistics system, it is necessary to consider the uncertainty of logistics nodes, high cost, and high risk. This paper employed the theories of uncertain graph and dynamic programming to solve the network planning problem of underground logistics system. Firstly, we proposed the concepts of uncertainty measure matrix and vertices structure uncertainty graph by using uncertainty measure and uncertainty graph. Secondly, vertices structure uncertainty graph of the underground logistics system was constructed based on our proposed vertices structure uncertainty graph and the uncertainty of logistics nodes. Thirdly, the dynamic programming model of the underground logistics system was established, and its solution algorithm was also designed by improving simulated annealing. Finally, the correctness and feasibility of the method was validated by using a numerical example of the underground logistics system in Xianlin district, Nanjing City in China.

Suggested Citation

  • YiHua Zhong & ShiMing Luo & Min Bao & XiaoDie Lv, 2019. "Dynamic Network Planning of Underground Logistics System on Uncertainty Graph," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-13, October.
    • Handle: RePEc:hin:jnlmpe:1979275
    DOI: 10.1155/2019/1979275
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/1979275.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2019/1979275.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2019/1979275?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:1979275. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.