TY - JOUR
ID - 140
TI - The project portfolio selection and scheduling problem: mathematical model and algorithms
JO - Journal of Optimization in Industrial Engineering
JA - JOIE
LA - en
SN - 2251-9904
AU - Naderi, Bahman
AD - Young Researches Club, Qazvin Branch, Islamic Azad University
Y1 - 2013
PY - 2013
VL - 6
IS - 13
SP - 65
EP - 72
KW - Project portfolio selection and scheduling
KW - Imperialist Competitive Algorithm
KW - simulated annealing
KW - Genetic Algorithm
KW - Mixed Integer programming
DO -
N2 - 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.
UR - http://www.qjie.ir/article_140.html
L1 - http://www.qjie.ir/article_140_73ac9fddc0f128714d5f83a11124b2e2.pdf
ER -