2009

chapter in monograph / paper

english

EN Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated. Acceleration of a memetic algorithm requires focusing on local search, the most time-consuming component. This paper describes the application of two acceleration techniques to local search in a memetic algorithm: caching of values of objective function for neighbours and forbidding moves which could increase distance between solutions. Computational experiments indicate that in the capacitated vehicle routing problem the usage of these techniques is not really profitable, because of cache management overhead and implementation issues.

96 - 107

10.1007/978-3-540-71615-0_9

https://link.springer.com/chapter/10.1007/978-3-540-71615-0_9

Evolutionary Computation in Combinatorial Optimization. 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007. Proceedings

7th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2007, 11-13.04.2007, Valencia, Spain