Skip to main content
SpringerLink
Log in

A Bi-population Based Genetic Algorithm for the Resource-Constrained Project Scheduling Problem

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3483))

Included in the following conference series:

Abstract

The resource-constrained project scheduling problem (RCP- SP) is one of the most challenging problems in project scheduling. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions for more challenging problem instances. In this paper, we present a new genetic algorithm (GA) that, in contrast of a conventional GA, makes use of two separate populations. This bi-population genetic algorithm (BPGA) operates on both a population of left-justified schedules and a population of right-justified schedules in order to fully exploit the features of the iterative forward/backward scheduling technique. Comparative computational results reveal that this procedure can be considered as today’s best performing RCPSP heuristic.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alcaraz, J., Maroto, C.: A robust genetic algorithm for resource allocation in project scheduling. Annals of Operations Research 102, 83–109 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baar, T., Brucker, P., Knust, S.: Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem. Meta-heuristics: Advances and trends in local search paradigms for optimization, 1–8 (1998)

    Google Scholar 

  3. Bouleimen, K., Lecocq, H.: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research 149, 268–281 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Coelho, J., Tavares, L.: Comparative analysis of meta-heuricstics for the resource constrained project scheduling problem. Technical report, Department of Civil Engineering, Instituto Superior Tecnico, Portugal (2003)

    Google Scholar 

  5. Debels, D., De Reyck, B., Leus, R., Vanhoucke, M.: A scatter-search meta-heuristic for the resource-constrained project scheduling problem. European Journal of Operational Research (forthcoming)

    Google Scholar 

  6. Hartmann, S.: A competitive genetic algorithm for the resource-constrained project scheduling. Naval Research Logistics 45, 733–750 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hartmann, S.: A self-adapting genetic algorithm for project scheduling under resource constraints. Naval Research Logistics 49, 433–448 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hartmann, S., Kolisch, R.: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Research 127, 394–407 (2000)

    Article  MATH  Google Scholar 

  9. Herroelen, W., Demeulemeester, E., De Reyck, B.: A classification scheme for project scheduling. In: Weglarz, J. (ed.) Project Scheduling - Recent Models, Algorithms and Applications. International Series in Operations Research and Management Science, vol. 14, pp. 77–106. Kluwer Academic Publishers, Boston (1998)

    Google Scholar 

  10. Holland, J.H.: Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  11. Kochetov, Y., Stolyar, A.: Evolutionary local search with variable neighbourhood for the resource constrained project scheduling problem. In: Proceedings of the 3rd International Workshop of Computer Science and Information Technologies (2003)

    Google Scholar 

  12. Kolisch, R., Drexl, A.: Adaptive search for solving hard project scheduling problems. Naval Research Logistics 43, 23–40 (1996)

    Article  MATH  Google Scholar 

  13. Kolisch, R., Hartmann, S.: Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. In: Weglarz, J. (ed.) Project Scheduling - Recent Models, Algorithms and Applications, pp. 147–178. Kluwer Academic Publishers, Boston (1999)

    Google Scholar 

  14. Kolisch, R., Hartmann, S.: Experimental investigation of Heuristics for resourceconstrained project scheduling: an update, working paper, Technical University of Munich (2004)

    Google Scholar 

  15. Kolisch, R., Sprecher, A.: PSPLIB - A project scheduling library. European Journal of Operational Research 96, 205–216 (1996)

    Article  Google Scholar 

  16. Kolisch, R.: Project scheduling under resource constraints - Efficient heuristics for several problem classes. Physica (1995)

    Google Scholar 

  17. Kolisch, R.: Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. European Journal of Operational Research 43, 23–40 (1996)

    MATH  Google Scholar 

  18. Kolisch, R.: Efficient priority rules for the resource-constrained project scheduling problem. Journal of Operations Management 14, 179–192 (1996)

    Article  Google Scholar 

  19. Leon, V.J., Ramamoorthy, B.: Strength and adaptability of problem-space based neighbourhoods for resource-constrained scheduling. OR Spektrum 17, 173–182 (1995)

    Article  MATH  Google Scholar 

  20. Li, K.Y., Willis, R.J.: An iterative scheduling technique for resource-constrained project scheduling. European Journal of Operational Research 56, 370–379 (1992)

    Article  MATH  Google Scholar 

  21. Merkle, D., Middendorf, M., Schmeck, H.: Ant colony optimization for resource constrained project scheduling. IEEE Transaction on Evolutionary Computation 6(4), 333–346 (2002)

    Article  Google Scholar 

  22. Nonobe, K., Ibaraki, T.: Formulation and tabu search algorithm for the resource constrained project scheduling problem (RCPSP). In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Meta-heuristics, pp. 557–588. Kluwer Academic Publishers, Boston (2002)

    Google Scholar 

  23. Schirmer, A.: Case-based reasoning and improved adaptive search for project scheduling. Naval Research Logistics 47, 201–222 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  24. Tormos, P., Lova, A.: A competitive heuristic solution technique for resourceconstrained project scheduling. Annals of Operations Research 102, 65–81 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  25. Tormos, P., Lova, A.: An efficient multi-pass heuristic for project scheduling with constrained resources. International Journal of Production Research 41, 1071–1086 (2003)

    Article  MATH  Google Scholar 

  26. Tormos, P., Lova, A.: Integrating heuristics for resource constrained project scheduling: One step forward, Technical report, Department of Statistics and Operations Research, Universidad Politecnica de Valencia (2003)

    Google Scholar 

  27. Valls, V., Ballestin, F., Quintanilla, S.: A hybrid genetic algorithm for the Resourceconstrained project scheduling problem with the peak crossover operator. In: Eighth International Workshop on Project Management and Scheduling, pp. 368–371 (2002)

    Google Scholar 

  28. Valls, V., Quintanilla, S., Ballestin, F.: Resource-constrained project scheduling: a critical activity reordering heuristic. European Journal of Operational Research 149, 282–301 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  29. Valls, V., Ballestin, F., Quintanilla, S.: A population-based approach to the resource-constrained project scheduling problem. Annals of Operations Research 131, 305–324 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  30. Valls, V., Ballestin, F., Quintanilla, S.: Justification and RCPSP: A technique that pays. European Journal of Operational Research (Forthcoming)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Economics and Business Administration, Ghent University, Hoveniersberg 24, 9000, Ghent, Belgium

    Dieter Debels & Mario Vanhoucke

  2. Vlerick Leuven Gent Management School, Operations & Technology Management, Centre, Reep 1, 9000, Ghent, Belgium

    Mario Vanhoucke

Authors
  1. Dieter Debels
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mario Vanhoucke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Debels, D., Vanhoucke, M. (2005). A Bi-population Based Genetic Algorithm for the Resource-Constrained Project Scheduling Problem. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_41

Download citation

  • DOI: https://doi.org/10.1007/11424925_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25863-6

  • Online ISBN: 978-3-540-32309-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation