Capacitated network design considering survivability: an evolutionary approach

References

• Fratta , L. , Gerla , M. and Kleinrock , L. (1973) . The flow deviation method: An approach to store-and forward communication network design . Networks , 3 : 97 – 133 .
   Google Scholar
• Hayes J. F. (1984) Modeling and Analysis of Computer Communications Networks Plenum Press New York
   Google Scholar
• Tanenbaum A. S. (1981) Computer Networks Prentice-Hall Englewood Cliffs N.J.
   Google Scholar
• Gerla , M. and Kleinrock , L. (1977) . On the topological design of distributed computer networks . IEEE Transactions on Communications , COM-25 ( 1 ) : 48 – 60 .
   Web of Science ®Google Scholar
• Boorstyn , R. R. and Frank , H. (1977) . Large-scale network topological optimization . IEEE Transactions on Communications , COM-25 ( 1 ) : 29 – 47 .
   Web of Science ®Google Scholar
• Newport , K. T. and Varshney , P. K. (1991) . Design of survivable communications networks under performance constraints . IEEE Transactions on Reliability , 40 ( 4 ) : 433 – 440 .
   Web of Science ®Google Scholar
• Kershenbaum , A. , Kermani , P. and Grover , G. A. (1991) . MENTOR: an algorithm for mesh network topological optimization and routing . IEEE Transactions on Communications , 39 ( 4 ) : 503 – 513 .
   Web of Science ®Google Scholar
• Pierre , S. , Hyppolite , M.-A. , Bourjolly , J.-M. and Dioume , O. (1995) . Topological design of computer communication networks using simulated annealing . Engineering Applications of Artificial Intelligence , 8 ( 1 ) : 61 – 69 .
   Web of Science ®Google Scholar
• Crainic , T. G. , Gendreau , M. and Farvolden , J. M. (2000) . A simplex-based tabu search method for capacitated network design . INFORMS Journal on Computing , 12 ( 3 ) : 223 – 236 .
   Web of Science ®Google Scholar
• Pierre , S. and Elgibaoui , A. (1997) . A tabu-search approach for designing computer-network topologies with unreliable components . IEEE Transactions on Reliability , 46 ( 3 ) : 350 – 359 .
   Web of Science ®Google Scholar
• Pierre , S. and Legault , G. (1998) . A genetic algorithm for designing distributed computer network topologies . IEEE Transactions on Systems, Man and Cybernetics, Part B [Cybernetics] , 28 ( 2 ) : 249 – 258 .
   PubMed Web of Science ®Google Scholar
• Dutta , A. and Mitra , S. (1993) . Integrating heuristic knowledge and optimization models for communication network design . IEEE Transactions on Knowledge and Data Engineering , 5 ( 6 ) : 999 – 1017 .
   Web of Science ®Google Scholar
• Fahmy , H. I. and Douligeris , C. (1995) . END: an expert network designer . IEEE Network , 9 ( 6 ) : 18 – 27 .
   Web of Science ®Google Scholar
• Altinkemer , K. and Yu , Z. (1992) . Topological design of wide area communication networks . Annals of Operations Research , 36 ( 1–4 ) : 365 – 381 .
   Google Scholar
• Chang , S.-G. and Gavish , B. (1993) . Telecommunications network topological design and capacity expansion: Formulations and algorithms . Telecommunication Systems—Modeling, Analysis, Design and Management , 1 ( 2 ) : 99 – 131 .
   Google Scholar
• Gavish , B. (1992) . Topological design of computer communication networks—the overall design problem . European Journal of Operational Research , 58 ( 2 ) : 149 – 172 .
   Web of Science ®Google Scholar
• Magnanti , T. L. , Mirchandani , P. and Vachani , R. (1995) . Modeling and solving the two-facility capacitated network loading problem . Operations Research , 43 ( 1 ) : 142 – 157 .
   Web of Science ®Google Scholar
• Gavish , B. (1985) . Augmented Lagrangian based algorithms for centralized network design . IEEE Transactions on Communications , COM-33 ( 12 ) : 1247 – 1257 .
   Web of Science ®Google Scholar
