A variable neighborhood search simheuristic for project portfolio selection under uncertainty
- 136 Downloads
With limited financial resources, decision-makers in firms and governments face the task of selecting the best portfolio of projects to invest in. As the pool of project proposals increases and more realistic constraints are considered, the problem becomes NP-hard. Thus, metaheuristics have been employed for solving large instances of the project portfolio selection problem (PPSP). However, most of the existing works do not account for uncertainty. This paper contributes to close this gap by analyzing a stochastic version of the PPSP: the goal is to maximize the expected net present value of the inversion, while considering random cash flows and discount rates in future periods, as well as a rich set of constraints including the maximum risk allowed. To solve this stochastic PPSP, a simulation-optimization algorithm is introduced. Our approach integrates a variable neighborhood search metaheuristic with Monte Carlo simulation. A series of computational experiments contribute to validate our approach and illustrate how the solutions vary as the level of uncertainty increases.
KeywordsProject portfolio selection Stochastic optimization Net present value Variable neighborhood search Simheuristics
This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P, TRA2015-71883-REDT), FEDER. and the Erasmus+ programme (20161ES01KA108023465).
- Melián, B.: Using memory to improve the VNS metaheuristic for the design of SDH/WDM networks. In: Proceedings of the Third International Conference on Hybrid Metaheuristics, HM’06, pp. 82–93. Springer, Berlin (2006)Google Scholar
- Nikolaev, A.G., Jacobson, S.H.: Simulated annealing. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, volume 146 of International Series in Operations Research & Management Science, 2nd edn, pp. 1–39. Springer, New York (2010)Google Scholar