{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:57:37Z","timestamp":1764997057794,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,1,20]],"date-time":"2016-01-20T00:00:00Z","timestamp":1453248000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100007224","name":"National Foundation for Science and Technology Development (VN)","doi-asserted-by":"publisher","award":["102.01-2015.12"],"award-info":[{"award-number":["102.01-2015.12"]}],"id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s12293-015-0177-7","type":"journal-article","created":{"date-parts":[[2016,1,20]],"date-time":"2016-01-20T16:17:48Z","timestamp":1453306668000},"page":"97-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A survivable design of last mile communication networks using multi-objective genetic algorithms"],"prefix":"10.1007","volume":"8","author":[{"given":"Lam Thu","family":"Bui","sequence":"first","affiliation":[]},{"given":"Huynh","family":"Thi Thanh Binh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,20]]},"reference":[{"issue":"1","key":"177_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.20072","volume":"46","author":"H Kerivin","year":"2005","unstructured":"Kerivin H, Mahjoub AR (2005) Design of survivable networks: a survey. Networks 46(1):1\u201321","journal-title":"Networks"},{"key":"177_CR2","doi-asserted-by":"crossref","unstructured":"Wagner D, Raidl GR, Pferschy U, Mutzel P, Bachhiesl P (2007) A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks. In: Waldmann KH, Stocker UM (eds) Operations research proceedings 2006, pp 197\u2013202","DOI":"10.1007\/978-3-540-69995-8_33"},{"key":"177_CR3","doi-asserted-by":"crossref","unstructured":"Leitner M, Raidl GR (2008) Lagrangian decomposition, meta-heuristics, and hybrid approaches for the design of the last mile in fiber optic networks. In: Blesa MJ et al. (eds) Hybrid meta-heuristics, vol 5296. Springer, Berlin, Heidelberg, pp 158\u2013174","DOI":"10.1007\/978-3-540-88439-2_12"},{"key":"177_CR4","unstructured":"Leitner M, Raidl GR (2010) Branch-and-cut and price for capacitated connected facility location. Technical report TR-186-1-10-01, Vienna University of Technology, Vienna, Austria"},{"key":"177_CR5","doi-asserted-by":"crossref","unstructured":"Leitner M, Raidl GR (2010) Strong lower bounds for a survivable network design problem. In: International symposium on combinatorial optimization, Hammamet, Tunisia, pp 295\u2013302","DOI":"10.1016\/j.endm.2010.05.038"},{"key":"177_CR6","unstructured":"IBM ILOG (2006) CPLEX optimizer performance benchmarks 10.0. http:\/\/www.ilog.com"},{"key":"177_CR7","unstructured":"Wagner D, Pferschy U, Mutzel P, Raidl GR, Bachhiesl P (2007) A directed cut model for the design of the last mile in real-world fiber optic networks. In: Proceedings of the international network optimization conference 2007, Spa, Belgium, pp 1\u20136"},{"key":"177_CR8","unstructured":"Bucsics T, Raidl G (2007) Metaheuristic approaches for designing survivable fiber-optic networks. In: Institute for computer graphics and algorithms of the Vienna University of Technology"},{"issue":"2\u20133","key":"177_CR9","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I Ljubic","year":"2006","unstructured":"Ljubic I, Weiskircher R, Pferschy U, Klau G, Mutzel P, Fischetti M (2006) An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Math Program Ser B 105(2\u20133):427\u2013449","journal-title":"Math Program Ser B"},{"issue":"6","key":"177_CR10","doi-asserted-by":"crossref","first-page":"1198","DOI":"10.1016\/j.dam.2008.02.014","volume":"157","author":"AS Cunha Da","year":"2009","unstructured":"Da Cunha AS, Lucena A, Maculan N, Resende MGC (2009) A relax-and-cut algorithm for the prize-collecting Steiner problem in graph. Discrete Appl Math 157(6):1198\u20131217","journal-title":"Discrete Appl Math"},{"issue":"1\u20133","key":"177_CR11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0166-218X(03)00380-9","volume":"141","author":"A Lucena","year":"2004","unstructured":"Lucena A, Resende MGC (2004) Strong lower bounds for the prize collecting Steiner problem in graphs. Discrete Appl Math 141(1\u20133):277\u2013294","journal-title":"Discrete Appl Math"},{"key":"177_CR12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"SA Canuto","year":"2001","unstructured":"Canuto SA, Resende MGC, Ribeiro CC (2001) Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38:50\u201358","journal-title":"Networks"},{"issue":"4","key":"177_CR13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/net.20106","volume":"47","author":"O Chapovska","year":"2006","unstructured":"Chapovska O, Punnen AP (2006) Variations of the prize-collecting Steiner tree problem. Networks 47(4):199\u2013205","journal-title":"Networks"},{"issue":"4","key":"177_CR14","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/j.orl.2005.02.007","volume":"34","author":"E Uchoa","year":"2006","unstructured":"Uchoa E (2006) Reduction tests for the prize-collecting Steiner problem. Op Res Lett 34(4):437\u2013444","journal-title":"Op Res Lett"},{"key":"177_CR15","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/978-0-387-30165-5_15","volume-title":"Handbook of optimization in telecommunications","author":"B Fortz","year":"2006","unstructured":"Fortz B, Labbe M (2006) Polyhedral approaches to the design of survivable networks. In: Resende MGC, Pardolas PM (eds) Handbook of optimization in telecommunications. Springer, Berlin, pp 367\u2013389"},{"key":"177_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0088963","volume-title":"Design of survivable networks. LNCS 1531","author":"M Stoer","year":"1992","unstructured":"Stoer M (1992) Design of survivable networks. LNCS 1531. Springer, Heidelberg"},{"key":"177_CR17","unstructured":"Leitner M (2010) Solving two network design problems by mixed integer programming and hybrid optimization methods. Ph.D. thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria"},{"key":"177_CR18","unstructured":"Bachhiesl P (2005) The OPT- and the SST-problems for real world access network design basic definitions and test instances. Working report 01\/2005, Carinthia Tech Institute, Department of Telematics and Network Engineering, Klagenfurt, Austria"},{"key":"177_CR19","unstructured":"Vo TK, Nguyen MT, Huynh BTT (2012) Heuristic algorithms for solving survivability problem in the design of last mile communication network. In: Proceedings of the 4th Asian conference on intelligent information and database systems, Kaohsiung, Taiwan, pp 519\u2013528"},{"key":"177_CR20","doi-asserted-by":"crossref","unstructured":"Nguyen MT, Vo KT, Huynh BTT (2012) Heuristic Algorithms for Solving the Survivable Problem in the Design of Last Mile Communication Networks. In: Proceedings of the 9th IEEE\u2014RIVF international conference on computing and communication technologies, Ho Chi Minh, Vietnam, pp 219\u2013224","DOI":"10.1109\/rivf.2012.6169858"},{"issue":"2","key":"177_CR21","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"177_CR22","doi-asserted-by":"crossref","unstructured":"Huynh Thi Thanh Binh, Nguyen Thai Duong (2015) Heuristic and genetic algorithms for solving survivability problem in the design of last mile communication networks. Soft Computing 19:2619\u20132632","DOI":"10.1007\/s00500-014-1429-z"},{"key":"177_CR23","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"JW Suurballe","year":"1984","unstructured":"Suurballe JW, Tarjan RE (1984) A quick method for finding shortest pairs of disjoint paths. Networks 14:325\u2013336","journal-title":"Networks"},{"key":"177_CR24","unstructured":"Coello CAC, Sierra MR (2003) A multi-objective evolutionary algorithm based on coevolutionary concepts. In: The 2003 congress on evolutionary computation, vol 1, pp 482\u2013489"},{"key":"177_CR25","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1016\/j.asoc.2014.06.001","volume":"24","author":"HTT Binh","year":"2014","unstructured":"Binh HTT, Bui LT, Ha NST, Ishibuchi H (2014) A multi-objective approach for solving the survivable network design problem with simultaneous unicast and anycast flows. Appl Soft Comput 24:1145\u20131154","journal-title":"Appl Soft Comput"},{"issue":"3","key":"177_CR26","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s12293-011-0067-6","volume":"3","author":"M Farnsworth","year":"2011","unstructured":"Farnsworth M, Benkhelifa E, Tiwari A, Zhu M, Moniri M (2011) An efficient evolutionary multi-objective framework for MEMS design optimisation: validation, comparison and analysis. Memet Comput 3(3):175\u2013197","journal-title":"Memet Comput"},{"issue":"2","key":"177_CR27","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s12293-014-0133-y","volume":"6","author":"R Joshi","year":"2014","unstructured":"Joshi R, Deshpande B (2014) Empirical and analytical study of many-objective optimization problems: analysing distribution of nondominated solutions and population size for scalability of randomized heuristics. Memet Comput 6(2):133\u2013145","journal-title":"Memet Comput"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-015-0177-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-015-0177-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-015-0177-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T17:33:45Z","timestamp":1567532025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-015-0177-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,20]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["177"],"URL":"https:\/\/doi.org\/10.1007\/s12293-015-0177-7","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"type":"print","value":"1865-9284"},{"type":"electronic","value":"1865-9292"}],"subject":[],"published":{"date-parts":[[2016,1,20]]}}}