The Heuristic Procedure for Resource Constrained Proposal Project Portfolio Problem

2021 ◽  
Vol 22 (1) ◽  
pp. 135-159
Author(s):  
Yoon Jae Cho ◽  
In Soub Paek ◽  
Jong Chool Kim ◽  
Tae Ho Ahn
Author(s):  
Fausto Balderas ◽  
Eduardo Fernandez ◽  
Claudia Gomez ◽  
Laura Cruz-Reyes ◽  
Nelson Rangel V

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Yongyi Shou ◽  
Wenwen Xiang ◽  
Ying Li ◽  
Weijian Yao

A multiagent evolutionary algorithm is proposed to solve the resource-constrained project portfolio selection and scheduling problem. The proposed algorithm has a dual level structure. In the upper level a set of agents make decisions to select appropriate project portfolios. Each agent selects its project portfolio independently. The neighborhood competition operator and self-learning operator are designed to improve the agent’s energy, that is, the portfolio profit. In the lower level the selected projects are scheduled simultaneously and completion times are computed to estimate the expected portfolio profit. A priority rule-based heuristic is used by each agent to solve the multiproject scheduling problem. A set of instances were generated systematically from the widely used Patterson set. Computational experiments confirmed that the proposed evolutionary algorithm is effective for the resource-constrained project portfolio selection and scheduling problem.


Sign in / Sign up

Export Citation Format

Share Document