This study introduces a new optimization approach called quasirandom metaheuristic based on fractal search (QRFS), which harnesses the power of fractal geometry, low discrepancy sequences, and intelligent search space partitioning techniques. The QRFS uses fractals’ inherent self-similarity and intricate structure to guide the solution space exploration. For the proposal, a deterministic but quasi-random element is used in the search process using low discrepancy sequences, such as Sobol, Halton, Hammersley, and Latin Hypercube. This integration allows the algorithm to systematically cover the search space while maintaining the level of diversity necessary for efficient exploration. The QRFS employs a dynamic strategy of partitioning the search space and reducing the population of solutions to optimize the use of function accesses, which causes it to adapt well to the characteristics of the problem. The algorithm intelligently identifies and prioritizes promising regions within the fractal-based representation, allocating computational resources where they are most likely to yield optimal solutions.
引用格式
Diego Oliva (2025). Quasi-random Fractal Search (QRFS) (https://www.mathworks.com/matlabcentral/fileexchange/168761-quasi-random-fractal-search-qrfs), MATLAB Central File Exchange. 检索时间: .
Beltran, Luis A., et al. “Quasi-Random Fractal Search (QRFS): A Dynamic Metaheuristic with Sigmoid Population Decrement for Global Optimization.” Expert Systems with Applications, vol. 254, Elsevier BV, Nov. 2024, p. 124400, doi:10.1016/j.eswa.2024.124400.
MATLAB 版本兼容性
创建方式
R2024a
兼容任何版本
平台兼容性
Windows macOS Linux标签
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!版本 | 已发布 | 发行说明 | |
---|---|---|---|
1.0.0 |