{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:53:25Z","timestamp":1725497605681},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406037"},{"type":"electronic","value":"9783540451105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45110-2_113","type":"book-chapter","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T14:04:48Z","timestamp":1197295488000},"page":"2179-2190","source":"Crossref","is-referenced-by-count":7,"title":["Multicriteria Network Design Using Evolutionary Algorithm"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nilanjan","family":"Banerjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"113_CR1","volume-title":"Computers and Interactability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Interactability: A Guide to the Theory of NP-Completeness, 1979. San Francisco, LA: Freeman."},{"volume-title":"Approximation Algorithms for NP-Hard problems","year":"1997","key":"113_CR2","unstructured":"D. Hochbaum (Ed.). Approximation Algorithms for NP-Hard problems, 1997. Boston, MA: PWS."},{"issue":"1","key":"113_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TCOM.1977.1093709","volume":"25","author":"M. Gerla","year":"1977","unstructured":"M. Gerla and L. Kleinrock. On the topological design of distributed computer networks. IEEE Trans. Communications, 25(1): 48\u201360, 1977.","journal-title":"IEEE Trans. Communications"},{"key":"113_CR4","doi-asserted-by":"crossref","unstructured":"V. P. Kompella, J. C. Pasquale, and G. C. Polyzos. Multicast routing for multimedia communication. IEEE\/ACM Trans. Networking, 286\u2013292, 1993.","DOI":"10.1109\/90.234851"},{"issue":"12","key":"113_CR5","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1109\/43.331412","volume":"13","author":"M. Borah","year":"1995","unstructured":"M. Borah, R. M. Owens, and M. J. Irwin. An edge-based heuristic for Steiner routing. IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, 13(12): 1563\u20131568, 1995.","journal-title":"IEEE Trans. Computer Aided Design of Integrated Circuits and Systems"},{"issue":"3","key":"113_CR6","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/0167-8191(95)00010-0","volume":"22","author":"N. Boldon","year":"1996","unstructured":"N. Boldon, N. Deo, and N. Kumar. Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine. Parallel Computing, 22(3): 369\u2013382, 1996.","journal-title":"Parallel Computing"},{"issue":"1","key":"113_CR7","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/jagm.1998.0930","volume":"28","author":"M. V. Marathe","year":"1998","unstructured":"M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt. Bicriteria network design problems. J. Algorithms, 28(1): 142\u2013171, 1998.","journal-title":"J. Algorithms"},{"issue":"1","key":"113_CR8","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s00453-001-0038-2","volume":"31","author":"R. Ravi","year":"2001","unstructured":"R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt. Approximation algorithms for degree-constrained minimum-cost network design problems. Algorithmica, 31(1): 58\u201378, 2001.","journal-title":"Algorithmica"},{"key":"113_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5184-0","volume-title":"Evolutionary Algorithms for Solving Multi-Objective Problems","author":"C. A. C. Coello","year":"2002","unstructured":"C. A. C. Coello, D. A. Van Veldhuizen, and G. B. Lamont. Evolutionary Algorithms for Solving Multi-Objective Problems, 2002. Boston, MA: Kluwer."},{"key":"113_CR10","volume-title":"Multiobjective Optimization Using Evolutionary Algorithms","author":"K. Deb","year":"2001","unstructured":"K. Deb. Multiobjective Optimization Using Evolutionary Algorithms, 2001. Chichester, UK: Wiley."},{"issue":"1","key":"113_CR11","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/3468.650319","volume":"28","author":"C. M. Fonseca","year":"1998","unstructured":"C. M. Fonseca and P. J. Fleming. Multiobjective optimization and multiple constraint handling with evolutionary algorithms \u2014 Part I: a unified formulation. IEEE Transactions on Systems, Man and Cybernetics-Part A: Systems and Humans, 28(1): 26\u201337, 1998. 26\u201337.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics-Part A: Systems and Humans"},{"key":"113_CR12","unstructured":"K. Deb et al. A fast non-dominated sorting genetic algorithm for multiobjective optimization: NSGA-II. Parallel Problem Solving from Nature, PPSN-VI: 849\u2013858, 2000."},{"key":"113_CR13","unstructured":"E. Zitzler, M. Laumanns and L. Thiele. SPEA2: Improving the strength Pareto evolutionary algorithm. EUROGEN 2001."},{"issue":"2","key":"113_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"J. D. Knowles","year":"2000","unstructured":"Knowles, J. D. and Corne, D. W. Approximating. Evolutionary Computation, 8(2): 149\u2013172, 2000.","journal-title":"Evolutionary Computation"},{"issue":"3","key":"113_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1162\/106365602760234108","volume":"10","author":"M. Laumanns","year":"2002","unstructured":"M. Laumanns, L. Thiele, K. Deo and E. Zitzler. Combining convergence and diversity in evolutionary multiobjective optimization. Evolutionary Computation, 10(3): 263\u2013182, 2002.","journal-title":"Evolutionary Computation"},{"issue":"3","key":"113_CR16","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1162\/106365602760234117","volume":"10","author":"R. Kumar","year":"2002","unstructured":"R. Kumar and P. I. Rockett. Improved sampling of the Pareto-front in multiobjective genetic optimizations by steady-state evolution: a Pareto converging genetic algorithm. Evolutionary Computation, 10(3): 283\u2013314, 2002.","journal-title":"Evolutionary Computation"},{"key":"113_CR17","unstructured":"R. C. Purshouse and P. J. Fleming. Elitism, sharing and ranking choices in evolutionary multi-criterion optimization. Research Report No. 815, Dept. Automatic Control & Systems Engineering, University of Sheffield, Jan. 2002."},{"issue":"1","key":"113_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1109\/24.210272","volume":"42","author":"R. H. Jan","year":"1993","unstructured":"R. H. Jan, F. J. Hwang, and S. T. Cheng. Topological optimization of a communication network subject to a reliability constraint. IEEE Trans. Reliability, 42(1): 63\u201369, 1993.","journal-title":"IEEE Trans. Reliability"},{"issue":"8","key":"113_CR19","doi-asserted-by":"publisher","first-page":"1172","DOI":"10.1109\/49.245906","volume":"11","author":"C. Ersoy","year":"1993","unstructured":"C. Ersoy and S. S. Panwar. Topological design of interconnected LAN\/MAN Networks. IEEE J. Select. Areas Communication, 11(8): 1172\u20131182, 1993.","journal-title":"IEEE J. Select. Areas Communication"},{"issue":"6","key":"113_CR20","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1109\/3468.541346","volume":"26","author":"L. W. Clarke","year":"1996","unstructured":"L. W. Clarke and G. Anandalingam. An integrated system for designing minimum cost survivable telecommunication networks. IEEE. Trans. Systems, Man and Cybernetics-Part A, 26(6): 856\u2013862, 1996.","journal-title":"IEEE. Trans. Systems, Man and Cybernetics-Part A"},{"key":"113_CR21","unstructured":"A. Atamturk and D. Rajan. Survivable network design: simultaneous routing of flows and slacks. Research Report, IEOR, University of California at Berkeley."},{"key":"113_CR22","doi-asserted-by":"crossref","unstructured":"T. A. Feo and M. G. C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 1995.","DOI":"10.1007\/BF01096763"},{"key":"113_CR23","unstructured":"B. Baran and F. Laufer. Topological optimization of reliable networks using A-Teams. National Computer Center, National University of Asuncion, University Campus of San Lorenzo \u2014 Paraguay."},{"key":"113_CR24","doi-asserted-by":"crossref","unstructured":"F. N. Abuali, D. A. Schnoenefeld, and R. L. Wainwright. Designing telecommunication networks using genetic algorithms and probabilistic minimum spanning Trees. In Proc. 1994 ACM Symp. Applied Computing, pp. 242\u2013246, 1994.","DOI":"10.1145\/326619.326733"},{"key":"113_CR25","unstructured":"K. T. Ko, K. S. Tang, C.Y. Chan, K. F. Man and S. Kwong. Using genetic algorithms to design mesh networks. IEEE Computer, 6\u201358, 1997."},{"issue":"5","key":"113_CR26","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/90.541324","volume":"4","author":"R. Elbaum","year":"1996","unstructured":"R. Elbaum and M. Sidi. Topological design of local-area networks using genetic algorithms. IEEE\/ACM Trans. Networking, 4(5): 766\u2013777, 1996.","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"1","key":"113_CR27","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1109\/24.376523","volume":"44","author":"A. Kumar","year":"1995","unstructured":"A. Kumar, R. M. Pathak, and Y.P. Gupta. Genetic-algorithm based reliability optimization for computer network expansion. IEEE Trans. Reliability, 44(1): 63\u201372, 1995.","journal-title":"IEEE Trans. Reliability"},{"key":"113_CR28","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1023\/A:1018919205346","volume":"86","author":"A. R. P. White","year":"1999","unstructured":"A. R. P White, J. W. Mann, and G. D. Smith. Genetic algorithms and network ring design. Annals of Operational Research, 86: 347\u2013371, 1999.","journal-title":"Annals of Operational Research"},{"issue":"3","key":"113_CR29","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1109\/4235.661548","volume":"1","author":"B. Dengiz","year":"1997","unstructured":"B. Dengiz, F. Altiparmak, and A. E. Smith. Local search genetic algorithm for optimal design of reliable networks. IEEE Trans. Evolutionary Computation, 1(3): 179\u2013188, 1997.","journal-title":"IEEE Trans. Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2014 GECCO 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45110-2_113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,27]],"date-time":"2019-02-27T03:18:33Z","timestamp":1551237513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45110-2_113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406037","9783540451105"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-45110-2_113","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}