Skip to main content

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 56))

Abstract

In this paper, an improved particle swarm optimization (IPSO) algorithm is presented to solve RCP Scheduling Problem. Firstly, a mapping is created between the feasible schedule and the position of the particle, then the IPSO begin to search the global best and the local best until the stop criteria is satisfied. A case study is presented and a comparison is made between IPSO and some traditional heuristic methods. Results show that the IPSO algorithm is more satisfying than those of the heuristic methods in terms of feasibility and efficiency.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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. Davis, E.W.: Project Scheduling under Resource Constraints—a Historical Review and Categorization of Procedures. AIIE Transactions 5, 297–313 (1973)

    Google Scholar 

  2. Erik, L., Demeulemeester, Willy, S.H.: Project Scheduling: A Research Handbook, pp. 10–15. Kluwer Academic Publishers, Dordrecht (2002)

    MATH  Google Scholar 

  3. Herroelen, W., Reyck, B.D., Demeulemeester, E.: Resource-constrained Project Scheduling: A Survey of Recent Developments. Computers & Ops. Res. 25, 279–302 (1998)

    Article  MATH  Google Scholar 

  4. Patterson, J.H., Huber: A Horizon-varying Zero-one Approach to Project Scheduling. Management Science 20, 990–998 (1974)

    Article  MATH  Google Scholar 

  5. Bell, C.E., Park, K.: Solving Resource Constrained Project Scheduling Problems by A*-search. Naval Research Logistics 37, 61–84 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kolisch, R., Kolisch, A.: Adaptive Search for Solving Hard Project Scheduling Problem of Operational Research. Naval Research Logistics 43, 23–40 (1996)

    Article  MATH  Google Scholar 

  7. Bouleimen, K., Lecocq, H.: A New Efficient Simulated Annealing Algorithm for Resource Constrained Scheduling Problem. Technical Report, Service de Robotique et Automatisation, University de Liege, pp. 1–10 (1998)

    Google Scholar 

  8. Hartmann, S.: A Competitive Genetic Algorithm for Resource Constrained Project Scheduling. Naval Research Logistics 45, 733–750 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Lawrence, S.R.: Resource-constrained Project Scheduling-A Computational Comparison of Heuristic Scheduling Techniques. Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, pp. 10–18 (1985)

    Google Scholar 

  10. Alvarez-Valdes, R., Tamarit, J.M.: Advances in Project Scheduling, pp. 113–134. Elsevier, Amsterdam (1989)

    Google Scholar 

  11. Lee, J.K., Kim, Y.D.: Search Heuristics for Resource Constrained Project Scheduling. Journal of Operat. Res. Soc. 47, 678–689 (1996)

    MATH  Google Scholar 

  12. Zhang, L.Y., Zhang, J.P., Wang, L.: Genetic Algorithms Based on MATLAB of Construction Project Resource Leveling. Journal of Industrial Engineering/Engineering Management 18, 52–55 (2004) (Chinese)

    Google Scholar 

  13. Leu, S.S., Yang, C.H., Huang, J.C.: Resource Leveling in Construction by Genetic Algorithm-based Optimization and in Decision Support System Applicaiton. Automation in Construction 10, 27–41 (2000)

    Article  Google Scholar 

  14. Tarek, H.: Optimization of Resource Allocation and Leveling Using Genetic Algorithms. Journal of Construction Engineering and Management 6, 167–175 (1999)

    Google Scholar 

  15. Kennedy, R., Eberhart, C.: Particle Swarm Optimization. In: Proceedings of International Conference on Neural Networks, pp. 1942–1948 (1995)

    Google Scholar 

  16. Wang, J.W., Wang, D.W.: Experiments and Analysis on Inertia Weight In Particle Swarm Optimization. Journal of Systems Engineering 20, 194–198 (2005) (Chinese)

    MATH  Google Scholar 

  17. Clerc, M., Kennedy, J.: The Particle Swarm. Explosion, Stability, and Convergence in a Multi- dimensional Complex Space. IEEE Trans. on Evolutionary Computation 6, 58–73 (2002)

    Article  Google Scholar 

  18. Trelea, I.: The Particle Swarm Optimization Algorithm. Convergence Analysis and Parameter Selection. Information Processing Letters 85, 317–325 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  19. Edwards, A., Engelbrecht, A.P.: Comparing Particle Swarm Optimisation and Genetic Algorithms for Nonlinear Mapping. In: 2006 IEEE Congress on Evolutionary Computation, pp. 694–701 (2006)

    Google Scholar 

  20. Naka, S., Genji, T., Yura, T., et al.: A Hybrid Particle Swarm Optimization for Distribution State Estimation. IEE Trans. on Power System 18, 60–68 (2003)

    Article  Google Scholar 

  21. Zhang, H., Li, H., Tam, C.M.: Particle Swarm Optimization for Resource-constrained Project Scheduling. International Journal of Project Management 14, 83–92 (2006)

    Article  Google Scholar 

  22. Zhao, B., Cao, Y.J.: An Improved Particle Swarm Optimization Algorithm For Power System Unit Commitment. Power System Technology 28, 6–10 (2004)

    Google Scholar 

  23. Eberhart, R.C., Shi, Y.: Comparing Inertia Weights and Constriction Factors in Particle Swarm Optimization. In: Proceedings of the Congress on Evolutionary Computing, pp. 84–88. IEE Service Center, California (2000)

    Google Scholar 

  24. Klein, R.: Scheduling of Resource-Constrained Projects. Kluwer Academic Publisher, Boston (2000)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Wang, Q., Qi, J. (2009). Improved Particle Swarm Optimization for RCP Scheduling Problem. In: Wang, H., Shen, Y., Huang, T., Zeng, Z. (eds) The Sixth International Symposium on Neural Networks (ISNN 2009). Advances in Intelligent and Soft Computing, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01216-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01216-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01215-0

  • Online ISBN: 978-3-642-01216-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics