Universal Approach to Solution of Optimization Problems by Symbolic Regression

• Published in: Applied sciences Vol. 11; no. 11; p. 5081
• Main Authors: Sofronova, Elena, Diveev, Askhat
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01-06-2021
• Subjects: Algorithms; Codes; control synthesis; Euclidean geometry; Genetic algorithms; Heredity; knapsack problem; Multiplication; numerical measurement; Optimization; Partial differential equations; Search algorithms; small variation; symbolic regression; Traveling salesman problem; Variation
• ISSN: 2076-3417; 2076-3417
• DOI: 10.3390/app11115081

Optimization problems and their solution by symbolic regression methods are considered. The search is performed on non-Euclidean space. In such spaces it is impossible to determine a distance between two potential solutions and, therefore, algorithms using arithmetic operations of multiplication and addition are not used there. The search of optimal solution is performed on the space of codes. It is proposed that the principle of small variations of basic solution be applied as a universal approach to create search algorithms. Small variations cause a neighborhood of a potential solution, and the solution is searched for within this neighborhood. The concept of inheritance property is introduced. It is shown that for non-Euclidean search space, the application of evolution and small variations of possible solutions is effective. Examples of using the principle of small variation of basic solution for different symbolic regression methods are presented.