Application of immune algorithms on solving minimum-cost problem of water distribution network

被引:29
|
作者
Chu, Chien-Wei [1 ]
Lin, Min-Der [1 ]
Liu, Gee-Fon [1 ]
Sung, Yung-Hsing [1 ]
机构
[1] Natl Chung Hsing Univ, Dept Environm Engn, Taichung 40227, Taiwan
关键词
Immune algorithm (IA); Modified immune algorithm (mIA); Water distribution network; Optimization;
D O I
10.1016/j.mcm.2008.02.008
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Immune algorithm (IA) is a set of computational systems inspired by the defense process of the biological immune system. This study proposed an optimization procedure based on IA framework to optimize the designs of water distribution networks. A modified IA (mIA) procedure, which employs genetic algorithm (GA) to briefly screen initial antibody repertoires for IA, is also developed. The well-known benchmark instance, New York City Tunnel (NYCT) problem, is utilized as a case study to evaluate the optimization performance of IA and mIA. The least-cost designs of NYCT obtained by IA and mIA are compared with those by GA and fast messy GA previously published in the literature. The results of comparison reveal that IA and mIA are able to find the optimal solutions of NYCT with higher computational efficiency (less number of evaluations) than GA and fmGA. Notable performance enhancement is observed in mIA, indicating that the combination of GA can significantly improve the optimization performance of IA. (C) 2008 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1888 / 1900
页数:13
相关论文
共 50 条
  • [1] GEOMETRIC ALGORITHMS FOR THE MINIMUM-COST ASSIGNMENT PROBLEM
    TOKUYAMA, T
    NAKANO, J
    [J]. RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (04) : 393 - 406
  • [2] Solving the minimum-cost double Roman domination problem
    Barisic, Ana Klobucar
    Manger, Robert
    [J]. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2024, 32 (03) : 793 - 817
  • [3] Solving the minimum-cost double Roman domination problem
    Barisic, Ana Klobucar
    Manger, Robert
    [J]. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2024, 32 (03) : 793 - 817
  • [4] A NETWORK SIMPLEX ALGORITHM FOR SOLVING THE MINIMUM DISTRIBUTION COST PROBLEM
    Wang, I-Lin
    Lin, Shiou-Jie
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2009, 5 (04) : 929 - 950
  • [5] Formulation and Algorithms for Discrete Minimum-Cost Group Assembly Problem
    Peng, Fan
    Hwang, Taesung
    Ouyang, Yanfeng
    [J]. TRANSPORTATION RESEARCH RECORD, 2013, (2333) : 9 - 15
  • [6] Application of Genetic Immune Algorithm on Solving Disinfection Problem of Water Distribution Network System
    Chu, Chien-Wei
    Yeh, Shuang-Fu
    Lin, Min-Der
    [J]. INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS (IMECS 2010), VOLS I-III, 2010, : 92 - 97
  • [7] Solving minimum-cost shared arborescence problems
    Alvarez-Miranda, Eduardo
    Ljubic, Ivana
    Luipersbeck, Martin
    Sinnl, Markus
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 258 (03) : 887 - 901
  • [8] Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
    Burkard, RE
    Feldbacher, K
    Klinz, B
    Woeginger, GJ
    [J]. NETWORKS, 1999, 33 (01) : 57 - 70
  • [9] SOLVING MINIMUM-COST FEED MIX PROBLEMS
    Swanson, Earl R.
    [J]. JOURNAL OF FARM ECONOMICS, 1955, 37 (01): : 135 - 139
  • [10] MINIMUM-COST MULTICOMMODITY NETWORK FLOWS
    TOMLIN, JA
    [J]. OPERATIONS RESEARCH, 1966, 14 (01) : 45 - &