Differential evolution algorithm for multi-project resource leveling problem

Abstract

In this paper, the model of RLP which in the multi-project environment is expanded to the RLPMP using the minimum of the variance of total resource consumption within unit time for all projects as the optimization objective. In order to ensure the optimal individual will not be destroyed by operations such as crossover or variation and still maintain convergence of differential evolution algorithm, we try to introduce the elitist reservation to the differential evolution algorithm. Case analysis showed that the improved differential evolution algorithm can solve the model of RLPMP and then improve the balance of multi-project resources effectively.

Keywords:

• Differential evolution algorithm
• Elitist reservation
• Multi-project resource leveling problem

Mathematics Subject Classification 2010:

• 65M99