Skip to main content
SpringerLink
Log in

Characterization and Automation of Matching-Based Neighborhoods

  • Conference paper
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6140))

  • 1863 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  3. Benoist, T.: Autonomous Local Search with Very Large-Scale Neighborhoods (manuscript in preparation)

    Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  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. Estellon, B., Gardi, F., Nouioua, K.: Large neighborhood improvements for solving car sequencing problems. RAIRO Operations Research 40(4), 355–379 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hamadi, Y., Monfroy, E., Saubion, F.: What is Autonomous Search? Microsoft research report. MSR-TR-2008-80 (2008)

    Google Scholar 

  9. Hurink, J.: An exponential neighborhood for a one-machine batching problem. OR Spectrum 21(4), 461–476 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  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. 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. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bouygues e-lab, 40 rue de Washington, 75008, Paris, France

    Thierry Benoist

Authors
  1. Thierry Benoist
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. DEIS, University of Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

    Andrea Lodi , Michela Milano  & Paolo Toth ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benoist, T. (2010). Characterization and Automation of Matching-Based Neighborhoods. In: Lodi, A., Milano, M., Toth, P. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2010. Lecture Notes in Computer Science, vol 6140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13520-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13520-0_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13519-4

  • Online ISBN: 978-3-642-13520-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation