An estimation of distribution algorithm for resource-constrained project scheduling problem

An estimation of distribution algorithm (EDA) is proposed to solve resource-constrained project scheduling problem (RCPSP). In the EDA, individual is encoded based on the extended active list, and a probability model of the distribution for each activity in a project and its updating mechanism are proposed. The algorithm determines the initial probability matrix according to an initial set of solutions generated by the regret-based sampling method and priority rule, and decodes the individuals by using serial schedule generation scheme. Meanwhile, a permutation based local search method is incorporated into the algorithm to enhance the exploitation ability so as to further improve the searching quality. Simulation results based on benchmarks and comparisons with some existing algorithms demonstrate the feasibility and effectiveness of our proposed EDA.

[1]  Robert J Willis,et al.  An iterative scheduling technique for resource-constrained project scheduling , 1992 .

[2]  Yeong-Dae Kim,et al.  A simulated annealing algorithm for resource constrained project scheduling problems , 1997 .

[3]  R. Kolisch,et al.  Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis , 1998 .

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

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

[6]  Bassem Jarboui,et al.  A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems , 2008, Appl. Math. Comput..

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

[8]  Pedro Larrañaga,et al.  Towards a New Evolutionary Computation - Advances in the Estimation of Distribution Algorithms , 2006, Towards a New Evolutionary Computation.

[9]  Markus H ohfeld,et al.  Random keys genetic algorithm with adaptive penalty function for optimization of constrained facility layout problems , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[10]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes , 1995 .

[11]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[12]  Qingfu Zhang,et al.  On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm , 2004, IEEE Transactions on Evolutionary Computation.

[13]  Francisco Ballestín,et al.  A Population-Based Approach to the Resource-Constrained Project Scheduling Problem , 2004, Ann. Oper. Res..

[14]  Edward W. Davis,et al.  A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling , 1975 .

[15]  Charles C. Palmer,et al.  Representing trees in genetic algorithms , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

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

[17]  Rainer Kolisch,et al.  Adaptive search for solving hard project scheduling problems , 1996 .

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

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

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

[21]  Bassem Jarboui,et al.  An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems , 2009, Comput. Oper. Res..

[22]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints , 1995 .

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

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

[25]  Mario Vanhoucke,et al.  A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem , 2007, Oper. Res..

[26]  Grzegorz Waligóra,et al.  Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times , 2008, Eur. J. Oper. Res..

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

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

[29]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[30]  V. Jorge Leon,et al.  Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling , 1995 .

[31]  Fayez F. Boctor,et al.  A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes , 1996 .

[32]  Uwe Aickelin,et al.  An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering , 2007, J. Oper. Res. Soc..

[33]  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..

[34]  Andreas Schirmer,et al.  Case‐based reasoning and improved adaptive search for project scheduling , 2000 .