An adaptive knowledge evolution strategy for finding near-optimal solutions of specific problems

被引:4
|
作者
Huang, Yo-Ping [1 ]
Chang, Yueh-Tsun [2 ]
Hsieh, Shang-Lin [2 ]
Sandnes, Frode Eiko [3 ]
机构
[1] Natl Taipei Univ Technol, Dept Elect Engn, Taipei 10608, Taiwan
[2] Tatung Univ, Dept Comp Sci & Engn, Taipei 10451, Taiwan
[3] Oslo Univ Coll, Fac Engn, Oslo, Norway
关键词
Self adaptation; Evolution computation; Knowledge sharing; Learning strategy; Community interaction; PARTICLE SWARM OPTIMIZATION; ANT COLONY OPTIMIZATION; GENETIC OPTIMIZATION; CLASSIFIER SYSTEMS; NETWORKS; ALGORITHM;
D O I
10.1016/j.eswa.2010.09.041
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Most real-world problems cannot be mathematically defined and/or structured modularly for peer researchers in the same community to facilitate their work. This is partially because there are no concrete defined methods that can help researchers clearly describe their problems and partially because one method fits one problem but does not apply to others. In order to apply someone's research results to new domains and for researchers to collaborate with each other more efficiently, a well-defined architecture with self-adaptive evolution strategies is proposed. It can automatically find the best solutions from existing knowledge and previous research experiences. The proposed architecture is based on object-oriented programming skills that in turn become foundations of the community interaction evolution strategy and knowledge sharing mechanism. They make up an autonomous evolution mechanism using a progressive learning strategy and a common knowledge packaging definition. The architecture defines fourteen highly modular classes that allow users to enhance collaboration with others in the same or similar research community. The presented evolution strategies also integrate the merits of users' predefined algorithms, group interaction and learning theory to approach the best solutions of specific problems. Finally, resource limitation problems are tackled to verify both the re-usability and flexibility of the proposed work. Our results show that even without using any specific tuning of the problems, optimal or near-optimal solutions are feasible. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:3806 / 3818
页数:13
相关论文
共 50 条
  • [1] Generating optimal and near-optimal solutions to facility location problems
    Church, Richard L.
    Baez, Carlos A.
    ENVIRONMENT AND PLANNING B-URBAN ANALYTICS AND CITY SCIENCE, 2020, 47 (06) : 1014 - 1030
  • [2] A game theoretical approach for finding near-optimal solutions of an optimization problem
    Hamidoglu, Ali
    OPTIMIZATION, 2023, 72 (10) : 2561 - 2583
  • [3] Near-optimal adaptive polygonization
    Seibold, W
    Joy, KI
    COMPUTER GRAPHICS INTERNATIONAL, PROCEEDINGS, 1999, : 206 - 213
  • [4] NEAR-OPTIMAL SOLUTIONS TO ONE-DIMENSIONAL CUTTING STOCK PROBLEMS
    ROODMAN, GM
    COMPUTERS & OPERATIONS RESEARCH, 1986, 13 (06) : 713 - 719
  • [5] Quickly finding near-optimal storage designs
    Anderson, E
    Spence, S
    Swaminathan, R
    Kallahalla, M
    Wang, Q
    ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2005, 23 (04): : 337 - 374
  • [6] Finding near-optimal independent sets at scale
    Lamm, Sebastian
    Sanders, Peter
    Schulz, Christian
    Strash, Darren
    Werneck, Renato F.
    JOURNAL OF HEURISTICS, 2017, 23 (04) : 207 - 229
  • [7] Deriving multiple near-optimal solutions to deterministic reservoir operation problems
    Liu, Pan
    Cai, Ximing
    Guo, Shenglian
    WATER RESOURCES RESEARCH, 2011, 47
  • [8] Finding near-optimal independent sets at scale
    Sebastian Lamm
    Peter Sanders
    Christian Schulz
    Darren Strash
    Renato F. Werneck
    Journal of Heuristics, 2017, 23 : 207 - 229
  • [9] Near-Optimal Adaptive Compressed Sensing
    Malloy, Matthew L.
    Nowak, Robert D.
    2012 CONFERENCE RECORD OF THE FORTY SIXTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR), 2012, : 1935 - 1939
  • [10] Near-Optimal Adaptive Compressed Sensing
    Malloy, Matthew L.
    Nowak, Robert D.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (07) : 4001 - 4012