TY - JOUR
AU - Lursinsap, Chidchanok
PY - 2019/03/05
Y2 - 2024/05/22
TI - A Generic Form of Evolutionary Algorithms and Manifold Drift Concept
JF - INTERNATIONAL SCIENTIFIC JOURNAL OF ENGINEERING AND TECHNOLOGY (ISJET)
JA - int. sci. j eng. tech.
VL - 2
IS - 1
SE - Academic Article
DO -
UR - https://ph02.tci-thaijo.org/index.php/isjet/article/view/175897
SP - 1-10
AB - <p>Most of optimization problems in various fields are in NP-class. This implies that the time to find the optimum solution of any problem is obviously non-polynomial. Although the development of high speed computer architectures and the concept parallel computing is practically successful, some of these problems are constrained by the problem of tight data dependency which prevents the possibility of deploying a parallel architecture as well as processing to solve the problem. Evolutionary algorithms which are based on guessing solutions have been developed to find an acceptable solution in a short time. However, the processing time based on guessing to achieve the acceptable solution is unpredictable and uncontrollable. In this paper, we compare the guessing process in some popular algorithms to define a generic structure of searching process and solution finding process. This structure will help develop a new evolutionary algorithm. Furthermore, a new concept of manifold drift for avoiding the guessing process in order to speed up the solution search is also discussed.</p>
ER -