Sub- Diving Labeling Method for Optimization Problem by Genetic Algorithm
원문 초록
In many global Optimization Problems, it is required to evaluate a global point (min or max) in large space that calculation effort is very high. In this paper is presented new approach for optimization problem with subdivision labeling method (SLM) but in this method for higher dimensional has high computational. SLM Genetic Algorithm (SLMGA) in optimization problems is one of the solutions of this problem. In proposed algorithm the initial population is crossing points and subdividing in each step is according to mutation. RSLMGA is compared with other well known algorithms: DE, PGA, Grefensstette and Eshelman and numerical results show that RSLMGA achieve global optimal point with more decision by smaller generations.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
NeRF-based CBCT Reconstruction needs Normalization and Initialization
A Hybrid GA LLM Framework for Structured Task Optimization
A Divide-and-Conquer Approach for Global Orientation of Non-Watertight Scene-Level Point Clouds Using 0-1 Integer Optimization
Improving LLM-based Global Optimization with Search Space Partitioning
Physics-guided and fabrication-aware inverse design of photonic devices using diffusion models
SUDO: Enhancing Text-to-Image Diffusion Models with Self-Supervised Direct Preference Optimization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.