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 条
  • [31] Adaptive near-optimal controllers for non-linear decentralised feedback stabilisation problems
    Wang, Ding
    He, Haibo
    Zhao, Bo
    Liu, Derong
    IET CONTROL THEORY AND APPLICATIONS, 2017, 11 (06): : 799 - 806
  • [32] A Near-Optimal Hierarchical Estimate Based Adaptive Finite Element Method for Obstacle Problems
    Zou, Qingsong
    DOMAIN DECOMPOSITION METHODS IN SCIENCE AND ENGINEERING XIX, 2011, 78 : 317 - 324
  • [33] Near-optimal solutions of large-scale single-machine scheduling problems
    Avella, P
    Boccia, M
    D'Auria, B
    INFORMS JOURNAL ON COMPUTING, 2005, 17 (02) : 183 - 191
  • [34] Finding Near-optimal Configurations in Colossal Spaces with Statistical Guarantees
    Oh, Jeho
    Batory, Don
    Heradio, Ruben
    ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY, 2024, 33 (01)
  • [35] Finding Near-Optimal Configurations in Product Lines by Random Sampling
    Oh, Jeho
    Batory, Don
    Myers, Margaret
    Siegmund, Norbert
    ESEC/FSE 2017: PROCEEDINGS OF THE 2017 11TH JOINT MEETING ON FOUNDATIONS OF SOFTWARE ENGINEERING, 2017, : 61 - 71
  • [36] Study on near-optimal path finding strategies in a road network
    Shi Jun
    Li Jian-yuan
    Cao Han
    Wang Xi-li
    JOURNAL OF ALGORITHMS & COMPUTATIONAL TECHNOLOGY, 2008, 2 (03) : 319 - 333
  • [37] Finding Near-Optimal Groups of Epidemic Spreaders in a Complex Network
    Moores, Geoffrey
    Shakarian, Paulo
    Macdonald, Brian
    Howard, Nicholas
    PLOS ONE, 2014, 9 (04):
  • [38] On the hardness of finding near-optimal multicuts in directed acyclic graphs
    Bentz, Cedric
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (39) : 5325 - 5332
  • [39] Finding near-optimal build orientations for shape deposition manufacturing
    Gupta, SK
    Tian, Q
    Weiss, L
    MACHINING IMPOSSIBLE SHAPES, 1999, 18 : 208 - 216
  • [40] A Hierarchy of Near-Optimal Policies for Multistage Adaptive Optimization
    Bertsimas, Dimitris
    Iancu, Dan Andrei
    Parrilo, Pablo A.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2011, 56 (12) : 2803 - 2818