دانشکده مهندسی کامپیوتر برگزار می کند:

در ادامه سلسله وبینارهای تخصصی دانشکده مهندسی کامپیوتر، وبیناری حول موضوع الگوریتم های بهینه سازی با سخنرانی آقای سید امین حسینی برگزار می شود. از عموم علاقمندان دعوت می شود در این جلسه شرکت نمایند.

موضوع وبینار:

The Analysis and Comparison Performance of the two Algorithm ACO & ICA for global optimization based on solving TSP

 

زمان برگزاری: ۱۷ اسفند ماه ۱۳۹۹، ساعت ۱۲:۰۰

سخنران وبینار:

Seyed Amin Hosseini

Saint Petersburg University

لینک ورود به جلسه:

 https://vc.sru.ac.ir/r2piagg0nkbq/

خلاصه ای از محتوای وبینار:

This talk  presents a comparison between two algorithms of solving the Travelling Salesman Problem (TSP) to achieve a global optimum. The feature of an ant colony optimization algorithm (ACO) creates flexibility in solving any optimization problem. It constituts some metaheuristic optimization to search for an optimal path in a graph and it has been solving the Travelling Salesman Problem (TSP). The Imperialist Competitive Algorithm (ICA) is a new metaheuristic optimization based on a socio-politically motivated strategy which contains two steps: the movement of colonies and imperialist cimpetition. In this talk, we make a comparative study of the importatn factors of performace by two algorithms for global optimization. We use the same problem to solve applying two methods, and the same parameters for the problem to show how it works and which has a better performance. We run the TSP program in MATLAB software and compare it with the ICA program. The graphical results reveal the superiority of the ICA in performance for global optimization.