Implementation of the enhanced ant colony system algorithm to solve reliable communication network design
DOI:
https://doi.org/10.15587/1729-4061.2022.259693Keywords:
Ant colony system algorithm, reliable communication network design, Monte Carlo methodAbstract
The problem of communication design has been defined as one of the problems that belong to the category of NP-hard problem, and the aim of the topological communication network design is to identify component placement locations and connectivity aspects. On the other hand, the Reliable Communication Network Design (RCND) is a popular optimization problem used for maximizing network reliability. In addition, finding an accurate calculation of RCND explains the problem of NP-hard problem. To this end, literature studies suggested various metaheuristic algorithms that have been used as approximation methods to find the best solution to this problem. Some of these algorithms belong to the Evolutionary Algorithms (EAs) category, such as Genetic Algorithms (GAs), and some belong to the Swarm Intelligence Algorithms (SIAs) category, such as Ant Colony Optimization (ACO). However, to the best of our knowledge, the Ant Colony System (ACS) algorithm, which is considered an updated version of ACO, has not yet been used to design reliability-constrained communication network topologies. Therefore, this study aims to apply the updated version of the ACS algorithm for solving RCND in small, medium, and large networks. The proposed algorithm was benchmarked against present state-of-the-art techniques that address this challenge. The research findings show that the proposed algorithm is an optimal solution for a fully connected small network size (n=6, 7, 8, and 9) and it has been achieved as an optimal solution for all not fully connected sets (n=14, 16, and 20). In each case, the results for medium-sized networks were better than the benchmark results
References
- Watcharasitthiwat, K., Wardkein, P. (2009). Reliability optimization of topology communication network design using an improved ant colony optimization. Computers & Electrical Engineering, 35 (5), 730–747. doi: https://doi.org/10.1016/j.compeleceng.2009.02.006
- Ozkan, O., Ermis, M. (2013). Reliable communication network design with metaheuristics. The International IIE Conference. Available at: https://www.researchgate.net/profile/Omer-Ozkan/publication/263663161_Reliable_communication_network_design_with_metaheuristics/links/5b064f4b4585157f870937c2/Reliable-communication-network-design-with-metaheuristics.pdf
- Ozkan, O., Ermis, M., Bekmezci, I. (2019). Reliable communication network design: The hybridisation of metaheuristics with the branch and bound method. Journal of the Operational Research Society, 71 (5), 784–799. doi: https://doi.org/10.1080/01605682.2019.1582587
- Nesmachnow, S., Cancela, H., Alba, E. (2007). Evolutionary algorithms applied to reliable communication network design. Engineering Optimization, 39 (7), 831–855. doi: https://doi.org/10.1080/03052150701503553
- Yeh, W.-C., Lin, Y.-C., Chung, Y. Y., Chih, M. (2010). A Particle Swarm Optimization Approach Based on Monte Carlo Simulation for Solving the Complex Network Reliability Problem. IEEE Transactions on Reliability, 59 (1), 212–221. doi: https://doi.org/10.1109/tr.2009.2035796
- Fatimah Mohamad Ayop, S., Shahizan Othman, M., Mi Yusuf, L. (2020). Ant Colony Optimization Using Different Heuristic Strategies for Capacitated Vehicle Routing Problem. IOP Conference Series: Materials Science and Engineering, 864 (1), 012082. doi: https://doi.org/10.1088/1757-899x/864/1/012082
- Dorigo, M., Birattari, M., Stutzle, T. (2006). Ant Colony Optimization. IEEE Computational Intelligence Magazine, 1 (4), 28–39. doi: https://doi.org/10.1109/ci-m.2006.248054
- Mutar, M. L., Burhanuddin, M. A., Hameed, A. S., Yusof, N., Mutashar, H. J. (2020). An efficient improvement of ant colony system algorithm for handling capacity vehicle routing problem. International Journal of Industrial Engineering Computations, 11, 549–564. doi: https://doi.org/10.5267/j.ijiec.2020.4.006
- Omar, A. H., Naim, A. A. (2021). New crossover via hybrid ant colony system with genetic algorithm and making study of different crossover for TSP. Journal of Theoretical and Applied Information Technology, 99 (20), 4824–4836. Available at: http://www.jatit.org/volumes/Vol99No20/14Vol99No20.pdf
- Agárdi, A., Kovács, L., Bányai, T. (2021). The Fitness Landscape Analysis of the Ant Colony System Algorithm in Solving a Vehicle Routing Problem. Academic Journal of Manufacturing Engineering, 19 (2), 85–89. Available at: https://ajme.ro/PDF_AJME_2021_2/L11.pdf
- Dengiz, B., Altiparmak, F., Belgin, O. (2010). Design of reliable communication networks: A hybrid ant colony optimization algorithm. IIE Transactions, 42 (4), 273–287. doi: https://doi.org/10.1080/07408170903039836
- Dengiz, B., Alabas-Uslu, C. (2015). A self-tuning heuristic for the design of communication networks. Journal of the Operational Research Society, 66 (7), 1101–1114. doi: https://doi.org/10.1057/jors.2014.74
- Abd-El-Barr, M. (2006). Design and analysis of reliable and fault-tolerant computer systems. World Scientific, 464. doi: https://doi.org/10.1142/p457
- Jan, R.-H. (1993). Design of reliable networks. IEEE International Conference on Communications, 20, 25–34. doi: https://doi.org/10.1109/icc.1992.268264
- Jan, R.-H., Hwang, F.-J., Chen, S.-T. (1993). Topological optimization of a communication network subject to a reliability constraint. IEEE Transactions on Reliability, 42 (1), 63–70. doi: https://doi.org/10.1109/24.210272
- Yeh, W. C. (1994). A New Monte Carlo Method for the Network Reliability. Proceedings of the First International Conference on Information Technology and Applications (ICITA 2002). Available at: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.11.8926&rep=rep1&type=pdf
- Dorigo, M., Gambardella, L. M. (1997). Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1 (1), 53–66. doi: https://doi.org/10.1109/4235.585892
- Socha, K., Knowles, J., Sampels, M. (2002). A MAX-MIN Ant System for the University Course Timetabling Problem. Lecture Notes in Computer Science, 1–13. doi: https://doi.org/10.1007/3-540-45724-0_1
- Stützle, T., Hoos, H. H. (2000). MAX–MIN Ant System. Future Generation Computer Systems, 16 (8), 889–914. doi: https://doi.org/10.1016/s0167-739x(00)00043-1
- Vochozka, M., Horák, J., Krulický, T. (2019). Advantages and Disadvantages of Automated Control Systems (ACS). Digital Age: Chances, Challenges and Future, 416–421. doi: https://doi.org/10.1007/978-3-030-27015-5_50
- Wolpert, D. H., Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1 (1), 67–82. doi: https://doi.org/10.1109/4235.585893
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 Abeer A. Abdul-Razaq, Huda Karem Nasser, Asaad Shakir Hameed, Modhi Lafta Mutar, Haiffa Muhsan B. Alrikabi, Mohammed F. AL-Rifaie, Mustafa Musa Jaber
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.