caa a22 4500 605468842 CHVBK 20210128100319.0 cr unu---uuuuu 210128e20150901xx s 000 0 eng 10.1007/s00500-014-1429-z doi (NATIONALLICENCE)springer-10.1007/s00500-014-1429-z Heuristic and genetic algorithms for solving survivability problem in the design of last mile communication networks [Elektronische Daten] [Huynh Binh, Nguyen Duong] Given a connected, undirected and weighted graph $$G = (V, E)$$ G = ( V , E ) , a set of infrastructure nodes $$J$$ J and a set of customers $$C$$ C include two customer types whereby customers $$C_{1}$$ C 1 require a single connection (type-1) and customers $$C_{2}$$ C 2 need to be redundantly connected (type-2). Survivable network design problem (SNDP) seeks a sub-graph of $$G$$ G with the smallest weight in which all customers are connected to infrastructure nodes. SNDP has applications in the design of the last mile of the real-world communication networks. SNDP is NP-hard so heuristic approaches are normally adopted to solve this problem, especially for large-scale networks. This paper proposes a new heuristic algorithm and a new genetic algorithm for solving SNDP. The proposed algorithms are experimented on real-world instances and random instances. Results of computational experiments show that the proposed heuristic algorithm is much more efficient than the other heuristics in running time, and the proposed genetic algorithm is much more efficient than the other heuristics in terms of minimizing the network cost. Springer-Verlag Berlin Heidelberg, 2014 Survivable network design nationallicence Fiber optic network nationallicence Shortest paths nationallicence Edge-disjoint paths nationallicence Heuristic algorithm nationallicence Genetic algorithm nationallicence Binh Huynh School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam aut Duong Nguyen School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam aut Soft Computing Springer Berlin Heidelberg 19/9(2015-09-01), 2619-2632 1432-7643 19:9<2619 2015 19 500 https://doi.org/10.1007/s00500-014-1429-z text/html Onlinezugriff via DOI BK010053 XK010053 XK010000 Metadata rights reserved Springer special CC-BY-NC licence nationallicence 1 research-article jats NATIONALLICENCE NATIONALLICENCE NL-springer NATIONALLICENCE 856 40 https://doi.org/10.1007/s00500-014-1429-z text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Binh Huynh School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam aut NATIONALLICENCE 700 1- Duong Nguyen School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam aut NATIONALLICENCE 773 0- Soft Computing Springer Berlin Heidelberg 19/9(2015-09-01), 2619-2632 1432-7643 19:9<2619 2015 19 500