Skip to main content
SpringerLink
Log in

A Dynamic Clonal Selection Algorithm for Project Optimization Scheduling

  • Conference paper
Simulated Evolution and Learning (SEAL 2006)

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

Included in the following conference series:

Abstract

A Dynamic Clonal Selection Algorithm for the Resource-Constrained Project Scheduling Problem (RCPSP-DCSA) is proposed in this paper. Based on the mechanism of nature immune system and characteristic of project scheduling, the encoding of solution, some operators (including crossover, mutation, deriving and death) and the function of affinity are given. Through a thorough computational study for a standard set of project instances in PSPLIB, the impact of the parameters on the performance of algorithm are analyzed. Experimental results show RCPSP-DCSA has a good performance and it can reach near-optimal solutions in reasonable time.

Supported by the National Natural Science Foundation of China under Grant Nos. 60372045 and the National Grand Fundamental Research 973 Program of China under Grant No. 2001CB309403.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Kis, T.: A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. Mathematical Programming 103, 515–539 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Thomas, P.R., Salhi, S.: A Tabu Search Approach for the Resource Constrained Project Scheduling Problem. Journal of Heuristics (4), 123–139 (2001)

    Article  Google Scholar 

  3. Bautista, J., Pereira, J.: Ant colonies for the RCPSP Problem. In: Topics in Artificial Intelligence: 5th Catalonian Conference on AI, CCIA 2002, Castell’on, Spain, October 24-25, 2002, pp. 257–268 (2002)

    Google Scholar 

  4. Hindi, K.S., Yang, H., Fleszar, K.: An Evolutionary Algorithm for Resource-Constrained Project Scheduling. IEEE Transactions on Evolutionary Computation (6), 512–518 (2002)

    Article  Google Scholar 

  5. Debels, D., Vanhoucke, M.: A Bi-population Based Genetic Algorithm for the Resource-Constrained Project Scheduling Problem. In: Computational Science and Its Applications-ICCSA 2005: International Conference. Proceedings, Part IV, Singapore, May 9-12, 2005, pp. 378–387 (2005)

    Google Scholar 

  6. Wang, H., Lin, D.: A Genetic Algorithm for Solving Resource-Constrained Project Scheduling Problem. In: Wang, L., Chen, K., S. Ong, Y. (eds.) ICNC 2005. LNCS, vol. 3610, pp. 185–193. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Valls, V., Ballestn, 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 

  8. Kolisch, R., Hartmann, S.: Experimental Investigation of Heuristics for Resource-Constrained Project Scheduling: An Update. European Journal of Operational Research (to appear, 2005)

    Google Scholar 

  9. http://129.187.106.231/psplib/

Download references

Author information

Authors and Affiliations

  1. Institute of Intelligent Information Processing, Xidian University, Xi’an, 710071, China

    Xiaoying Pan, Fang Liu & Licheng Jiao

Authors
  1. Xiaoying Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Licheng Jiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Industrial Engineering and Management, Cheng Shiu University, Kaohsiung County Taiwan, ROC

    Tzai-Der Wang

  2. School of Computer Science and information Technology, RMIT University, VIC 3001, Melbourne, Australia

    Xiaodong Li

  3. AI-ECON Research Center, Department of Economics, National Chengchi University, 11623, Taipei, Taiwan

    Shu-Heng Chen

  4. Department of Computer Science and Technology, University of Sci. & Tech. of China, 230026, Hefei, Anhui, P.R. China

    Xufa Wang

  5. School of Information Technology and Electrical Engineering, University of New South Wales, Australian Defence Force Academy, Canberra, Australia

    Hussein Abbass

  6. The Univertity of Tokyo, Japan

    Hitoshi Iba

  7. Department of Computer, University of Science and Technology of China, 230027, Hefei, China

    Guo-Liang Chen

  8. University of Birmingham, Birmingham, UK

    Xin Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pan, X., Liu, F., Jiao, L. (2006). A Dynamic Clonal Selection Algorithm for Project Optimization Scheduling. In: Wang, TD., et al. Simulated Evolution and Learning. SEAL 2006. Lecture Notes in Computer Science, vol 4247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11903697_103

Download citation

  • DOI: https://doi.org/10.1007/11903697_103

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47331-2

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation