Different approaches to the tuning of the RCPSP algorithm RaR
Tuning the algorithms can be very time consuming and not always successful. In this paper we present two different methods for determining the best values for our algorithm RaR which was developed for the well known RCPSP problem. First method is usual “brute force” method, which uses average deviation as main decision tool. Second method uses more sophisticated statistical methods for more reliable parameter tuning. We compare both methods and present the results of our experiments.