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

References

1. 1. F Glover, HJ Greenberg 1989 New approaches for heuristic search: A bilateral linkage with artificial intelligence, European Journal of Operational Research, pp 119 – 130, North-Holland. 2. DL Applegate, RE Bixby, V Chvatal, WJ Cook, 2007, the traveling salesman problem: a computational study, 59 pages, Princeton University Press (Date of access: 11.10.2017) 3. C. Sur, S. Sharma, A. Shukla, 2013, Egyptian Vulture Optimization Algorithm – A New Nature Inspired Metaheuristics for Knapsack Problem, ABV Indıan Institute of in İnformation Technology & Managment Gwalior, pp 227-237, Madha Pradesh, India. 4. C. Sur, S. Sharma, A. Shukla, 2013, Solving Travelling Salesman Problem Using Egyptian Vulture Optimization Algorithm – A New Approach, ABV Indıan Institute of in İnformation Technology &Managment Gwalior, pp 254-267, Madha Pradesh, India. 5. M Dorigo, LM Gambardella, 1997. Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactıons On Evolutıonary Computation, pp 53 – 66. 6. H. Eldem, E. Ulker, 2014, Küre Üzerinde 3 Boyutlu Gezgin Satıcı Problemi Çözümünde Parçacık Sürü Optimizasyonu Uygulaması, XVI. Akademik Bilişim Konferansı Bildirileri Kitabı, pp 461-469, Mersin, Turkey (in Turkish language).