Solving NP hard problems using a new genetic algorithm
سال انتشار: 1402
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 105
فایل این مقاله در 11 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJNAA-14-1_023
تاریخ نمایه سازی: 5 شهریور 1402
چکیده مقاله:
Over the past few decades, a lot of meta-heuristics have been developed to solve N-P hard problems. Genetic algorithm, ant colony optimization, simulated annealing, electromagnetism algorithm and tabu search are some examples of meta-heuristics algorithms. These kinds of algorithms have two main classes: population-based and Trajectory. Many of these algorithms are inspired by various phenomena of nature. In this research, the author introduces a new population-based method inspired by the lifestyle of lions and the genetic algorithm’s structure called the new genetic algorithm (NGA). The social behaviour of lions and genetic operators like mutation and cross-over is the main structure of NGA. Finally, the NGA is compared with the hybrid genetic and hybrid ant colony optimization as the best existing algorithms in the literature. The experimental results have revealed that the NGA is competitive in terms of solution quality to solve the vehicle routing and scheduling problems as two main categories of N-P hard problems.
کلیدواژه ها:
نویسندگان
Mohammad Ali Ebrahimi
Department of Industrial Management, Yazd Branch, Islamic Azad University, Yazd, Iran
Hassan Dehghan Dehnavi
Department of Industrial Management, Yazd Branch, Islamic Azad University, Yazd, Iran
Mohammad Mirabi
Department of Industrial Engineering, Meybod University, Meybod, Iran
Mohammad Taghi Honari
Department of Industrial Management, Yazd Branch, Islamic Azad University, Yazd, Iran
Abolfazl Sadeghian
Department of Industrial Management, Yazd Branch, Islamic Azad University, Yazd, Iran