Enhancing the behavior of the ant algorithms to solving network planning problem

2005 ◽  
Author(s):  
L.F. Ibrahim ◽  
O. Metwaly ◽  
K. Kapel ◽  
A. Ahmed
Keyword(s):  
Network Planning ◽  
Planning Problem ◽  
Ant Algorithms

Efficient solution of the 3G network planning problem

2012 ◽  
Vol 63 (4) ◽  
pp. 819-830 ◽  
Author(s):  
Marc St-Hilaire ◽  
John W. Chinneck ◽  
Steven Chamberland ◽  
Samuel Pierre
Keyword(s):  
Efficient Solution ◽  
Network Planning ◽  
Planning Problem ◽  
3G Network

scholarly journals Dynamic Network Planning of Underground Logistics System on Uncertainty Graph

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
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.

Robust multi-objective optimization for solving the RFID network planning problem

2021 ◽  
Vol 8 (4) ◽  
pp. 616-626
Author(s):  
S. Ait Lhadj Lamin ◽  
◽  
A. Raghib ◽  
B. Abou El Majd ◽  
◽  
...  
Keyword(s):  
Radio Frequency ◽  
Radio Frequency Identification ◽  
New Technology ◽  
Network Planning ◽  
Environmental Parameters ◽  
Planning Problem ◽  
Optimization Approach ◽  
Optimal Solutions ◽  
Multi Objective Optimization ◽  
Multi Objective

Radio-frequency identification (RFID) is a new technology used for identifying and tracking objects or people by radio-frequency waves to facilitate automated traceability and data collection. The RFID system consists of an electronic tag attached to an object, readers, and a middleware. In the latest real applications based on the RFID technology, the deployment of readers has become a central issue for RFID network planning by means of optimizing several objectives such as the coverage of tags, the number of readers, and the readers/tags interferences. In practice, the system is affected by uncertainty and uncontrollable environmental parameters. Therefore, the optimal solutions to the RFID network planning problem can be significantly reduced with uncontrollable variations in some parameters, such as the reader's transmitted power. In this work, we propose a robust multi-objective optimization approach to solve the deployment of RFID readers. In this way, we achieve robust optimal solutions that are insensitive to uncertainties in the optimization parameters.

Enhancing the DBSCAN and Agglomerative Clustering Algorithms to Solve Network Planning Problem

2009 ◽  
Author(s):  
Lamia Fattouh Ibrahim ◽  
Weam M. Minshawi ◽  
Isra Yosef Ekkab ◽  
Nehal Mahmoud Al-Jurf ◽  
Afnan Salem Babrahim ◽  
...  
Keyword(s):  
Clustering Algorithms ◽  
Network Planning ◽  
Planning Problem ◽  
Agglomerative Clustering
Sign in / Sign up

Export Citation Format

Share Document