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 条
  • [21] Near-Optimal Sparse Adaptive Group Testing
    Tan, Nelvin
    Scarlett, Jonathan
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 1420 - 1425
  • [22] A near-optimal probing strategy for workpiece localization
    Xiong, ZH
    Wang, MY
    Li, ZX
    IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2004, 20 (04): : 668 - 676
  • [23] Near-optimal control for stochastic recursive problems
    Hui, Eddie
    Huang, Jianhui
    Li, Xun
    Wang, Guangchen
    SYSTEMS & CONTROL LETTERS, 2011, 60 (03) : 161 - 168
  • [24] Finding a Near-Optimal Neural-Adaptive Control Solution Without Increasing the Training Time
    Macnab, C. J. B.
    2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2017,
  • [25] Near-Optimal Quantum Algorithms for String Problems
    Akmal, Shyan
    Jin, Ce
    ALGORITHMICA, 2023, 85 (08) : 2260 - 2317
  • [26] Near-Optimal Quantum Algorithms for String Problems
    Akmal, Shyan
    Jin, Ce
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 2791 - 2832
  • [27] Near-Optimal SOC Trajectory for Traffic-Based Adaptive PHEV Control Strategy
    Montazeri-Gh, Morteza
    Pourbafarani, Zeinab
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2017, 66 (11) : 9753 - 9760
  • [28] Finding better alternatives: Shadow prices of near-optimal solutions in energy system optimization modeling
    Schwaeppe, Henrik
    Thams, Marten Simon
    Walter, Julian
    Moser, Albert
    ENERGY, 2024, 292
  • [29] Near-Optimal Quantum Algorithms for String Problems
    Shyan Akmal
    Ce Jin
    Algorithmica, 2023, 85 : 2260 - 2317
  • [30] SYNTHESIS OF OPTIMAL AND NEAR-OPTIMAL DISTILLATION SEQUENCES BY A BOUNDING STRATEGY
    PIBOULEAU, L
    SAID, A
    DOMENECH, S
    CHEMICAL ENGINEERING JOURNAL AND THE BIOCHEMICAL ENGINEERING JOURNAL, 1983, 27 (01): : 9 - 19