2018
DOI: 10.1007/s10732-018-9367-z
|View full text |Cite
|
Sign up to set email alerts
|

A variable neighborhood search simheuristic for project portfolio selection under uncertainty

Abstract: 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 stocha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
32
0
2

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
4
2

Relationship

3
7

Authors

Journals

citations
Cited by 58 publications
(34 citation statements)
references
References 39 publications
0
32
0
2
Order By: Relevance
“…(, ) analyze the waste collection problem in modern urban areas and propose a simheuristic algorithm to solve its stochastic variant. Finance : Panadero et al. () consider a project portfolio optimization problem under uncertainty conditions, and employ a simheuristic to support decision making in this context. Methodology : Grasas et al. () and Ferone et al.…”
Section: Literature Reviewmentioning
confidence: 99%
“…(, ) analyze the waste collection problem in modern urban areas and propose a simheuristic algorithm to solve its stochastic variant. Finance : Panadero et al. () consider a project portfolio optimization problem under uncertainty conditions, and employ a simheuristic to support decision making in this context. Methodology : Grasas et al. () and Ferone et al.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Their model was NP-hard and required a meta-heuristic solution approach. Panadero, Doering, Kizys, Juan, and Fito (2018) suggested that by increasing the pool of project proposals and consideration of realistic constraints, PPS becomes NP-hard. Therefore, they presented a variable neighborhood search semi-heuristic for PPS.…”
Section: Heuristic and Meta-heuristicmentioning
confidence: 99%
“…With the improved GA, the result was more accurate and robust, and required less computation time than other algorithms. Panadero et al [19] solved the stochastic project portfolio selection problem with a variable neighborhood search simhueristic.…”
Section: Introductionmentioning
confidence: 99%