Testing Population Designs (original) (raw)

Abstract

ABSTRACT this paper is to theoretically work out relevant pool strategies in the context of SCS and to evaluate them by means of computational comparisons. In Section 2 we examine the main components, the designs which may generally be used to control pool transfers and explain the concept of relatedness for the comparison of solutions. Section 3 deals with the application of population strategies and formulates ways and means of how they may be addressed to improve an existing SCS which uses a TS as a subroutine. Di#erent input-output strategies and solution combination methods (SCMs) have been additionally implemented and tested. Of primary interest are the capacitated CPP (CCPP) but also pure permutation problems to gain some insight in the generalizability of the arc routing results. Preliminary results, sketched in Section 4, indicate that, even if simple algorithmic modifications are used, the tuning of a pool process can have a very positive e#ect on the overall solution quality of a metaheuristic. This tendency becomes even clearer if more sophisticated mechanisms are introduced

Peter Greistorfer hasn't uploaded this paper.

Let Peter know you want this paper to be uploaded.

Ask for this paper to be uploaded.