چکیده مقاله
The Traveling Salesman Problem is a classic optimization challenge used to benchmark meta heuristic algorithms This paper introduces a novel approach, the Discrete Zebra Optimization Algorithm DZOA , specifically tailored for TSP Inspired by the foraging behavior of zebras, the Zebra Optimization Algorithm ZOA has shown promise in continuous optimization However, its application to discrete problems like TSP has been unexplored until now DZOA addresses this gap by combining a discrete version of ZOA with two innovative neighborhood search strategies This hybrid approach enables effective exploration of the TSP's discrete solution space To evaluate DZOA's performance, we applied it to 10 standard TSP instances from TSPLIB Our results demonstrate that DZOA significantly outperforms existing metaheuristic methods in both solution quality and computational efficiency
کلیدواژهها
نویسندگان
Sajjad Ghatei
Department of Computer Engineering, Faculty of Electrical and Computer Engineering, Technical and Vocational University TVU , Tehran, Iran
Mohammad RouhiHaji
Department of Computer Engineering, Payame Noor University PNU , Tehran, Iran
Zohreh ArabiBalaghi
Department of Computer Engineering, Faculty of Electrical and Computer Engineering, Technical and Vocational University TVU , Tehran, Iran
Hossein BarghiJond
Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Pragu, Czech Republic
شیوه ارجاع
Ghatei, Sajjad and RouhiHaji, Mohammad and ArabiBalaghi, Zohreh and BarghiJond, Hossein,1403,A Novel Discrete Zebra Optimization Algorithm for Traveling Salesman Problem,The 3th international conference on artificial intelligence and its future prospects in electrical, computer, mechanical and telecommunication engineering sciences.,Mashhad
ارائهشده در
مجموعه مقالات سومین کنفرانس بین المللی هوش مصنوعی و چشم انداز آینده آن در علوم مهندسی برق ، کامپیوتر ، مکانیک و مخابرات29 شهریور 1403 · مشهد