Reliability optimization of topology communication network design using an improved ant colony optimization

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.

[1]  Samuel Pierre,et al.  Topological design of computer communication networks using simulated annealing , 1995 .

[2]  Alice E. Smith,et al.  Economic design of reliable networks , 1998 .

[3]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[4]  George S. Fishman A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness , 1986, IEEE Transactions on Reliability.

[5]  Darko Skorin-Kapov,et al.  On minimum cost isolated failure immune networks , 1994, Telecommun. Syst..

[6]  R. Jan,et al.  Topological optimization of a communication network subject to a reliability constraint , 1993 .

[7]  Rong-Hong Jan Design of reliable networks , 1993, Comput. Oper. Res..

[8]  David W. Coit,et al.  A Monte-Carlo simulation approach for approximating multi-state two-terminal reliability , 2005, Reliab. Eng. Syst. Saf..

[9]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[10]  Michael Ball,et al.  Backtracking Algorithms for Network Reliability Analysis , 1977 .

[11]  Ali M. Rushdi On Reliability Evaluation by Network Decomposition , 1984, IEEE Transactions on Reliability.

[12]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[13]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[14]  Fred W. Glover,et al.  Least-cost network topology design for a new service , 1991, Ann. Oper. Res..

[15]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[16]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[17]  K.W.E. Cheng,et al.  An improved ant colony optimization algorithm and its application to electromagnetic devices designs , 2005, IEEE Transactions on Magnetics.

[18]  V. K. Jayaraman,et al.  Ant Colony Approach to Continuous Function Optimization , 2000 .

[19]  Patrick R. McMullen,et al.  Ant colony optimization techniques for the vehicle routing problem , 2004, Adv. Eng. Informatics.

[20]  Anup Kumar,et al.  A genetic algorithm for distributed system topology design , 1995 .