• Altinkemer , K. (1994) . Topological design of ring networks . Computers and Operations Research , 21 ( 4 ) : 421 – 431 .
   Web of Science ®Google Scholar
• Amiri , A. and Pirkul , H. (1997) . Routing in packet-switched communication networks with different criticality classes of communicating node pairs . Naval Research Logistics , 44 ( 5 ) : 485 – 505 .
   Web of Science ®Google Scholar
• Amiri , A. and Pirkul , H. (1999) . Routing and capacity assignment in backbone communication networks under time varying traffic conditions . European Journal of Operational Research , 117 ( 1 ) : 15 – 29 .
   Web of Science ®Google Scholar
• Gavish B. Neuman I. (1986) Capacity and flow assignment in large computer networks Proceedings of IEEE INFOCOM ’86. Fifth Annual Conference on Computers and Communications Integration Design, Analysis, Management (Cat. No. 86CH2284–8) Miami FL USA pp. 275–284
   Google Scholar
• Gavish , B. and Neuman , I. (1992) . Routing in a network with unreliable components . IEEE Transactions on Communications , 40 ( 7 ) : 1248 – 1258 .
   Web of Science ®Google Scholar
• Grötschel M. Monma C. L. Stoer M. (1995) Design of survivable networks Network Models Handbooks in Operations Research and Management Science ((Eds). M. O. Ball, T. L. Magnanti, C. L. Monma and G. L. Nemhauser) Elsevier Science Amsterdam pp. 617–672
   Google Scholar
• Monma , C. L. and Shallcross , D. F. (1989) . Methods for designing communications networks with certain two-connected survivability constraints . Operations Research , 37 ( 4 ) : 531 – 541 .
   Web of Science ®Google Scholar
• Cheng , S.-T. (1998) . Topological optimization of a reliable communication network . IEEE Transactions on Reliability , 47 ( 3, pt.1 ) : 225 – 233 .
   Web of Science ®Google Scholar
• Davis L. Orvosh D. Cox A. Qiu Y. (1993) A genetic algorithm for survivable network design Proceedings of the Fifth International Conference on Genetic Algorithms Urbana-Champaign IL USA pp. 408–415
   Google Scholar
• Huang R. Ma J. Hsu D. F. (1997) A genetic algorithm for optimal 3-connected telecommunication network designs Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN ’97) Proceedings Taipei Taiwan pp. 344–350
   Google Scholar
• Konak A. Smith A. E. (1999) A hybrid genetic algorithm approach for backbone design of communication networks Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) 1813 Washington DC USA pp. 1817–1823
   Google Scholar
• Kulturel-Konak S. Konak A. Smith A. E. (2000) Minimum cost 2-edge-connected Steiner graphs in rectilinear space: an evolutionary approach Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No. 00TH8512) 101 La Jolla CA USA pp. 97–103
   Google Scholar
• Koh , S. J. and Lee , C. Y. (1995) . A tabu search for the survivable fiber optic communication network design . Computers and Industrial Engineering , 28 ( 4 ) : 689 – 700 .
   Web of Science ®Google Scholar
• Balakrishnan , A. , Magnanti , T. L. and Mirchandani , P. (1998) . Designing hierarchical survivable networks . Operations Research , 46 ( 1 ) : 116 – 136 .
   Web of Science ®Google Scholar
• Grötschel , M. , Monma , C. L. and Stoer , M. (1992) . Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints . Operations Research , 40 ( 2 ) : 309 – 330 .
   Google Scholar
• Grötschel , M. , Monma , C. L. and Stoer , M. (1995) . Polyhedral and computational investigations for designing communication networks with high survivability requirements . Operations Research , 43 ( 6 ) : 1012 – 1024 .
   Google Scholar
• Newport K. T. (1990) Incorporating survivability considerations directly into the network design process Proceedings IEEE INFOCOM’90. The Conference on Computer Communications. Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration (Cat. No. 90CH2826–5) 211 San Francisco CA USA pp. 215–220
   Google Scholar
• Pierre , S. and Beaubrun , R. (2000) . Integrating routing and survivability in fault-tolerant computer network design . Computer Communications , 23 ( 4 ) : 317 – 327 .
   Web of Science ®Google Scholar
