Showing 2 results for Meta-Heuristic Algorithms
K. Eshgee and M. Kazemi,
Volume 23, Issue 1 (7-2004)
Abstract
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system is developed for ALRP by using the properties of the graph model. Computational results show the efficiency of the proposed algorithm in comparison with other techniques for solving SLRP.
N. Mashhadi Mohammad Reza , H. Omranpour,
Volume 41, Issue 1 (9-2022)
Abstract
One of the most important issues in engineering is to find the optimal global points of the functions used. It is not easy to find such a point in some functions due to the reasons such as large number of dimensions or inability to derive them from the function. Also in engineering modeling, we do not have the relationships of many functions, but we can input and output them as a black box. Therefore, the meta-heuristic algorithms are presented.
In this paper, a meta-heuristic algorithm based on the behavior of vortices in fluid physics is presented. Technically, the algorithm is made up of vortices. Each vortex contains some particles. The particles move by the presented rotation matrix. This movement causes the local search. Also by selecting another vortex through the selection algorithm, each vortex attempts to escape the local optima and reach the global optima. The algorithm will explore and exploit the given function using its operators. Another innovation of this paper is the introduction of two new evaluation criteria for optimization algorithms. These two criteria show the behavior and convergence of algorithms along the way to reach the global optimal point or fall into the local optima. The proposed algorithm has been implemented, evaluated and compared with the numerical optimization state of the art algorithms. It was observed that the proposed method was able to achieve better results than most of the other methods in the major of twenty-four standard functions in different dimensions. (All codes available at http://web.nit.ac.ir/ h.omranpour/.).
