Modeling and project portfolio selection problem enriched with dynamic allocation of resources

Abstract

The problems of the real world, within which the variable time is present, have involved continuous changes. These problems usually change over time in their objectives, constraints or parameters. Therefore, it is necessary to carry out a readjustment when calculating their solution. This paper proposes an original way of approaching the project portfolio selection problem enriched with dynamic allocation of resources. A new mathematical model is proposed formulating this multi-objective optimization problem, as well as its exact and approximate solution, the latter based on four of the algorithms that in our opinion stand out in the state of the art: Archive-Based hybrid Scatter Search, MultiObjective Cellular, Nondominated Sorting Genetic Algorithm II and Strength Pareto Evolutionary Algorithm 2. We experimentally demonstrate the benefits of our proposal and leave open the possibility that its study will apply to large-scale problems.