An Efficient Variable Neighborhood Search for Solving Multi-Criteria Project Portfolio Selection

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Sohrabi Ali Akbar; Ghanbari Reza; Ghorbani-Moghadam Khatere

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: CONTROL AND OPTIMIZATION IN APPLIED MATHEMATICS Year:2024 | Volume:9 | Issue:1 Page(s): 131-147

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

An Efficient Variable Neighborhood Search for Solving Multi-Criteria Project Portfolio Selection

Author(s)

Sohrabi Ali Akbar | Ghanbari Reza | Ghorbani-Moghadam Khatere | Issue Writer Certificate

Keywords

Project portfolio selection‎

‎Project interaction‎

‎Multi-criteria‎

‎Meta-heuristic algorithms

Abstract

Project portfolio selection is a critical challenge for many organizations as they often face budget constraints that limit their ability to support all available projects‎. ‎To address this issue‎, ‎organizations seek to select a feasible subset of projects that maximizes utility‎. ‎While several models for project portfolio selection based on multiple criteria have been proposed‎, ‎they are typically NP-hard problems‎. ‎In this study‎, ‎we propose an efficient Variable Neighborhood Search (VNS) algorithm to solve these problems‎. ‎Our algorithm includes a formula for computing the difference value of the objective function‎, ‎which enhances its accuracy and ensures that selected projects meet desired criteria‎. ‎We demonstrate the effectiveness of our algorithm through rigorous testing and comparison with a genetic algorithm (GA) and CPLEX‎. ‎The results of the Wilcoxon non-parametric test confirm that our algorithm outperforms both GA and CPLEX in terms of speed and accuracy‎. ‎Moreover‎, ‎the variance of the relative error of our algorithm is less than that of GA‎.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans