Mathematical Programming: Series A and B
A branch and bound algorithm for the bilevel programming problem
SIAM Journal on Scientific and Statistical Computing
Descent approaches for quadratic bilevel programming
Journal of Optimization Theory and Applications
Developing a simulated annealing algorithm for the cutting stock problem
Computers and Industrial Engineering
On the parameter identification problem in the plane and polar fractal interpolation functions
Journal of Approximation Theory
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
A Global Optimization Method for Solving Convex Quadratic Bilevel Programming Problems
Journal of Global Optimization
WSEAS TRANSACTIONS on SYSTEMS
Hi-index | 0.00 |
Graph fitness optimization is a difficult problem in data fitness. Genetic algorithms(GAs), which can yield accurate results if they start with suitable parameters, have been used to solve difficult problems with objective functions which usually are multi-modal, discontinuous, and nondifferentiable. In this paper, we design a genetic algorithm (GA) to optimize effect on self-affine fractal interpolation function (AFIF) and give result. The software was tested on realistic graphs. The validation and effectiveness of the method to be able to find the optimal fractal function are presented and demonstrated.