Using hybrid simulated annealing algorithm in resource constrained project scheduling problem

Abstract

Mostly the way of solving resource constrained project scheduling problem (RCPSP) will rely on implementing mathematical modeling. However, it often results in the low efficiency of solution searching. Therefore, exploring a more efficient alterative to solve the RCPSP is the main objective of the paper. Simulated Annealing (SA) has been proven an excellent heuristic technique of neighborhood search for solving combinatorial optimization problems in various fields. However, simple SA algorithm cannot guarantee to obtain a better solution quality on solving the combinatorial optimization problem compared with the other heuristic techniques. To enhance the quality and efficiency of solution searching, the paper presents a hybrid SA based algorithm to solve the RCPSP and a program with a good user interface which can link with a well known project management software-Microsoft Project 2000. The outcome of using the algorithm to solve the RCPSP has been shown better than other heuristic techniques after cases experiment.

Keywords:

• Resource constrained
• Simulated annealing
• Optimization