A New Efficient Genetic Algorithm for Solving 2D Mazes
عنوان مقاله: A New Efficient Genetic Algorithm for Solving 2D Mazes
شناسه ملی مقاله: ACCSI12_075
منتشر شده در دوازدهمین کنفرانس سالانه انجمن کامپیوتر ایران در سال 1385
شناسه ملی مقاله: ACCSI12_075
منتشر شده در دوازدهمین کنفرانس سالانه انجمن کامپیوتر ایران در سال 1385
مشخصات نویسندگان مقاله:
Hanafi Alamdari - Electrical Engineering Faculty University Of Mazandran
Miar Naimi - Electrical Engineering Faculty University Of Mazandran
خلاصه مقاله:
Hanafi Alamdari - Electrical Engineering Faculty University Of Mazandran
Miar Naimi - Electrical Engineering Faculty University Of Mazandran
In this paper a new genetic algorithm is designed to solve a class of maze problems, more efficiently than the state of the arts. Here the solution is a set of paths directing every agent from any position in the maze towards a single goal point. The novel points of the proposed algorithm are the innovative crossover and mutation operators that improved the results. To evaluate the algorithm and compare it with other algorithms, different experiments were done. Here each algorithm for any problem was run five times and the average of the results was considered as the
evaluation measure. All experiments showed that the proposed algorithm is the most efficient one.
کلمات کلیدی: Maze, genetic algorithm, multi agent problems
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/44462/