A Goal Programming Model for Network Reliability Design Problem  
Author Seyedmohsen Hosseini
Co-Author(s) MD Sarder; Ahmed Islam
Abstract Network design problem (NDP) is a well-known combinatorial NP-hard which involves selecting a subset of possible network edges in respect to different objectives such as maximizing the network reliability and/or minimizing the network cost. Most researchers about NDP have previously focused on single objective optimization, minimizing total cost of network in respect to the network’s reliability. To the best of our knowledge, no solution exists to multiobjective NDP when considering two conflicting objectives; maximizing network reliability and minimizing total cost of network simultaneously. Hence, this motivates to propose a variant of the Nondominated Sorting Genetic Algorithm (NSGA-II) to solve the multi-objective NDP. The proposed algorithm exhibits a high ability to identify a set of non-dominated solution. Finally, an illustrative example is conducted to examine the performance of the proposed NSGA-II.
Keywords Network reliability, Optimization, Genetic algorithm, Network design, Multi-objective, Communication network
    Article #:  23-049
Proceedings of the 23rd ISSAT International Conference on Reliability and Quality in Design
August 3-5, 2017 - Chicago, Illinois, U.S.A.