A hybrid genetic algorithm for scheduling and selecting a project portfolio

Abstract

In this study, we consider the problems associated with selecting and scheduling a set of R&D projects to maximize the overall net present value. This paper proposes a zero-one integer programming model in conjunction with a genetic algorithm (GA) to overcome these problems. Taguchi Method was employed in the design of the GA parameters to increase the efficiency of the proposed method. We conclude that the proposed GA is capable of efficiently solving problems associated with the management of portfolios. © 2011 Springer-Verlag Berlin Heidelberg.