Article ID: | iaor2005903 |
Country: | Netherlands |
Volume: | 131 |
Issue: | 1 |
Start Page Number: | 305 |
End Page Number: | 324 |
Publication Date: | Oct 2004 |
Journal: | Annals of Operations Research |
Authors: | Valls Vicente, Quintanilla Sacramento, Ballestn Francisco |
Keywords: | heuristics |
We present a population-based approach to the RCPSP. The procedure has two phases. The first phase handles the initial construction of a population of schedules and these are then evolved until high quality solutions are obtained. The evolution of the population is driven by the alternative application of an efficient improving procedure for locally improving the use of resources, and a mechanism for combining schedules that blends scatter search and path relinking characteristics. The objective of the second phase is to explore in depth those vicinities near the high quality schedules. Computational experiments on the standard j120 set, generated using ProGen, show that our algorithm produces higher quality solutions than state-of-the-art heuristics for the RCPSP in an average time of less than five seconds.