A hybrid approach to solve a bi-objective optimization problem of a capacitated-flow network with a time factor

被引:12
|
作者
Yeh, Cheng-Ta [1 ]
机构
[1] Fu Jen Catholic Univ, Dept Informat Management, New Taipei, Taiwan
关键词
Capacitated-flow network; Quickest path problem; Time factor; System reliability; Component assignment; Non-dominated sorting genetic algorithm II; Minimal path; Information entropy; Simple additive weighting; QUICKEST PATH PROBLEM; REDUNDANCY ALLOCATION; SYSTEM RELIABILITY; MINIMAL PATHS; TRANSMISSION RELIABILITY; CORRELATED FAILURES; GENETIC ALGORITHM; NSGA-II; SUBJECT; ENUMERATION;
D O I
10.1016/j.ress.2020.107191
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The problem of system reliability evaluation for a capacitated-flow network has been extended by involving the characteristics of the quickest path problem. System reliability is thus defined as the probability that d units of demand can be successfully delivered from a source node to a sink node within time t. System reliability optimization considering the time factor is important for demand transmission, especially for communication systems. However, this factor has not been taken into account in previous research. To this end, in this study, the time factor is employed to adopt a component assignment strategy to maximize the system reliability and minimize the assignment cost. Because the considered problem is bi-objective, a hybrid approach integrating the non-dominated sorting genetic algorithm II, a concept of minimal path, information entropy, and simple additive weighting is developed to determine a set of non-dominated solutions and to subsequently determine the compromise solution from an objective viewpoint. Numerical examples are utilized to demonstrate the computational efficiency of the proposed method.
引用
收藏
页数:12
相关论文
共 50 条
  • [21] Solving the bi-objective maximum-flow network-interdiction problem
    Royset, Johannes O.
    Wood, R. Kevin
    [J]. INFORMS JOURNAL ON COMPUTING, 2007, 19 (02) : 175 - 184
  • [22] Exact and heuristic methods to solve a bi-objective problem of sustainable cultivation
    Angelo Aliano Filho
    Helenice de Oliveira Florentino
    Margarida Vaz Pato
    Sônia Cristina Poltroniere
    João Fernando da Silva Costa
    [J]. Annals of Operations Research, 2022, 314 : 347 - 376
  • [23] Hybrid Genetic Algorithm for Bi-objective Assignment Problem
    Ratli, Mustapha
    Eddaly, Mansour
    Jarboui, Bassem
    Lecomte, Sylvain
    Hanafi, Said
    [J]. PROCEEDINGS OF 2013 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IEEE-IESM 2013), 2013, : 35 - 40
  • [24] A Bi-Objective Capacitated Location-Routing Problem for Multiple Perishable Commodities
    Li, Pu
    Lan, Hongjie
    Saldanha-Da-Gama, Francisco
    [J]. IEEE ACCESS, 2019, 7 : 136729 - 136742
  • [25] Exact and heuristic methods to solve a bi-objective problem of sustainable cultivation
    Aliano Filho, Angelo
    de Oliveira Florentino, Helenice
    Pato, Margarida Vaz
    Poltroniere, Sonia Cristina
    da Silva Costa, Joao Fernando
    [J]. ANNALS OF OPERATIONS RESEARCH, 2022, 314 (02) : 347 - 376
  • [26] Bi-Objective Capacitated Transportation Problem with Bounds over Distributions and Requirement Capacities
    Sharma S.
    Arora S.
    [J]. International Journal of Applied and Computational Mathematics, 2021, 7 (3)
  • [27] Efficient anytime algorithms to solve the bi-objective Next Release Problem
    Angel Dominguez-Rios, Miguel
    Chicano, Francisco
    Alba, Enrique
    del Aguila, Isabel
    del Sagrado, Jose
    [J]. JOURNAL OF SYSTEMS AND SOFTWARE, 2019, 156 : 217 - 231
  • [28] A Bi-objective Optimization Problem about Rescue Route during Disaster Time
    Gai, Wen-mei
    Deng, Yun-feng
    Li, Jing
    Du, Yan
    Ye, Fang-qi
    [J]. 2014 33RD CHINESE CONTROL CONFERENCE (CCC), 2014, : 8900 - 8904
  • [29] Using a Genetic Algorithm to Solve a Bi-Objective WWTP Process Optimization
    Costa, Lino
    Espirito Santo, Isabel A. C. P.
    Fernandes, Edite M. G. P.
    [J]. OPERATIONS RESEARCH PROCEEDINGS 2010, 2011, : 359 - 364
  • [30] Optimization of fuzzy bi-objective fractional assignment problem
    Neha Gupta
    [J]. OPSEARCH, 2019, 56 : 1091 - 1102