Abstract
Network design problem is a well-known NP-hard problem which involves the selection of a subset of possible links or a network topology in order to minimize the network cost subjected to the reliability constraint. To overcome the problem, this paper proposes a new efficiency algorithm based on the conventional ant colony optimization (ACO) to solve the communication network design when considering both economics and reliability. The proposed method is called improved ant colony optimizations (IACO) which introduces two addition techniques in order to improve the search process, i.e. neighborhood search and re-initialization process. To show its efficiency, IACO is applied to test with three different topology network systems and its results are compared with those obtained results from the conventional approaches, i.e. genetic algorithm (GA), tabu search algorithm (TSA) and ACO. Simulation results, obtained these test problems with various constraints, shown that the proposed approach is superior to the conventional algorithms both solution quality and computational time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.