Use of Genetic Algorithms in Multi-Objective Multi-Project Resource Constrained Project Scheduling
Industrial Engineering, M.Sc. Thesis, 2014
Prof. Dr. Gündüz Ahmet Ulusoy (Thesis Supervisor), Assoc. Prof. Bülent Çatay, Asst. Prof. Demet Özgür Ünlüakın
Date &Time: January,07th, 2014 – 14:00
Keywords: RCPSP, Genetic Algorithms, Multi-objective RCPSP; Multi-project RCPSP, backward-forward scheduling.
Resource Constrained Project Scheduling Problem (RCPSP) has been studied extensively by researchers by considering limited renewable and non-renewable resources. Several exact and heuristic methods have been proposed. Some important extensions of RCPSP such as multi-mode RCPSP, multi-objective RCPSP and multi-project RCPSP have also been focused. In this study, we consider multi-project and multi-objective resource constrained project scheduling problem. As a solution method, non-dominated sorting genetic algorithm is adopted. By experimenting with different crossover and parent selection mechanisms, a detailed fine-tuning process is conducted, in which response surface optimization method is employed. In order to improve the solution quality, backward-forward pass procedure is proposed as both post-processing as well as for new population generation. Additionally, different divergence applications are proposed and one of them, which is based on entropy measure is studied in depth. The performance of the algorithm and CPU times are reported. In addition, a new method for generating multi-project test instances is proposed and the performance of the algorithm is evaluated through test instances generated through this method of data generation. The results show that backward-forward pass procedure is successful to improve the solution quality.