Efficient solution of the 3G network planning problem

An attempt of shifting as more people as possible and/or their logistics from a dangerous place to a safer place is an evacuation planning problem. Such problems modeled on network have been extensively studied and the various efficient solution procedures have been established. The solution strategies for these problems are based on source-sink path augmentation and the flow function satisfies the flow conservation at each intermediate node. Besides this, the network flow problem in which flow may not be conserved at node necessarily could also be used to model the evacuation planning problem. This paper proposes a model for maximum flow evacuation planning problem on a single-source-single-sink static network with integral arc capacities with holding capability of evacuees in the temporary shelter at intermediate nodes and extends the model into the dynamic case. Journal of the Institute of Engineering, 2017, 13(1): 108-116

Download Full-text

Dynamic Network Planning of Underground Logistics System on Uncertainty Graph

Mathematical Problems in Engineering ◽

10.1155/2019/1979275 ◽

2019 ◽

Vol 2019 ◽

pp. 1-13 ◽

Cited By ~ 1

Author(s):

YiHua Zhong ◽

ShiMing Luo ◽

Min Bao ◽

XiaoDie Lv

Keyword(s):

Dynamic Programming ◽

Programming Model ◽

Network Planning ◽

Dynamic Network ◽

Planning Problem ◽

Uncertainty Measure ◽

Uncertain Graph ◽

Logistics System ◽

Nanjing City ◽

Dynamic Programming Model

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.

Download Full-text

Genetic Optimization for Optimum 3G Network Planning: an Agent-Based Parallel Implementation

Novel Algorithms and Techniques in Telecommunications and Networking ◽

10.1007/978-90-481-3662-9_32 ◽

2009 ◽

pp. 189-194 ◽

Cited By ~ 1

Author(s):

Alessandra Esposito ◽

Luciano Tarricone ◽

Stefano Luceri ◽

Marco Zappatore

Keyword(s):

Parallel Implementation ◽

Network Planning ◽

Genetic Optimization ◽

Agent Based ◽

3G Network

Download Full-text

Non-conserving Flow Aspect of Maximum Dynamic Flow Problem

Journal of the Institute of Engineering ◽

10.3126/jie.v14i1.20073 ◽

2018 ◽

Vol 14 (1) ◽

pp. 107-114

Author(s):

Phanindra Prasad Bhandari ◽

Shree Ram Khadka

Keyword(s):

Network Flow ◽

Efficient Solution ◽

Flow Problem ◽

Dynamic Network ◽

Maximum Flow ◽

Solution Procedure ◽

Evacuation Planning ◽

Planning Problem ◽

Intermediate Node ◽

Flow Conservation

Shifting as many people as possible from disastrous area to safer area in a minimum time period in an efficient way is an evacuation planning problem (EPP). Modeling the evacuation scenarios reflecting the real world characteristics and investigation of an efficient solution to them have become a crucial due to rapidly increasing number of natural as well as human created disasters. EPPs modeled on network have been extensively studied and the various efficient solution procedures have been established where the flow function satisfies the flow conservation at each intermediate node. Besides this, the network flow problem in which flow may not be conserved at nodes necessarily could also be useful to model the evacuation planning problem. This paper proposes an efficient solution procedure for maximum flow evacuation planning problem of later kind on a single-source-single-sink dynamic network with integral arc capacities with holding capability of flow (evacuees) in the temporary shelter at intermediate nodes. Journal of the Institute of Engineering, 2018, 14(1): 107-114

Download Full-text