American Journal of Industrial and Business Management

Volume 5, Issue 6 (June 2015)

ISSN Print: 2164-5167   ISSN Online: 2164-5175

Google-based Impact Factor: 0.92  Citations  

A Novel Evolutionary Algorithm with Neighborhood Search for Project Portfolios Optimization Problem

HTML  XML Download Download as PDF (Size: 494KB)  PP. 396-403  
DOI: 10.4236/ajibm.2015.56040    3,044 Downloads   3,868 Views  
Author(s)

ABSTRACT

This paper proposes a quantum-inspired evolutionary algorithm with neighborhood search (called QEANS) to solve the project portfolios optimization problem with limited multiple resources and bounded risks for each project portfolio. The decision concerns how to find an optimal or best assignment of projects to a set of project portfolios that maximizes the total profit. The studied problem is formulated by a 0-1 linear programming model, and a quantum-inspired evolutionary algorithm with neighborhood search is proposed to solve it. In specific, each problem solution is encoded by a Q-bits matrix, which is updated by quantum-rotation gate. In addition, crossover and mutation operators are integrated so as to increase the population diversity. Furthermore, an effective repairing procedure is proposed for dealing with the generated infeasible solutions. To prevent the local optimum, a specific neighborhood search procedure is also proposed. Randomly generated instances are used to test and justify the effectiveness of the proposed QEANS. The obtained results indicate that the proposed QEANS is effective.

Share and Cite:

Lei, W. and Li, S. (2015) A Novel Evolutionary Algorithm with Neighborhood Search for Project Portfolios Optimization Problem. American Journal of Industrial and Business Management, 5, 396-403. doi: 10.4236/ajibm.2015.56040.

Cited by

No relevant information.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.