{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T16:40:21Z","timestamp":1717432821740},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,7,17]],"date-time":"2014-07-17T00:00:00Z","timestamp":1405555200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Hum. Cent. Comput. Inf. Sci."],"published-print":{"date-parts":[[2014,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study the survivable network design problem (SNDP) for simultaneous unicast and anycast flows in networks where the link cost follows All Capacities Modular Cost (ACMC) model. Given a network modeled by a connected, undirected graph and a set of flow demands, this problem aims at finding a set of connections with a minimized network cost in order to protect the network against any single failure. This paper proposes a new Genetic Algorithm with an efficient encoding to solve the SNDP in networks with ACMC model (A-SNDP). Our encoding scheme is simple and allows large search space. Extensive simulation results on real large topology instances show that the proposed algorithm is much more efficient than the Tabu Search and other conventional Genetic Algorithm in terms of minimizing the network cost.<\/jats:p>","DOI":"10.1186\/s13673-014-0013-y","type":"journal-article","created":{"date-parts":[[2014,7,16]],"date-time":"2014-07-16T14:19:15Z","timestamp":1405520355000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["All capacities modular cost survivable network design problem using genetic algorithm with completely connection encoding"],"prefix":"10.1186","volume":"4","author":[{"given":"Huynh Thi Thanh","family":"Binh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Son Hong","family":"Ngo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,17]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Johnson D, Deering S (1999) Reserved IPv6 Subnet Anycast Addresses. RFC 2526 Johnson D, Deering S (1999) Reserved IPv6 Subnet Anycast Addresses. RFC 2526","DOI":"10.17487\/rfc2526"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1145\/1080091.1080127","volume-title":"SIGCOMM\u201905","author":"H Ballani","year":"2005","unstructured":"Ballani H, Francis P: Towards a global IP anycast service. In SIGCOMM\u201905., New York, USA; 2005:301\u2013312."},{"key":"13_CR3","first-page":"378","volume-title":"Communications in Computer and Information Science","author":"K Walkowiak","year":"2003","unstructured":"Walkowiak K: Anycast Communication \u2013 A New Approach to Survivability of Connection-Oriented Networks. In Communications in Computer and Information Science. Springer, Berlin; 2003:378\u2013389."},{"key":"13_CR4","volume-title":"Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP and MPLS","author":"J Vasseur","year":"2004","unstructured":"Vasseur J, Pickavet M, Demeester P: Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP and MPLS. Morgan Kaufmann, San Francisco; 2004."},{"key":"13_CR5","first-page":"41","volume-title":"Intl Journal Of Electronics And Telecommunications","author":"J G\u0142adysz","year":"2010","unstructured":"G\u0142adysz J, Walkowiak K: Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows. In Intl Journal Of Electronics And Telecommunications. Versita Publisher, Warsaw; 2010:41\u201348. no. 1 no. 1"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/978-3-540-69848-7_63","volume-title":"Osvaldo Gervas, Computational Science and Its Applications \u2013 ICCSA 2008, LNCS","author":"K Walkowiak","year":"2008","unstructured":"Walkowiak K: A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks. In Osvaldo Gervas, Computational Science and Its Applications \u2013 ICCSA 2008, LNCS. Springer, Perugia, Italy; 2008:797\u2013807. 10.1007\/978-3-540-69848-7_63"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11902140_46","volume-title":"Computer and Information Sciences \u2013 ISCIS 2006","author":"K Walkowiak","year":"2006","unstructured":"Walkowiak K: A New Function for Optimization of Working Paths in Survivable MPLS Networks. In Computer and Information Sciences \u2013 ISCIS 2006. Springer, Istanbul; 2006:424\u2013433. 10.1007\/11902140_46"},{"key":"13_CR8","volume-title":"Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking","author":"W Grover","year":"2004","unstructured":"Grover W: Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Prentice Hall PTR, Upper Saddle River, New Jersey; 2004."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-76286-7_12","volume-title":"Success in Evolutionary Computation","author":"V Nissen","year":"2008","unstructured":"Nissen V, Gold S: Survivable network design with an evolution strategy. In Success in Evolutionary Computation. Springer, Berlin; 2008:263\u2013283. 10.1007\/978-3-540-76286-7_12"},{"key":"13_CR10","volume-title":"Framework for MPLS-based recovery","author":"V Sharma","year":"2003","unstructured":"Sharma V, Hellstrand F (2003) Framework for MPLS-based recovery. RFC 3469"},{"key":"13_CR11","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z Michalewicz","year":"1995","unstructured":"Michalewicz Z: Genetic Algorithms + Data Structures = Evolution Programs. Springer,; 1995."},{"key":"13_CR12","first-page":"1237","volume-title":"the Proceedings of the Eighth International Conference on Bio-Inspired Computing: Theories and Applications","author":"B Huynh Thi Thanh","year":"2013","unstructured":"Huynh Thi Thanh B, Son Hong N, Nguyen Ngoc D: Genetic Algorithm for Solving Survivable Network Design with Simultaneous Unicast and Anycast Flows. In the Proceedings of the Eighth International Conference on Bio-Inspired Computing: Theories and Applications. BIC-TA, China; 2013:1237\u20131247."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.20072","volume":"46","author":"H Kerivin","year":"2005","unstructured":"Kerivin H, Ridha Mahjoub A: Design of survivable networks: A survey. J Netw 2005, 46: 1\u201321. 10.1002\/net.20072","journal-title":"J Netw"},{"key":"13_CR14","volume-title":"Proceedings of the Eighth IEEE International Symposium on Computers and Communications","author":"BG Jozsa","year":"2003","unstructured":"Jozsa BG, Orincsay D, Kern A: Surviving Multiple Network Failures Using Shared Backup Path Protection. In Proceedings of the Eighth IEEE International Symposium on Computers and Communications. Kiris-Kemer, Turkey; 2003. June 30-July 03, 2003, pp. 1333 June 30-July 03, 2003, pp. 1333"},{"key":"13_CR15","volume-title":"Routing, Flow, and Capacity Design in Communication and Computer Networks","author":"M Pioro","year":"2004","unstructured":"Pioro M, Medhi D: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers, San Francisco, CA, USA; 2004."},{"key":"13_CR16","volume-title":"Krzysztof Walkowiak: Optimization of survivable networks with simultaneous unicast and anycast flows","author":"J Gladysz","year":"2009","unstructured":"Gladysz J: Krzysztof Walkowiak: Optimization of survivable networks with simultaneous unicast and anycast flows. Poland, ICUMT; 2009."},{"key":"13_CR17","volume-title":"Reactive Search and Intelligent Optimization 1st","author":"R Battiti","year":"2008","unstructured":"Battiti R, Brunato M, Mascia F: Reactive Search and Intelligent Optimization 1st. Springer, New York, USA; 2008."},{"key":"13_CR18","first-page":"137","volume-title":"The Eight International Conference on Intelligence on Computing, ICIC-2012","author":"B Huynh Thi Thanh","year":"2012","unstructured":"Huynh Thi Thanh B, Pham Vu L, Nguyen Ngoc D, Nguyen Sy Thai H: Heuristic Algorithms for Solving Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows. In The Eight International Conference on Intelligence on Computing, ICIC-2012., Huangshang, China; 2012:137\u2013145."},{"issue":"3","key":"13_CR19","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","volume":"55","author":"S Orlowski","year":"2010","unstructured":"Orlowski S, Wess\u00e4ly R, Pi\u00f3ro M, Tomaszewski A: SNDlib 1.0-Survivable Network Design Library. Networks 2010, 55(3):276\u2013286.","journal-title":"Networks"}],"container-title":["Human-centric Computing and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13673-014-0013-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13673-014-0013-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13673-014-0013-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13673-014-0013-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T12:17:30Z","timestamp":1717071450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s13673-014-0013-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,17]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["13"],"URL":"https:\/\/doi.org\/10.1186\/s13673-014-0013-y","relation":{},"ISSN":["2192-1962"],"issn-type":[{"value":"2192-1962","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,17]]},"assertion":[{"value":"23 April 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2014","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"13"}}