Trochoid Search Optimization
Abdesslem Layeb

TL;DR
The paper presents the Trochoid Search Optimization Algorithm (TSO), a new metaheuristic inspired by trochoid curves, demonstrating competitive performance and simplicity in solving benchmark optimization problems.
Contribution
Introduces TSO, a novel optimization algorithm based on trochoid curves, combining global and local search phases with minimal parameters for improved efficiency.
Findings
TSO performs well on benchmark functions.
TSO balances exploration and exploitation effectively.
TSO is simple with few user-defined parameters.
Abstract
This paper introduces the Trochoid Search Optimization Algorithm (TSO), a novel metaheuristic leveraging the mathematical properties of trochoid curves. The TSO algorithm employs a unique combination of simultaneous translational and rotational motions inherent in trochoids, fostering a refined equilibrium between explorative and exploitative search capabilities. Notably, TSO consists of two pivotal phases global and local search that collectively contribute to its efficiency and efficacy. Experimental validation demonstrates the TSO algorithm's remarkable performance across various benchmark functions, showcasing its competitive edge in balancing exploration and exploitation within the search space. A distinguishing feature of TSO lies in its simplicity, marked by a minimal requirement for user-defined parameters, making it an accessible yet powerful optimization tool.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMetaheuristic Optimization Algorithms Research · Artificial Intelligence in Games · Tribology and Lubrication Engineering
