Accelerating local search in a memetic algorithm for the capacitated vehicle routing problem

Authors:
Marek Kubiak;Przemysław Wesołek
Affiliations:
Institute of Computing Science, Poznan University of Technology, Poznan, Poland;Institute of Computing Science, Poznan University of Technology, Poznan, Poland
Venue:
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Year:
2007

Citing 5
Cited 1

Experiments on traveling salesman heuristics

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
The vehicle routing problem

The vehicle routing problem
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
Advanced fitness landscape analysis and the performance of memetic algorithms

Evolutionary Computation - Special issue on magnetic algorithms
Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling

IEEE Transactions on Evolutionary Computation

Efficient local search limitation strategies for vehicle routing problems

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.