Telecommunications network design - Comparison of alternative approaches

Decision Sciences

Volumn 31, Issue 2, 2000, Pages 483-506

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

^a IOWA STATE UNIVERSITY   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c SPRINT NEXTEL   (United States)

Author keywords

Degree constrained Minimum Spanning Tree; Genetic Algorithms; Network Design; Network Modelling; Telecommunications

Indexed keywords

EID: 0034379276     PISSN: 00117315     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1540-5915.2000.tb01631.x     Document Type: Article

References (31)

1. 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.
2. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, applications. Englewood Cliffs, NJ: Prentice Hall.
3. Ahuja, R. K., & Orlin, J. B. (1997). Developing fitter genetic algorithms. INFORMS Journal of Computing, 9(5), 251-253.
4. Back, T., Fogel, D., & Michalawecz, Z. (Eds.). (1997). Handbook of evolutionary computation. Oxford: Oxford University Press.
5. Back, T., & Hoffmeister F. (1991). Extended selection mechanism in genetic algorithms. Proceedings of the Fourth International Conference on Genetic Algorithms, 92-99.
6. Baker, J. E. (1985). Adaptive selection methods for genetic algorithms. In J. J. Grefenstette (Ed.), Proceedings of an International Conference on Genetic Algorithms. Mahwah, NJ: Lawrence Erlbaum Assoc., 101-111.
7. 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. Mahwah, NJ: Lawrence Erlbaum Assoc., 290-299.
8. Coombs, S., & Davis, L. (1987). Genetic algorithms and communication link speed design: Constraints and operators. Proceedings of the Second International Conference on Genetic Algorithms and their Applications, John Grefenstette (Ed.), Boston, MA: Massachusetts Institute of Technology, 257-260.
9. Cuppini, M. (1994). A genetic algorithm for channel assignment problems. European Transactions Telecommunications Related Technologies, 285-294.
10. Davis, L. (1987). Genetic algorithm and simulated annealing. Los Altos, CA: Morgan Kaufmann Publishers.
11. Dengiz, B., Altiparmak, F., & Smith, A. E. (1997). Local search genetic algorithm for optimal design of reliable networks. IEEE Transactions on Evolutionary Computation, 1(3), 179-188.
12. Esbensen, H. (1995). Computing near-optimal solutions to the Steiner problem in a graph using genetic algorithm. Networks, 26(4), 173-185.
13. Gavish, B. (1991). Topological design of telecommunication networks - Local access design methods. Annals of Operations Research, 33, 17-71.
14. Gen, M., & Cheng, R. (1997). Genetic algorithms and engineering design. New York: Wiley Interscience Publication.
15. Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley.
16. Graham, R. L., & Hell, P. (1985). On the history of minimum spanning tree problem. Annals of History of Computing, 7(1), 43-57.
17. Harary, F., & Hayes, J. P. (1996). Node fault tolerance in graphs. Networks, 27(1), 19-23.
18. Holland, J. (1975). Adaptation in natural and artificial systems. Ann Arbor, MI: University of Michigan Press.
19. Kapsalis, A., Rayward-Smith, V. J., & Smith, G. D. (1993). Solving the graphical Steiner tree problem using genetic algorithms. Journal of Operations Research Society, 44(4), 397-406.
20. Kershenbaum, A. (1997). When genetic algorithms work best. INFORMS Journal of Computing, 9(3), 254-255.
21. Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of American Mathematical Society, 7, 48-50.
22. Levine, D. (1997). Genetic algorithms: A practitioner's view. Informs Journal of Computing, 9(3), 256-259.
23. Narula, S. C., & Ho, C. A. (1980). Degree-constrained minimum spanning tree. Computers and Operations Research, 7, 239-249.
24. Obruca, A. K. (1968). Spanning tree manipulation and the travelling-salesman problem. Computer Journal, 10, 374-377.
25. Oyman, A. I., & Solvinf, C. E. (1994). Concentrator location-problems using genetic algorithms. Proceedings of the Seventh Mediterranean Electrotechnical Conference, 3, 1341-1344.
26. Palmer, C. C., & Kershenbaum, A. (1995). An approach to a problem in network design using genetic algorithms. Networks, 26(3), 151-163.
27. Prim, R. C. (1957). Shortest connection networks and some generalizations. Bell Systems Technology Journal, 36, 1389-1401.
28. Reeves, C. (1997). Genetic algorithms for the operations researcher. Informs Journal of Computing, 9(5), 231-250.
29. Savelsbergh, M., & Volgenant, T. (1985). Edge exchanges in the degree-constrained spanning tree problem. Computers and Operations Research, 12, 341-348.
30. Syswerda, G. (1989). Uniform crossover in genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms, Norwich, Norfolk, UK, 202-206.
31. Zhou, G., & Gen, M. (1997). A note on genetic algorithms for degree constrained spanning tree problems. Networks, 30(2), 91-97.