Hybrid Genetic Algorithm with Simulated Annealing for Resource-Constrained Project Scheduling

BETTEMİR Ö. H., SÖNMEZ R.

JOURNAL OF MANAGEMENT IN ENGINEERING, cilt.31, sa.5, 2015 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 31 Sayı: 5
  • Basım Tarihi: 2015
  • Doi Numarası: 10.1061/(asce)me.1943-5479.0000323
  • Dergi Adı: JOURNAL OF MANAGEMENT IN ENGINEERING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Anahtar Kelimeler: Resource-constrained project scheduling, Genetic algorithms, Simulated annealing, Hybrid algorithms, Project management software, PARTICLE SWARM OPTIMIZATION, ANT COLONY OPTIMIZATION, JUSTIFICATION, CONSTRUCTION, CONVERGENCE, MANAGEMENT, ALLOCATION, HEURISTICS
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

Resource-constrained project scheduling problem (RCPSP) is a very important optimization problem in construction project management. Despite the importance of the RCPSP in project scheduling and management, commercial project management software provides very limited capabilities for the RCPSP. In this paper, a hybrid strategy based on genetic algorithms, and simulated annealing is presented for the RCPSP. The strategy aims to integrate parallel search ability of genetic algorithms with fine tuning capabilities of the simulated annealing technique to achieve an efficient algorithm for the RCPSP. The proposed strategy was tested using benchmark test problems and best solutions of the state-of-the-art algorithms. A sole genetic algorithm, and seven heuristics of project management software were also included in the computational experiments. Computational results show that the proposed hybrid strategy improves convergence of sole genetic algorithm and provides a competitive alternative for the RCPSP. The computational experiments also reveal the limitations of the project management software for resource-constrained project scheduling. (C) 2014 American Society of Civil Engineers.