Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem

  • Marek Kubiak
  • Przemysław Wesołek
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4446)


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.


Local Search Capacity Constraint Memetic Algorithm Vehicle Route Problem Common Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Merz, P.: Advanced fitness landscape analysis and the performance of memetic algorithms. Evolutionary Computation 12(3), 303–325 (2004)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Jaszkiewicz, A.: Genetic local search for multiple-objective combinatorial optimization. European Journal of Operational Research 137(1), 50–71 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Ishibuchi, H., Yoshida, T., Murata, T.: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation 7(2), 204–223 (2003)CrossRefGoogle Scholar
  4. 4.
    Bentley, J.L.: Experiments on traveling salesman heuristics. In: Proceedings of the first annual ACM-SIAM symposium on discrete algorithms, pp. 91–99 (1990)Google Scholar
  5. 5.
    Jaszkiewicz, A., Kominek, P.: Genetic local search with distance preserving recombination operator for a vehicle routing problem. European Journal of Operational Research 151(2), 352–364 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Reeves, C.R.: Landscapes, operators and heuristic search. Annals of Operations Research 86(1), 473–490 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Kubiak, M.: Systematic construction of recombination operators for the vehicle routing problem. Foundations of Computing and Decision Sciences 29(3), 205–226 (2004)Google Scholar
  8. 8.
    Merz, P., Freisleben, B.: A genetic local search approach to the quadratic assign- ment problem. In: Bäck, T. (ed) Proceedings of the Seventh International Conference on Genetic Algorithms (1997)Google Scholar
  9. 9.
    Jaszkiewicz, A.: Improving performance of genetic local search by changing local search space topology. Foundations of Computing and Decision Sciences 24(2), 77–84 (1999)Google Scholar
  10. 10.
    Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM, Philadelphia (2002)Google Scholar
  11. 11.
    Hoos, H.H., Stutzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kauffman, Washington (2004)Google Scholar
  12. 12.
    Kindervater, G.A.P., Savelsbergh, M.W.P.: Vehicle routing: handling edge exchanges. In: Aarts, E., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 337–360. John Wiley & Sons, New York (1997)Google Scholar
  13. 13.
    Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. In: de Sousa, J.P., (ed) Proceedings of the 4th Metaheuristics International Conference, MIC 2001, pp. 143–147 (2001)Google Scholar
  14. 14.
    Rochat, Y., Taillard, É.D.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1(1), 147–167 (1995)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Marek Kubiak
    • 1
  • Przemysław Wesołek
    • 1
  1. 1.Institute of Computing Science, Poznan University of Technology, Piotrowo 2, 60-965 PoznanPoland

Personalised recommendations