Amirkabir University of TechnologyAmirkabir Journal of Civil Engineering2588-297X53520210723Jump of Circles: A New Way to Solve the Engineering Optimization ProblemsJump of Circles: A New Way to Solve the Engineering Optimization Problems19171936400210.22060/ceej.2020.17227.6496FAM. R.Ghasemi0000-0002-7014-6668NaderHaji Aghajanpourcivil engineering department, faculty of engineering, university of Sistan and Balouchestan, Zahedan, IranHamedGhohani ArabCivil Engineering Department, University of Sistan and Baluchestan, Zahedan, IranJournal Article20191015In this paper, a new meta-heuristic optimization method called the Jump of Circles Optimization Method is introduced. In any optimization problem, an answer zone is defined in which the optimization algorithms search the space to find the optimal answer. The method presented in this paper uses two important pillars in searching the answer zone. The first pillar is to use geometric principles. The Jump of circles uses the circle with decreasing radius. The second pillar is to use the meta-heuristic application. In meta-heuristic algorithms, the search points distribute randomly and jump in the answer zone. In the proposed method, the center of the searching circle jumps and sits on the optimal point of each step. The proposed algorithm solves the optimization problem in two phases. The first phase is optimal area exploration and the second phase is exploiting the exploration. Finally, the most optimal point that will be obtained from the two phases, is the optimal answer to the problem. In this paper, a new meta-heuristic optimization method called the Jump of Circles Optimization Method is introduced. In any optimization problem, an answer zone is defined in which the optimization algorithms search the space to find the optimal answer. The method presented in this paper uses two important pillars in searching the answer zone. The first pillar is to use geometric principles. The Jump of circles uses the circle with decreasing radius. The second pillar is to use the meta-heuristic application. In meta-heuristic algorithms, the search points distribute randomly and jump in the answer zone. In the proposed method, the center of the searching circle jumps and sits on the optimal point of each step. The proposed algorithm solves the optimization problem in two phases. The first phase is optimal area exploration and the second phase is exploiting the exploration. Finally, the most optimal point that will be obtained from the two phases, is the optimal answer to the problem. https://ceej.aut.ac.ir/article_4002_0aff036ddb37ac1be99869c9b8fde073.pdf