Cloud-distributed computational experiments for combinatorial optimization

摘要

The development of optimization algorithms for combinatorial problems is a complicated process, both guided and validated by the computational experiments over the different scenarios. Since the number of experiments can be very large and each experiment can take substantial execution time, distributing the load over the cloud speeds up the whole process significantly. In this paper we present the system used for experimental validation and comparison of stochastic combinatorial optimization algorithms, applied in the specific case of project scheduling problems.