Loading...

A hybrid scatter search for the RCPSP

Ranjbar, M ; Sharif University of Technology | 2009

591 Viewed
  1. Type of Document: Article
  2. Publisher: 2009
  3. Abstract:
  4. In this paper, a new hybrid metaheuristic algorithm based on the scatter search approach is developed to solve the well-known resource-constrained project scheduling problem. This algorithm combines two solutions from scatter search to build a set of precedence feasible activity lists and select some of them as children for the new population. We use the idea presented in the iN forward/backward improvement technique to define two types of schedule, direct and reverse, and the members of the sequential populations change alternately between these two types of schedule. Extensive computational tests were performed on standard benchmark datasets and the results are compared with the best available results. Comparative computational tests indicate that our procedure is a very effective metaheuristic algorithm. © Sharif University of Technology, June 2009
  5. Keywords:
  6. Activity list ; Benchmark datasets ; Computational tests ; Improvement technique ; Meta heuristic algorithm ; Metaheuristic ; Project scheduling ; Resource-constrained project scheduling problem ; Scatter search ; Algorithms ; Heuristic methods ; Algorithm ; Data set ; Experimental study ; Numerical model
  7. Source: Scientia Iranica ; Volume 16, Issue 1 E , 2009 , Pages 11-18 ; 10263098 (ISSN)
  8. URL: http://scientiairanica.sharif.edu/article_3193.html