• Holland J. H. (1975) Adaptation in Natural and Artificial Systems University of Michigan Press Ann Arbor
   Google Scholar
• Deb , K. (1999) . Multi-objective genetic algorithms: Problem difficulties and construction of test problems . Journal of Evolutionary Computation , 7 ( 3 ) : 205 – 230 .
   PubMed Web of Science ®Google Scholar
• Fonseca , C. M. and Fleming , P. J. (1995) . An overview of evolutionary algorithms in multiobjective optimization . Journal of Evolutionary Computation , 3 ( 1 ) : 1 – 16 .
   Web of Science ®Google Scholar
• Fonseca , C. M. and Fleming , P. J. (1998) . Multiobjective optimization and multiple constraint handling with evolutionary algorithms. II. Application example . IEEE Transactions on Systems, Man and Cybernetics, Part A [Systems and Humans] , 28 ( 1 ) : 38 – 47 .
   Web of Science ®Google Scholar
• Veldhuizen , Van, D. A. and Lamont , G. B. (2000) . Multiobjective evolutionary algorithms: analyzing the state-of-the-art . Evolutionary Computation , 8 ( 2 ) : 125 – 147 .
   PubMed Web of Science ®Google Scholar
• Zitzler , E. and Thiele , L. (1999) . Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach . IEEE Transactions on Evolutionary Computation , 3 ( 4 ) : 257 – 271 .
   Web of Science ®Google Scholar
• Knowles , J. D. and Corne , D. W. (2000) . Approximating the nondominated front using the Pareto archived evolutionary strategy . Evolutionary Computation , 8 ( 2 ) : 149 – 172 .
   PubMed Web of Science ®Google Scholar
• Goldberg D. E. (1989) Genetic Algorithms in Search, Optimization, and Machine Learning Addison-Wesley Reading Mass
   Google Scholar
• Coit , D. W. , Smith , A. E. and Tate , D. M. (1996) . Adaptive penalty methods for genetic optimization of constrained combinatorial problems . INFORMS Journal of Computing , 8 ( 2 ) : 173 – 182 .
   Google Scholar
• Jung , S. and Moon , B.-R. (2002) . Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP . IEEE Transactions on Evolutionary Computation , 6 ( 6 ) : 557 – 565 .
   Web of Science ®Google Scholar
• Palmer , C. C. and Kershenbaum , A. (1995) . An approach to a problem in network design using genetic algorithms . Networks , 26 ( 3 ) : 151 – 163 .
   Web of Science ®Google Scholar
• Pirkul , H. and Amiri , A. (1994) . Routing in packet switched communication networks . Computer Communications , 17 ( 5 ) : 307 – 316 .
   Web of Science ®Google Scholar
• Cantor , D. G. and Gerla , M. (1974) . Optimal routing in a packet-switched computer network . IEEE Transactions on Computers , C-23 ( 10 ) : 1062 – 1069 .
   Google Scholar
• Mann J. W. Smith G. D. (1996) A comparison of heuristics for telecommunications traffic routing Modern Heuristic Search Methods ((Eds.) V. J. Rayward-Smith, I. H. Osman, C. R. Reeves and G. D. Smith) John Wiley New York NY pp. 235–253
   Google Scholar
• Munetomo M. (2000) The genetic adaptive routing algorithm Telecommunications Optimization: Heuristic and Adaptive Techniques ((Eds.) D. W. Corne, M. J. Oates and G. D. Smith) John Wiley New York NY pp. 151–166
   Google Scholar
• Courtois , P.-J. and Semal , P. (1981) . An algorithm for the optimization of nonbifurcated flows in computer communication networks . Performance Evaluation , 1 ( 2 ) : 139 – 152 .
   Web of Science ®Google Scholar
• Gragopoulos , I. , Papapetrou , E. and Pavlidou , F.-N. (2000) . Performance study of adaptive routing algorithms for LEO satellite constellations under self-similar and Poisson traffic . Space Communications , 16 ( 1 ) : 15 – 22 .
   Web of Science ®Google Scholar
• Deb K. Goldberg D. E. (1989) An investigation of niche and species formation in genetic function optimization Third International Conference on Genetic Algorithms San Mateo CA USA pp. 42–50
   Google Scholar