This paper shows that that some matching based neighborhood can be automatically designed by searching for stable sets in a graph. This move generation algorithm is illustrated and investigated within the LocalSolver framework.


Directed Acyclic Graph Linear Node Neighborhood Search Technique Local Search Descent Match Puzzle 
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.
    Ahuja, R.K., Ergun, O., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123(1-3), 75 (2002)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Angel, E., Bampis, E., Pascual, F.: An exponential (matching based) neighborhood for the vehicle routing problem. Journal of Combinatorial Optimization 15, 179–190 (2008)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Benoist, T.: Autonomous Local Search with Very Large-Scale Neighborhoods (manuscript in preparation)Google Scholar
  4. 4.
    Bozejko, W., Wodecki, M.: A Fast Parallel Dynasearch Algorithm for Some Scheduling Problems. Parallel Computing in Electrical Engineering, 275–280 (2006)Google Scholar
  5. 5.
    Cambazard, H., Horan, J., O’Mahony, E., O’Sullivan, B.: Fast and Scalable Domino Portrait Generation. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 51–65. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Cherkassky, B.V., Goldberg, A.V.: Negative-Cycle Detection Algorithms. In: Díaz, J. (ed.) ESA 1996. LNCS, vol. 1136, pp. 349–363. Springer, Heidelberg (1996)Google Scholar
  7. 7.
    Estellon, B., Gardi, F., Nouioua, K.: Large neighborhood improvements for solving car sequencing problems. RAIRO Operations Research 40(4), 355–379 (2006)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Hamadi, Y., Monfroy, E., Saubion, F.: What is Autonomous Search? Microsoft research report. MSR-TR-2008-80 (2008)Google Scholar
  9. 9.
    Hurink, J.: An exponential neighborhood for a one-machine batching problem. OR Spectrum 21(4), 461–476 (1999)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Mouthuy, S., Deville, Y., Van Hentenryck, P.: Toward a Generic Comet Implementation of Very Large-Scale Neighborhoods. In: 22nd National Conference of the Belgian Operations Research Society, Brussels, January 16-18 (2008)Google Scholar
  11. 11.
    Shaus, P., Deville, Y.: Hybridization of CP and VLNS for Eternity II. In: JFPC 2008 Quatrième Journées Francophones de Programmation par Contraintes, Nantes (2008)Google Scholar
  12. 12.
    Voudouris, C., Dorne, R., Lesaint, D., Liret, A.: iOpt: A Software Toolkit for Heuristic Search Methods. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 716–719. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Thierry Benoist
    • 1
  1. 1.Bouygues e-labParisFrance

Personalised recommendations