Skip to main content
SpringerLink
Log in

Fitness Landscape Analysis for the Resource Constrained Project Scheduling Problem

  • Conference paper
Learning and Intelligent Optimization (LION 2009)

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

Included in the following conference series:

Abstract

The fitness landscape of the resource constrained project scheduling problem is investigated by examining the search space position type distribution and the correlation between the quality of a solution and its distance to an optimal solution. The suitability of the landscape for search with evolutionary computation and local search methods is discussed.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Brucker, P., Drexl, A., Möhring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research 112, 3–41 (1999)

    Article  MATH  Google Scholar 

  2. Błażewicz, J., Lenstra, J.K., Rinnooy Kan, A.H.G.: Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics 5, 11–24 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  3. Kolisch, R., Hartmann, S.: Experimental investigation of heuristics for resource-constrained project scheduling: An update. European Journal of Operational Research 174, 23–37 (2006)

    Article  MATH  Google Scholar 

  4. Ruiz, R., Maroto, C., Alcaraz, J.: Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34, 461–476 (2006)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Valls, V., Ballestín, F., Quintanilla, S.: Justification and RCPSP: A technique that pays. European Journal of Operational Research 165, 375–386 (2005)

    Article  MATH  Google Scholar 

  7. Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation 4, 337–352 (2000)

    Article  Google Scholar 

  8. Valls, V., Ballestín, F.: A population-based approach to the resource-constrained project scheduling problem. Annals of Operations Research 131, 305–324 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kolisch, R.: Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research 90, 320–333 (1996)

    Article  MATH  Google Scholar 

  10. 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 

  11. Reeves, C.R.: Landscapes, operators and heuristic search. Annals of Operations Research 86, 473–490 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  12. Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, Albuquerque, New Mexico (1995)

    Google Scholar 

  13. Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Elsevier, Amsterdam (2005)

    MATH  Google Scholar 

  14. Bierwirth, C., Mattfeld, D.C., Watson, J.P.: Landscape regularity amd random walks for the job-shop scheduling problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol. 3004, pp. 21–30. Springer, Heidelberg (2004)

    Google Scholar 

  15. Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the 6th International Conference on Genetic Algorithms, pp. 184–192 (1995)

    Google Scholar 

  16. Boese, K.D., Kahng, A.B., Muddu, S.: A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters 16, 101–113 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  17. Czogalla, J., Fink, A.: Fitness landscape analysis for the continuous flow-shop scheduling problem. In: Proceedings of the 3rd European Graduate Student Workshop on Evolutionary Computation, EvoPhD 2008, Naples, pp. 1–14 (2008)

    Google Scholar 

  18. Kubiak, M.: Distance measures and fitness-distance analysis for the capacitated vehicle routing problem. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W.J., Hartl, R.F., Reimann, M. (eds.) Metaheuristics: Progress in Complex Systems Optimization. Operations Research/Computer Science Interfaces Series, vol. 39, pp. 345–364. Springer, New York (2007)

    Google Scholar 

  19. Grahl, J., Radtke, A., Minner, S.: Fitness landscape analysis of dynamic multi-product lot-sizing problems with limited storage. In: Günther, H.O., Mattfeld, D.C., Suhl, L. (eds.) Managment logistischer Netzwerke. Entscheidungsunterstützung, Informationssysteme und OR-Tools, pp. 257–277. Physica-Verlag, Heidelberg (2007)

    Google Scholar 

  20. Martí, R., Laguna, M., Campos, V.: Scatter search vs. genetic algorithms. An experimental evaluation with permutation problems. In: Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization Via Memory and Evolution. Tabu Search and Scatter Search. Operations Research/Computer Science Interfaces Series, pp. 263–282. Kluwer Academic Publishers, Boston (2005)

    Chapter  Google Scholar 

  21. Schiavinotto, T., Stützle, T.: A review of metrics on permutations for search landscape analysis. Computers & Operations Research 34, 3143–3153 (2007)

    Article  MATH  Google Scholar 

  22. Ronald, S.: More distance functions for order-based encodings. In: Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, pp. 558–563 (1998)

    Google Scholar 

  23. Czogalla, J., Fink, A.: Design and analysis of evolutionary algorithms for the no-wait flow-shop scheduling problem. In: Geiger, M.J., Habenicht, W., Sevaux, M., Sörensen, K. (eds.) Metaheuristics in the Service Industry. Lecture Notes in Economics and Mathematical Systems. Springer, Berlin (to appear)

    Google Scholar 

  24. Kolisch, R., Sprecher, A., Drexl, A.: Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science 41, 1693–1703 (1995)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  26. Sprecher, A., Kolisch, R., Drexl, A.: Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. European Journal of Operational Research 80, 94–102 (1995)

    Article  MATH  Google Scholar 

  27. Czogalla, J., Fink, A.: Particle swarm optimization for resource constrained project scheduling. Working Paper (2008)

    Google Scholar 

  28. Czogalla, J., Fink, A.: Particle swarm topologies for the resource constrained project scheduling problem. Accepted for publication in NICSO 2008 proceedings. Studies in Computational Intelligence. Springer, Heidelberg (2008) (to appear)

    Google Scholar 

  29. Edgington, E.S.: Randomization Tests, 2nd edn. STATISTICS: Textbooks and Monographs, vol. 77. Marcel Dekker, New York (1987)

    MATH  Google Scholar 

  30. Kruskal, W.H., Wallis, W.A.: Use of ranks on one-criterion variance analysis. Journal of the American Statistical Association 47, 583–621 (1952)

    Article  MATH  Google Scholar 

  31. Boctor, F.F.: Resource-constrained project scheduling by simulated annealing. International Journal of Production Research 34, 2335–2351 (1996)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Helmut-Schmidt-University, Hamburg, Germany

    Jens Czogalla & Andreas Fink

Authors
  1. Jens Czogalla
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Fink
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRIDIA, CoDE, Université Libre de Bruxelles, Avenue F. Roosevelt 50, CP 194/6, 1050, Brussels, Belgium

    Thomas Stützle

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czogalla, J., Fink, A. (2009). Fitness Landscape Analysis for the Resource Constrained Project Scheduling Problem. In: Stützle, T. (eds) Learning and Intelligent Optimization. LION 2009. Lecture Notes in Computer Science, vol 5851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11169-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11169-3_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11168-6

  • Online ISBN: 978-3-642-11169-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation