4.6 Article

Orchard Algorithm (OA): A new meta-heuristic algorithm for solving discrete and continuous optimization problems

Journal

MATHEMATICS AND COMPUTERS IN SIMULATION
Volume 208, Issue -, Pages 95-135

Publisher

ELSEVIER
DOI: 10.1016/j.matcom.2022.12.027

Keywords

Orchard Algorithm; Meta-heuristic; Optimization; Plants; Engineering problems

Ask authors/readers for more resources

This paper introduces the design and implementation of the Orchard Algorithm (OA), which is inspired by fruit gardening. The OA algorithm utilizes various actions such as irrigation, fertilization, trimming, and grafting to achieve optimal tree growth and fruit production. It combines personal and social behavior to explore and exploit the search space efficiently. Comparative analysis with 13 other algorithms demonstrates the superior performance of OA in solving optimization problems.
Meta-heuristic algorithms have been widely used to solve different optimization problems. There have always been ongoing efforts to develop new and efficient algorithms. In this paper, the Orchard Algorithm (OA) is designed and introduced, inspired by fruit gardening. In this process, various actions such as irrigation, fertilization, trimming, and grafting lead to a fruit orchard where most trees grow and produce fruit adequately. In OA, both explorations of the search space and exploitation of the best solutions are achieved using personal and social behavior. By introducing various operators such as annual growth, screening, and grafting, the algorithm can efficiently search and explore the search space. The performance of the proposed OA algorithm was evaluated on CEC2005, IEEE CEC06 2019,test functions, and five real-world engineering problems compared with 13 widely used and competitive algorithms. Thirty benchmark functions were used to compare the capabilities of the OA algorithm with other research. The OA yields far better results in many aspects than the other algorithms. The results show the OA's superiority and this algorithm's capability in solving optimization problems. (c) 2022 International Association for Mathematics and Computers in Simulation (IMACS). Published by Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available