DEVELOPMENT OF THE EGYPTIAN VULTURE OPTIMIZATION ALGORITHM WITH THE NEAREST OR FAREST NEIGHBORHOOD METHODS

Nowadays, there are old and new methods that involve the difficult problems and solution suggestions which many researchers research and try to solve. In the field of engineering, the success rates of the methods that produce solutions to these problems are often compared to the travelling salesman problems. Many studies have been done to solve the problems in the best way. In this paper, a new method, the Egyptian Vulture algorithm, was used. The purpose of the study is to solve the Travelling Salesman problem by adding the nearest and the farthest neighbour structures to the Egyptian Vulture algorithm in order to obtain better results in the problems that occur in the data sets of the paper. The nearest neighbors or the farthest neighbors is a scientific contribution to the algorithm. Performance and success of the proposed method are showed by tests.