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.

[1]  Rainer Kolisch,et al.  Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem , 1995 .

[2]  Rainer Kolisch,et al.  Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem , 2000, Eur. J. Oper. Res..

[3]  K. Bouleimen,et al.  A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version , 2003, Eur. J. Oper. Res..

[4]  Krzysztof Fleszar,et al.  Solving the resource-constrained project scheduling problem by a variable neighbourhood search , 2004, Eur. J. Oper. Res..

[5]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[6]  Erik Demeulemeester,et al.  A classification scheme for project scheduling , 1999 .

[7]  Toshihide Ibaraki,et al.  Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem , 2002 .

[8]  Christian Artigues,et al.  Insertion techniques for static and dynamic resource-constrained project scheduling , 2003, Eur. J. Oper. Res..

[9]  María Pilar Tormos,et al.  A Competitive Heuristic Solution Technique for Resource-Constrained Project Scheduling , 2001, Ann. Oper. Res..

[10]  Krzysztof Fleszar,et al.  An evolutionary algorithm for resource-constrained project scheduling , 2002, IEEE Trans. Evol. Comput..

[11]  R. Kolisch,et al.  Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis , 1999 .

[12]  Y Cengiz Toklu.  Application of genetic algorithms to construction scheduling with or without resource constraints , 2002 .

[13]  Robert Klein,et al.  Project scheduling with time-varying resource constraints , 2000 .

[14]  Elliott N. Weiss,et al.  Local search techniques for the generalized resource constrained project scheduling problem , 1993 .

[15]  Grzegorz Waligóra,et al.  Simulated Annealing for Multi-Mode Resource-Constrained Project Scheduling , 2001, Ann. Oper. Res..

[16]  Rainer Kolisch,et al.  Experimental investigation of heuristics for resource-constrained project scheduling: An update , 2006, Eur. J. Oper. Res..

[17]  Bert De Reyck,et al.  A hybrid scatter search/electromagnetism meta-heuristic for project scheduling , 2006, Eur. J. Oper. Res..

[18]  Y. Kochetov,et al.  Evolutionary Local Search with Variable Neighborhood for the Resource Constrained Project Scheduling Problem , 2003 .

[19]  Javier Alcaraz Soria.  Algoritmos genéticos para programación de proyectos con recursos limitados , 2001 .

[20]  Mitsuo Gen,et al.  Hybrid genetic algorithm with adaptive abilities for resource-constrained multiple project scheduling , 2005, Comput. Ind..

[21]  Sönke Hartmann,et al.  Project Scheduling under Limited Resources , 1999 .

[22]  Pilar Tormos,et al.  An efficient multi-pass heuristic for project scheduling with constrained resources , 2003 .

[23]  Said Salhi,et al.  An investigation into the relationship of heuristic performance with network-resource characteristics , 1997 .

[24]  Andrzej Jaszkiewicz,et al.  On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment , 2002, IEEE Trans. Evol. Comput..

[25]  Rubén Ruiz,et al.  Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms , 2003, J. Oper. Res. Soc..

[26]  Rainer Kolisch.  Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .

[27]  Xiaodong Li,et al.  Particle swarm optimization-based schemes for resource-constrained project scheduling , 2005 .

[28]  Sönke Hartmann,et al.  A self‐adapting genetic algorithm for project scheduling under resource constraints , 2002 .

[29]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[30]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[31]  Francisco Ballestín,et al.  Justification and RCPSP: A technique that pays , 2005, Eur. J. Oper. Res..

[32]  Jan Węglarz,et al.  Project scheduling : recent models, algorithms, and applications , 1999 .

[33]  Concepción Maroto,et al.  A Robust Genetic Algorithm for Resource Allocation in Project Scheduling , 2001, Ann. Oper. Res..

[34]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[35]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[36]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .

[37]  Linet Özdamar,et al.  A genetic algorithm approach to a general category project scheduling problem , 1999, IEEE Trans. Syst. Man Cybern. Part C.

[38]  Sönke Hartmann,et al.  A competitive genetic algorithm for resource-constrained project scheduling , 1998 .

[39]  Francisco Ballestín,et al.  Resource-constrained project scheduling: A critical activity reordering heuristic , 2003, Eur. J. Oper. Res..