Digital data networks design using genetic algorithms

European Journal of Operational Research

Volumn 127, Issue 1, 2000, Pages 140-158

  Chu, Chao Hsien ^a,b   Premkumar, G ^a   Chou, Hsinghua ^a,c  

^a IOWA STATE UNIVERSITY   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c SPRINT NEXTEL   (United States)

Author keywords

Genetic algorithms; Network design; Tabu search; Telecommunications

Indexed keywords

EID: 0012806972     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00329-X     Document Type: Article

References (58)

1. Abuali, F.N., Schoenefeld, D.A., Wainwright, R.L., 1993. The design of a multipoint line topology for a communication network using genetic algorithms. Proceedings of the Seventh Oklahoma Conference on Artificial BL Intelligence, 101-110.
2. Abuali, F.N., Wainwright, R.L., Schoenefeld, D.A., 1995. Determinant factorization: A new encoding scheme for spanning trees applied to the probabilistic minimum spanning tree problem. Proceedings of the Sixth International Conference on Genetic Algorithms, 470-477.
3. Aggarwal, C.C., Orlin, J.B., Tai, R.P., 1997. Optimized crossover for the independent set problem. Operations Research 45, 226-234.
4. Ahuja, R.K., Orlin, J.B., 1997. Developing fitter genetic algorithms. INFORMS Journal of Computing 9 (5), 251-253.
5. Ahuja, R.K., Magnauti, T.L., Orlin, J.B., 1993. Network Flows: Theory Algorithms Applications. Prentice-Hall, Englewood Cliffs, NJ.
6. Anderson, C., Fraughnaugh, K., Parker, M., Ryan, J., 1993. Path assignment for call routing: An application of Tabu search. Annals of Operations Research 43, 301-312.
7. Back, T., Hoffmeister, F., 1991. Extended selection mechanism in genetic algorithms. Proceedings of the Fourth International Conference on Genetic Algorithms, 92-99.
8. Back, T., Fogel, D., Michalawecz, Z. (Eds.), 1997. Handbook of Evolutionary Computation. Oxford University Press, Oxford.
9. Beasley, J.E., 1990. OR Library, Imperial College, UK. URL: mscmga.ms.ic.ac.uk/info.html.
10. Chang, C.-C., Wu, W.-B., 1997. Efficient path and vertex exchange in Steiner tree algorithms. Networks 29 (2), 81-92.
11. Charddaire, P., Kapsalis, A., Mann, J.W., Rayward-Smith, V.J., Smith, G.D., 1995. Applications of genetic algorithms in telecommunications. Proceedings of the Second International Workshop on Applications of Neural Networks to Telecommunications, 290-299.
12. Chopra, S., Rao, M.R., 1989. On the Steiner tree problem I & II. Working Paper, New York University.
13. Coombs, S., Davis, L., 1987. Genetic algorithms and communication link speed design: Constraints and operators. In: Grefenstette, J.J. (Ed.), Proceedings of the Second International Conference on Genetic Algorithms and their Applications, pp. 257-260.
14. Cuppinim, M., 1994. A genetic algorithm for channel assignment problems. European Transactions on Telecommunications Related Technologies, 285-294.
15. Davis, L., Coombs, S., 1989. Optimizing network link sizes with genetic algorithms. Modeling and Simulation Methodology, 317-331.
16. Esbensen, H., 1995. Computing near-optimal solutions to the Steiner problem in a graph using genetic algorithm. Networks 26 (4), 173-185.
17. Gen, M., Cheng, R., 1997. Genetic Algorithms and Engineering Design. Wiley, New York, 1997.
18. Glover, F., 1989. Tabu search - part I. ORSA Journal of Computing 3, 190-206.
19. Glover, F., 1994. Genetic algorithms and scatter search: Unsuspected potentials. Statistics and Computing 4, 131-140.
20. Glover, F., Lee, M., Ryan, J., 1991. Least cost network topology design for a new service: An application of Tabu search. Annals of Operations Research 33, 351-362.
21. Glover, F., Kelly, P.J., Laguna, M., 1995. Genetic algorithms and Tabu search. Computers and Operations Research 22 (1), 111-134.
22. Glover, F., Laguna, M., 1993. Tabu search. In: Reeves, C. (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Basil Blackwell, Oxford.
23. Glover, F., Laguna, M., 1997. Tabu Search. Kluwer Academic Publishers, Boston, MA.
24. Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA.
25. Hansen, P., 1986. The steepest ascent mildest descent heuristic for combinatorial programming. Numerical Methods in Combinatorial Optimization, Capri, Italy.
26. Hertz, A., Taillard, E., de Werra, D., 1996. Tabu Search, Local Search in Combinatorial Optimization. Wiley, Chichester.
27. Hesser, J., Manner, R., Stucky, O., 1989. Optimization of Steiner trees using genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms, 231-236.
28. Holland, J., 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI.
29. Hoelting, C., Schoenfeld, D., Wainwright, R., 1996. A genetic algorithm for the minimum broadcast time problem using a global precedence vector. Proceedings of the ACM Symposium on Applied Computing, 258-262.
30. Hwang, F.K., Richard, D.S., Winter, P., 1992. The Steiner tree problem. Annals of Discrete Mathematics 53, 59-85.
31. Kapsalis, A., Rayward-Smith, V.J., Smith, G.D., 1993. Solving the graphical Steiner tree problem using genetic algorithms. Journal of the Operations Research Society 44 (4), 397-406.
32. Karunanithi, N., Carpenter, T., 1993. A ring loading application of genetic algorithms. Technical Report TM-ARH-023337, Bellcore, Bell Communication Research, Red Bank, NJ.
33. Kershenbaum, A., 1997. When genetic algorithms work best. INFORMS Journal of Computing 9 (3), 254-255.
34. Kruskal, J.B., 1956. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7, 48-50.
35. Kumar, G.P., Babu, G.P., 1994. Optimal network partitioning for fault-tolerant network management using evolutionary programming. Information Processing Letters 25, 145-149.
36. Laguna, M.J., Glover, F., 1993. Bandwidth packing: A Tabu search approach. Management Science 39 (4), 492-500.
37. Lee, Y., Chiu, S.Y., Ryan, J., 1996. A branch and cut algorithm for Steiner tree-star problem. INFORMS Journal on Computing 8 (3), 100-120.
38. Lee, Y., Lu, L., Qiu, Y., Glover, F., 1994. Strong formulations and cutting planes for designing digital data networks. Telecommunication Systems 2, 261-274.
39. Liu, X., Sakamoto, A., Shimamoto, T., 1994. Genetic channel router. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences 3, 492-501.
40. Marin, F.J., Gonzalez, F.J., Sandoval, F., 1994. The routing problem in traffic control using genetic algorithms. Proceedings of the Second IFAC Symposium on Intelligent Components and Instruments for Control Application, 8-10.
41. Michalawecz, Z., 1992. Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin.
42. Murgu, A., Lahdelma, R., 1995. Tracking statistics in communication traffic control using a genetic algorithm. Proceedings of the First Nordic Workshop on Genetic Algorithms and Their Applications, 241-258.
43. Oyman, A.I., Solvinf, C.E., 1994. Concentrator location-problems using genetic algorithms. Proceedings of the Seventh Mediterranean Electrotechnical Conference 3, 1341-1344.
44. Palmer, C.C., Kershenbaum, A., 1995. An approach to a problem in network design using genetic algorithms. Networks 26 (3), 151-163.
45. Prim, R.C., 1957. Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389-1401.
46. Sharaiha, Y.M., Gendreau, M., Laporte, G., Osman, I.H., 1997. A Tabu search algorithm for the capacitated shortest spanning tree problem. Networks 29, 161-171.
47. Shimamoto, N., Hiramatsu, A., Yamasaki, K., 1993. Dynamic routing control based on a genetic algorithm. Proceedings of IEEE International Conference on Neural Networks, 1123-1128.
48. Sinclair, M.C., 1993. The application of a genetic algorithm to trunk network routing table optimization. Proceedings of the Tenth UK Teletraffic Symposium, 2-6.
49. Skorin-Kapov, J., 1990. Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing 2, 33-45.
50. Skorin-Kapov, D., Skorin-Kapov, J., 1994. On Tabu search for the location of interacting hub facilities. European Journal of Operational Research 73, 502-509.
51. Smith, J.M., Lee, D.T., Liebman, J.S., 1981. An O(n log n) Heuristic for Steiner minimal tree problems on the Euclidean metric. Networks 11 (1), 23-39.
52. Tan, T.K., Pollard, J.K., 1995. Determination of minimum number of wavelength required for all-optical WDM networks using graph coloring. Electronic Letters, 1895-1897.
53. UEA CALMA Group, 1994. Genetic algorithms approaches to solving the radio link frequency assignment problem. Technical Report 56, University of East Anglia, Norwich.
54. Winter, P., 1987. Steiner problem in networks: A survey. Networks 17 (2), 129-167.
55. Winter, P., Zachariasen, M., 1997. Euclidean Steiner minimum trees: an improved exact algorithm. Networks 30 (3), 149-166.
56. Xu, J., Chiu, S.Y., Glover, F., 1996. Using Tabu search to solve the Steiner tree-star problem in telecommunication networks design. Telecommunication Systems 6 (2), 117-127.
57. Zelikovsky, A.Z., 1993. A faster approximation algorithm for the Steiner tree problem in graph. Information Processing Letters 46, 79-83.
58. Zhou, G., Gen, M., 1996. A note in genetic algorithms for degree constrained spanning tree problems. Networks 30 (2), 91-97.