An evolutionary approach to the multi-level capacitated minimum spanning tree problem

Operations Research/ Computer Science Interfaces Series

Volumn 23, Issue , 2003, Pages 99-124

  Gamvros, Ioannis ^a   Raghavan, S ^a   Golden, Bruce ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Capacitated minimum spanning tree; Genetic algorithms; Multi level; Network design

Indexed keywords

EID: 84888769995     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4757-3762-2     Document Type: Article

References (21)

1. Ahuja, R. K., J.B. Orlin, D. Sharma, Multi-Exchange Neighborhood Structures for the Capacitated Minimum Spanning Tree Problem, Mathematical Programming, 91, pp. 71-97,2001.
2. Amberg, A., W. Domschke, S. V. Darmstadt, Capacitated Minimum Spanning Trees: Algorithms Using Intelligent Search, Combinatorial Optimization: Theory and Practice, 1, pp. 9-40, 1996.
3. Berger, D., B. Gendron, J. Y. Potvin, S. Raghavan, P. Soriano, Tabu Search for a Network Loading Problem with Multiple Facilities, Journal of Heuristics, 6(2), pp. 253-267,2000.
4. Bourjolly, J., D. Tomiuk, G.H. M. Kapantow, Using Simulated Annealing to Minimize the Cost of Centralized Telecommunications Networks, INFOR, 37(3), 1999.
5. Esau, L. R., K. C. Williams, On Teleprocessing System Design: Part II, IBM System Journal, 5(3), pp. 142-147, 1966.
6. Falkenauer, E., A Hybrid Grouping Genetic Algorithm for Bin Packing, Journal of Heuristics, pp. 5-30, 1996.
7. Gamvros, I., An Evolutionary Approach for the Multi-Level Capacitated Minimum Spanning Tree, M.S. in Telecommunications' Project, University of Maryland, 2001.
8. Gamvros, I., B.L. Golden, S. Raghavan, The Multi-Level Capacitated Spanning Tree Problem, In preparation, 2002.
9. Gavish, B. Topological Design of Telecommunications Networks - Local Access Design Methods, Annals of Operations Research, 33, pp 17-71, 1991.
10. Gavish, B., K. Altinkemer, A Parallel Savings Heuristic for the Topological Design of Local Access Tree Networks, Proc. IEEE-INFOCOM, pp. 130-139, 1986.
11. Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
12. Gouveia, L., M. J. Lopes, Using Generalized Capacitated Trees for Designing the Topology of Local Access Networks, Telecommunication Systems, 7, pp. 315-337, 1997.
13. Karnaugh, M., A New Class of Algorithms for Multipoint Network Optimization, IEEE Transactions on Communications, 24(5), pp. 500-505, 1976.
14. Kershenbaum, A., R. Boorstyn, R. Oppenheim, Second-Order Greedy Algorithms for Centralized Network Design, IEEE Transactions on Communications, 22(11), pp. 1835-1838, 1980.
15. McGregor, P. M., D. Shen, Network Design: An Algorithm for Access Facility Location Problems, IEEE Trans. Comm., 25, pp. 61-73, 1977.
16. Michalawicz, Z., Genetic Algorithms (+) Data Structures = Evolution Programs, Springer-Verlag, New York, 1996.
17. Patterson, R., H. Pirkul, Heuristic Procedure Neural Networks for the CMST Problem, Computers & Operations Research, 27, pp. 1171-1200, 2000.
18. Rothfarb, B., M.C. Goldstein, The One-Terminal Telepak Problem, Operations Research, 19, pp. 156-169, 1971.
19. Salman F. S., R. Ravi, J. Hooker, Solving the Local Access Network Design Problem, Working Paper, Krannert Graduate School of Management, Purdue University, 2001.
20. Sharaiha Y M., M. Gendreau, G. Laporte, I. H. Osman, A Tabu Search Algorithm for the Capacitated Minimum Spanning Tree Problem Networks, 29, pp. 161-171, 1997.
21. Sharma R. L., Design of an Economical Mutlidrop Network Topology with Capacity Constraints, IEEE Trans. Comm. COM, 31, pp. 590-591, 1983.