Dynamic Network Planning of Underground Logistics System on Uncertainty Graph

YiHua Zhong, ShiMing Luo, Min Bao and XiaoDie Lv

Mathematical Problems in Engineering, 2019, vol. 2019, 1-13

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.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2019/1979275.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2019/1979275.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:1979275

DOI: 10.1155/2019/1979275

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().