Temporally adaptive co-operation schemes

Abstract

Selecting an appropriate co-operation scheme in parallel evolutionary algorithms is an important task and it should be undertaken with care. In this paper, we introduce the temporally adaptive schemes, and apply them in our parallel memetic algorithm for solving the vehicle routing problem with time windows. The experimental results revealed that this approach allows for retrieving better solutions in much shorter time compared with other cooperation schemes. The analysis is backed up with the statistical tests, which gave the clear evidence that the results are important. We report one new world’s best solution to the benchmark problem obtained using our adaptive co-operation scheme.