Grand Tour Algorithm - GTA
The Grand Tour Algorithm (GTA) is a swarm optimization technique based on the behavior of a peloton of cyclists, which embodies relevant physical concepts as well. GTA fulfils the main aspects of an optimization algorithm as ease of implementation, speed of convergence, and reliability, and is well suited for high dimension problems. In addition to the GTA source code, the folllowing 14 benchmarking codes are provided to test the algorithm.
Benchmarking Functions:
1) Paraboloid
2) Sphere
3) Rosenbrock
4) Rastrigin
5) Griewank
6) Schaffer's f6
7) Alpine
8) Brown
9) Chung Reynolds
10) Dixon Price
11) Exponential
12) Salomon
13) Schumer Steiglitz
14) Sum of Powers
15) Sum of Squares
16) Zakharov
Cite As
gustavo lima (2024). Grand Tour Algorithm - GTA (https://www.mathworks.com/matlabcentral/fileexchange/78922-grand-tour-algorithm-gta), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxTags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.0.0 |