Research on Multi-project Scheduling Problem Based on Hybrid Genetic Algorithm

摘要

A simulated annealing genetic algorithm was put forward to solve the resource-constrained multi-project scheduling problem. The ordinary genetic algorithm and simulated annealing algorithm used in this method were improved separately firstly. Then the simulated annealing operations which can overcome the defects of genetic algorithm easy to fall into the local optimal solution were used in the genetic algorithm. The method also inherited the rapid convergence characteristic of genetic algorithm. It was proved by a practical example that this hybrid algorithm improved the deficiencies of genetic algorithm and simulated annealing and can effectively shorten the implementation time of projects. Compared with other heuristic and intelligent methods, this algorithm performs better than them.