The Project Portfolio Selection and Scheduling Problem: Mathematical Model and Algorithms
سال انتشار: 1392
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 465
فایل این مقاله در 8 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
این مقاله در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JOIE-6-13_007
تاریخ نمایه سازی: 22 آبان 1397
چکیده مقاله:
This paper investigates the problem of selecting and scheduling a set of projects among available projects. Each project consists of several tasks and to perform each one some resource is required. The objective is to maximize total benefit. The paper constructs a mathematical formulation in form of mixed integer linear programming model. Three effective metaheuristics in form of the imperialist competitive algorithm, simulated annealing and genetic algorithm are developed to solve such a hard problem. The proposed algorithms employ advanced operators. The performance of the proposed algorithms is numerically evaluated. The results show the high performance of the imperialist competitive algorithm outperforms the other algorithms.
کلیدواژه ها:
Project portfolio selection and scheduling ، imperialist competitive algorithm ، simulated annealing ، genetic algorithm ، mixed integer programming
نویسندگان
Bahman Naderi
Assistant Professor, Young Researchers and Elite Club, Qazvin Branch, Islamic Azad University, Qazvin, Iran