kgb-dmoea

KO | EN

gitlite — search

#nextjs #macos #android #tailwindcss #cli #gemini #containers #http #php #awesome-list

(★ 19)

A Python implementation of the Knowledge Guided Bayesian Dynamic Multi-Objective Evolutionary Algorithm (KGB-DMOEA)

파일 탐색기

ZIP 다운로드

.gitignore
df-problems-test.py
improvements.md
kgb.py
LICENCE
output_plot.png
ps.json
README.md

# CDN으로 사용하기

jsDelivr

jsDelivr는 공개 GitHub 리포지토리를 별도 설정 없이 CDN으로 즉시 서빙합니다. 버전과 파일을 고르면 웹페이지에 바로 붙일 수 있는 링크와 예시 코드가 만들어집니다.

버전

파일

링크

예시

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

A Python implementation of the **K**nowledge **G**uided **B**ayesian **D**ynamic **M**ulti-**O**bjective **E**volutionary **A**lgorithm (KGB-DMOEA).

## Description

The algorithm is implemented based on [1]. KGB-DMOEA saves historical Pareto-Optimal Solutions in an archive. When environmental change is detected, a knowledge reconstruction-examination strategy (KRE) is conducted in order to divide historical optimal solutions into useful and useless solutions for the current environment. Subsequently a naive Bayesian classifier is trained by using the classified historical solutions as samples. The trained classifier is able to predict from a set of randomly generated solutions, which ones are useful to the new environment. This results in a predicted population for the new environment that can then be optimized using any population based algorithm.

The implementation uses [Pymoo](https://github.com/anyoptimization/pymoo) as a framework [2].

## Status

- Currently NSGA-2 is used a static optimizer [4].
- The implementation is still in development and has been tested on the DF Problem Suite so far, but further validation is needed [3].

## Support and contributions

Feel free to contact me charlesdavid@mupende.com if you have any questions or suggestions in regards to the implementation. For question concerning the algorithm, please contact the original authors.

## References

[1] Ye, Yulong, Lingjie Li, Qiuzhen Lin, Ka-Chun Wong, Jianqiang Li, and Zhong Ming. “Knowledge Guided Bayesian Classification for Dynamic Multi-Objective Optimization.” Knowledge-Based Systems, June 2022, 109173 <https://doi.org/10.1016/j.knosys.2022.109173>.

[2] J. Blank and K. Deb, pymoo: Multi-Objective Optimization in Python, in IEEE Access, vol. 8, pp. 89497-89509, 2020 <https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9078759>.

[3] Shouyong Jiang, Shengxiang Yang, Xin Yao, Kay Chen Tan, Marcus Kaiser, and Natalio Krasnogor. Benchmark problems for cec2018 competition on dynamic multiobjective optimisation. In 2018 <http://homepages.cs.ncl.ac.uk/shouyong.jiang/cec2018/CEC2018_Tech_Rep_DMOP.pdf>.

[4] K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: nsga-II. Trans. Evol. Comp, 6(2):182–197, April 2002 <http://dx.doi.org/10.1109/4235.996017>.

kgb-dmoea

오너의 다른 레포

파일 탐색기

# CDN으로 사용하기

Was this content helpful?

Recent Feedback

kgb-dmoea

오너의 다른 레포

파일 탐색기

# CDN으로 사용하기

Was this content helpful?

Recent Feedback

Download README