Anzeige
Erschienen in:
01.06.2016 | Regular Research Paper
A survivable design of last mile communication networks using multi-objective genetic algorithms
Erschienen in: Memetic Computing | Ausgabe 2/2016
EinloggenAktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
In this paper, we are interested in the survivable network design problem (SNDP) for last mile communication networks called (L-SNDP). Given a connected, weighted, undirected graph \(\mathrm{{G}} = (\mathrm{V, E})\); a set of infrastructure nodes and a set of customers C including two customer types where customers in the subset C1 require a single connection (type-1) and customers in the subset C2 need to be redundantly connected (type-2). The aim is to seek a sub-graph of G with the smallest weight in which all customers are connected to infrastructure nodes and the connections are protected against failures. This is a NP-hard problem and it has been solved only with the objective of minimizing the network cost. In this paper, we introduce a new multi-objective approach to solve L-SNDP called ML-SNDP. These objectives are to minimize the network cost (total cost) and to minimize the maximal amount of sharing links between connections. Results of computational experiments reported show the efficiency of our proposal.