A Hybrid Genetic Algorithm Based on Intelligent Encoding for Project Scheduling
In the last few years several heuristic, metaheuristic and hybrid techniques have been developed to solve the Resource-Constrained Project Scheduling Problem (RCPSP). Most of them use the standard activity list representation, given that it seems to perform best in solving the RCPSP independently of the paradigm employed (genetic algorithms, tabu search, simulated annealing, ...). However, we have designed an innovative representation, one which has not been used before and which includes a lot of problem-specific knowledge. Based on that representation we have developed a new competitive and robust hybrid genetic algorithm, which uses genetic operators and an improvement mechanism specially designed to work on that representation and exploit, in a very efficient way, the information contained in it. We have compared this algorithm with the best algorithms published so far, using the standard benchmark of PSPLIB. The results show the excellent performance of our algorithm.
KeywordsProject Scheduling Genetic Algorithms Hybrid Algorithms Metaheuristic Techniques
Unable to display preview. Download preview PDF.
- Alcaraz, J. (2001). Algoritmos Genéticos para Programación de Proyectos con Recursos Limitados, Bell and Howell, Valencia.Google Scholar
- Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning, Addison Wesley.Google Scholar
- Hartmann, S. (1999). Project Scheduling under Limited Resources, Springer.Google Scholar
- Herroelen, W., Demeulemeester, E. and De Reyck, B. (1998). A classification scheme for project scheduling, in: Project Scheduling: Recent Models, Algorithms and Applications, J. Weglarz, ed., Kluwer Academic Publishers, Berlin, pp. 1–26.Google Scholar
- Kelley, J.E. (1963). The critical-path method: Resources planning and scheduling, in: Industrial Scheduling, Muth, J.F. and Thompson, G.L., eds., Prentice-Hall, New Jersey, pp. 347–365.Google Scholar
- Kochetov, Y. and Stoylar, A. (2003). Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem, in: Proceedings of the 3rd International Workshop of Computer Science and Information Technologies, Russia.Google Scholar
- Kolisch, R. and Hartmann, S. (1999). Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis, in: Project Scheduling: Recent Models, Algorithms and Applications, J. Weglarz, ed., Kluwer Academic Publishers, Berlin, pp. 147–178.Google Scholar
- Kolisch, R. and Hartmann, S. (To appear), Experimental investigation of heuristics for resource-constrained project scheduling: an update, European Journal of Operational Research.Google Scholar
- Nonobe, K. and Ibaraki, T. (2002). Formulation and tabu search algorithm for the resource constrained project scheduling problem, in: Essays and Surveys in Metaheuristics, C.C. Ribeiro and P. Hansen, eds, Kluwer Academic Publishers, pp. 557–588.Google Scholar
- Sampson, S.E. and Weiss, E.N. (1993). Local search techniques for the generalized resource constrained project scheduling problem, Naval Research Logistics 40:665–675.Google Scholar