The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Heuristic Solution to the Large Scale Cellular Telecommunication Network Expansion Problem
Abstract
This chapter proposes a very effective heuristic algorithm to address a variation of the cellular network expansion problem and discusses each algorithm step in detail. Although the input to the algorithm appears to be a binary integer programming problem, the proposed algorithm deals with several nonlinear aspects. The solution specifies the connections of each component, cell sites, hubs, and mobile telephone switching office and satisfies the redundancy requirements for each cell site to ensure continued traffic flow in the event of a local overload or equipment failure. The algorithm reports the best feasible solution it finds, as well as lower and upper bounds on the cost of an exact solution. Preliminary testing indicates that it generates very good results, in spite of its very short execution time. The authors hope that in presenting such an algorithm, designers of very large cellular network expansions will have a tool to obtain significantly good solutions in a reasonable time. In addition, because the expansion problem presented here is a knapsack problem, the authors anticipate that this heuristic might have other applications in solving similar large-scale problems.
Related Content
|
S. Vijay Anand, Sathis Kumar B..
© 2023.
12 pages.
|
|
Sudarson Rama Perumal, Muthumanikandan V., Sushmitha J..
© 2023.
30 pages.
|
|
Sipra Swain, Biswa Ranjan Senapati, Pabitra Mohan Khilar.
© 2023.
31 pages.
|
|
Uma Mageswari R., Nallarasu Krishnan, Mohammed Sirajudeen Yoosuf, Murugan K., Sankar Ram C..
© 2023.
20 pages.
|
|
Divya L., Pradeep Kumar T. S..
© 2023.
15 pages.
|
|
Pradeep Kumar T. S., Vetrivelan P..
© 2023.
15 pages.
|
|
Vanitha Veerasamy, Rajathi Natarajan.
© 2023.
16 pages.
|
|
|