A Competitive Nature-Inspired Cuckoo Search Algorithm for Solving the Resource Constrained Project Scheduling Problem
سال انتشار: 1400
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 148
فایل این مقاله در 17 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEN-1-3_005
تاریخ نمایه سازی: 12 دی 1401
چکیده مقاله:
Since its advent, the resource constrained project scheduling problem has been a favorite NP-Hard problem studied by many researchers. In this paper, we examine this problem with a focus on the total project time minimization, usually known as the makespan minimization. To this end, a nature-inspired Cuckoo Search Algorithm (CSA) has been introduced that works by simulating the brooding parasitism of some cuckoo birds in nature. In a nutshell, the proposed cuckoo search algorithm has two main capabilities including: a) a global random search using Levy flights, and b) a local random refinement strategy. In addition, a double justification method has been employed to improve the generated solutions. Simultaneous use of these features can maximize the efficiency of resource searches in uncertain environments. Experimental results on the standard J۳۰, J۶۰, and J۱۲۰ test sets from the PSPLIB are also presented, showing that the CSA has satisfying results compared with the other well-reported algorithms.
کلیدواژه ها:
Resource Constrained Project Scheduling ، Meta-heuristics ، Cuckoo Search ، Levy Flights ، Makespan Minimization
نویسندگان
Seyed Taha Hossein Mortaji
PhD., Iran University of Science and Technology, Industrial Engineering Department, Tehran, Iran.
Mohammadreza Hosseinzadeh
PhD., Iran University of Science and Technology, Industrial Engineering Department, Tehran, Iran.