Design of reliable communication networks: A hybrid ant colony optimization algorithm

IIE Transactions (Institute of Industrial Engineers)

Volumn 42, Issue 4, 2010, Pages 273-287

  Dengiz, Berna ^a   Altiparmak, Fulya ^b   Belgin, Onder ^c  

^a BASKENT UNIVERSITY   (Turkey)

^b GAZI UNIVERSITY   (Turkey)

^c National Productivity Center   (Turkey)

Author keywords

All terminal reliability; Ant colony optimization; Communication networks; Monte Carlo simulation; Simulated annealing

Indexed keywords

ANT-COLONY OPTIMIZATION; COMMUNICATION NETWORKS; COMPUTATIONAL RESULTS; DESIGN PROBLEMS; DISCOVERY ALGORITHM; HEURISTIC APPROACH; HYBRID ANT COLONY OPTIMIZATION; HYBRID APPROACH; LOCAL MINIMUMS; MONTE CARLO SIMULATION; OPTIMAL NETWORK TOPOLOGY; PROBABILISTIC SOLUTION; RELIABLE COMMUNICATION; TERMINAL RELIABILITY; TOTAL COSTS;

ANNEALING; COMMUNICATION; COMPUTER SIMULATION; DESIGN; ELECTRIC NETWORK TOPOLOGY; MONTE CARLO METHODS; PROBABILISTIC LOGICS; RELIABILITY; TELECOMMUNICATION NETWORKS;

SIMULATED ANNEALING;

EID: 77649328258     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170903039836     Document Type: Article

References (50)

1. Aarts, E. and Lenstra, J.K. (1997) Local Search in Combinatorial Optimization, Wiley, New York, NY.
2. AboElfotoh, H.M. and Al-Sumait, L.S. (2001) A neural approach to topological optimization of communication networks, with reliability constraints. IEEE Transasctions on Reliability, 50(4), 397-408.
3. Aggarwal, K.K., Chopra, Y.C. and Bajwa, J.S. (1982) Topological layout of links for optimizing the overall reliability in a computer communication system. Microelectronics and Reliability, 22, 347-351.
4. Altiparmak, F., Dengiz, B. and Smith, A.E. (2003) Optimal design of reliable computer networks: a comparison ofmetaheuristics. Journal of Heuristics, 9(6), 471-487.
5. Atiqullah, M.M. and Rao, S.S. (1993) Reliability optimization of communication networks using simulated annealing. Microelectronics and Reliability, 33, 1303-1319.
6. Bontoux, B. and Feillet, D. (2008) Ant colony optimization for the traveling purchaser problem. Computers & Operations Research, 35(2), 628-637.
7. Boorstyn, R.R. and Frank, H. (1977) Large-scale network topological optimization. IEEE Transasctions onCommunications, 25(1), 29-47.
8. Chen, C.H. and Ting, C.J. (2005) A hybrid ant colony system for vehicle routing problem with time windows. Journal of the Eastern Asia Society for Transportation Studies, 6, 2822-2836.
9. Cheng, S.T. (1998) Topological optimization of a reliable communication network. IEEE Transactions on Reliability, 47(3), 225-233.
10. Chopra, Y.C., Sohi, B.S., Tiwari, R.K. and Aggarwal, K.K. (1984) Network topology for maximizing the terminal reliability in a computer communication network. Microelectonics and Reliabiliy, 24, 911-913.
11. Chu, C.H., Premkumar, G. and Chou, H. (2000) Digital data networks design using genetic algorithms. European Journal of Operational Research, 127(1), 140-158.
12. Coit, D.W. and Smith, A.E. (1996) Reliability optimization of seriesparallel systems using a genetic algorithm. IEEE Transactions on Reliability, 45(2), 254-260.
13. Colbourn, C.J. (1987) The Combinatorics of Network Reliability, Oxford University Press, New York, NY.
14. Das, A.K., Arabshahi, P. and Gray, A. (2005) An ant colony system approach for solving the at-least version of the generalized minimum spanning tree problem, in Proceedings of the Swarm Intelligence Symposium, pp. 60-67.
15. Deeter, D.L. and Smith, A.E. (1998) Economic design of reliable networks. IIE Transactions, 30, 1161-1174.
16. Dengiz, B., Altiparmak, F. and Smith, A.E. (1997a) Efficient optimization of all-terminal reliable networks. IEEE Transactions on Reliability, 46(1), 18-26.
17. Dengiz, B., Altiparmak, F. and Smith, A.E. (1997b) Local search genetic algorithm for optimal design of reliable networks. IEEE Transactions on Evolutionary Computation, 1(3), 179-188.
18. Dorigo, M., Maniezzo, V. and Colorni, A. (1996) Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics, Part B: Cybernetics, 26(1), 29-41.
19. Dorigo, M. and Stützle, T. (2004) Ant Colony Optimization, Bradford Books (MIT Press), Cambridge, MA.
20. Garey, M.R. and Johnson, D.S. (1979) Computers and Intractibility: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA.
21. Hu, Y., Jing, T., Feng, Z., Hong, X.L., Hu, X.D. and Yan, G.Y. (2006) ACO-Steiner: ant colony optimization based rectilinear Steiner minimal tree algorithm. Journal of Computer Science and Technology, 21(1), 147-152.
22. Huang, K.L. and Liao, C.J. (2008) Ant colony optimization combined with tabu search for the job shop scheduling problem. Computers & Operations Research, 35(4), 1030-1046.
23. Jan, R.H. (1993) Design of reliable networks. Computers & Operations Research, 20, 25-34.
24. Jan, R.H., Hwang, F.J. and Chen, S.T. (1994) Topological optimization of a communication network subject to reliability constraint. IEEE Transactions on Reliability, 42, 63-70.
25. Kirkpatrick, S., Gerlatt, C.D. and Vecchi, N.P. (1983) Optimization by simulated annealing. Science, 220, 671-680.
26. Koide, T., Shinmori, S. and Ishii, H. (2001) Topological optimization with a network reliability constraint. Discrete AppliedMathematics, 115, 135-149.
27. Konak, A. and Bartolacci, M.R. (2007) Design survivable resilient networks: a stochastic hybrid genetic algorithm approach. Omega, 35, 645-658.
28. Kroese, D.P., Hui, K.P. and Nariai, S. (2007) Network reliability optimization via cross-entropy method. IEEE Transactions on Reliability, 56(2), 275-287.
29. Kulturel-Konak, S., Smith,A.E. and Coit,D.W. (2003) Efficiently solving the redundancy allocation problem using tabu search. IIE Transactions, 35(6), 515-526.
30. Kumar, A., Pathak, R.M. and Gupta, Y.P. (1995) Genetic algorithmbased reliability optimization for computer network expansion. IEEE Transactions on Reliability, 44(1), 63-72.
31. Kumar, A., Pathak, R.M., Gupta,Y.P. and Parsaei,H.R. (1995)Agenetic algorithm for distributed system topology design. Computers and Industrial Engineering, 28, 659-670.
32. Lee, C.Y., Lee, Z.J., Lin. S.W. and Ying, K.C. (2008) An enhanced ant colony optimization applied to capacitated vehicle routing problem. Applied Intelligence, doi:10.1007/s10489-008-0136-9.
33. Liang,Y.C. and Smith, A.E. (2004)Anant colony optimization algorithm for the redundancy allocation problem (RAP). IEEE Transactions on Reliability, 53(3), 417-423.
34. Liao, C.J. and Juan, H.C. (2007) An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Computers & Operations Research, 34(7), 1899-1909.
35. Marquez, J.E.R. and Rocco, C.M. (2008) All-terminal network reliability optimization via probabilistic solution discovery. Reliability Engineering & System Safety, 93, 1689-1697.
36. McKendall, A.R. and Shang, J. (2006) Hybrid ant systems for the dynamic facility layout problem. Computers & Operations Research, 33, 790-803.
37. Menon, S. and Amiri, A. (2006) Multiperiod cellular network design via price-influenced simulated annealing. IEEETransactions on System, Man and Cybernetics: Part B, Cybernetics, 36(3), 600-610.
38. Mutawa, A.M., Alazemi, H.M.K. and Rayes, A. (2009) A novel steadystate genetic algorithm to the reliability optimization design problem of computer networks. International Journal of Network Management, 19, 39-55.
39. Nearchou, A.C. (2004) A novel metaheuristic approach for the flow shop scheduling problem. Engineering Applications in Artificial Intelligence, 17(4), 289-300.
40. Shao, F.M., Shen, X. and Ho, P.H. (2005) Reliability optimization of distributed access networks with constrained total cost. IEEE Transactions on Reliability, 54(3), 421-430.
41. Shyu, S.J., Lin, B.M.T. and Yin, P.Y. (2004) Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time. Computers & Industrial Engineering, 47(2- 3), 181-193.
42. Srivaree-ratana, C., Konak, A. and Smith, A.E. (2002) Estimation of all-terminal network reliability using an artificial neural network. Computers & Operations Research, 29(7), 849-868.
43. Suman, B. and Kumar, P. (2006) A survey of simulated annealing as a tool for single and multiobjective optimization. Journal of the Operational Research Society, 57, 1143-1160.
44. Tan, K.C., Lee, L.H., Zhu, Q.L. and Ou, K. (2001) Heuristicmethods for vehicle routing problem with time windows. Artificial Intelligence in Engineering, 15, 281-295.
45. Tsai, C.F., Tsai, C.W. and Tseng, C.C. (2003) A new and efficient antbased heuristic method for solving the traveling salesman problem. Expert Systems, 20(4), 179-186.
46. Tseng, L.Y. and Chen, S.C. (2006) A hybrid metaheuristic for the resource-constrained project scheduling problem. European Journal of Operational Research, 175, 707-721.
47. Ventetsanopoulos, A.N. and Singh, I. (1986) Topological optimization of communication networks subject to reliability constraints. Problems of Control and Information Theory, 15, 63-78.
48. Yeh, S., Lin, J.S. and Yeh, W.C. (1994) New Monte Carlo method for estimating network reliability, in Proceedings of the 16th International Conference on Computers and Industrial Engineering, Ashikaga, Japan, pp. 723-726.
49. Yu, B., Yang, Z.Z. and Yao, B. (2009) An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research, 196(1), 171-176.
50. Zhou, G. and Gen, M. (2003) A genetic algorithm approach on tree like telecommunication network design problem. Journal of the Operational Research Society, 54, 248-254.