Skip to main content

Formulation Space Search for Circle Packing Problems

  • Conference paper

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

Abstract

Circle packing problems were recently solved via reformulation descent (RD) by switching between a cartesian and a polar formulation. Mixed formulations, with circle parameters individually formulated in either coordinate system, lead to local search methods in a formulation space. Computational results with up to 100 circles are included.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hertz, A., Plumettaz, M., Zufferey, N.: Variable space search for graph coloring, Les Cahiers du Gerad G-2006-81, Montreal, Canada

    Google Scholar 

  2. Kravitz, S.: Packing cylinders into cylindrical containers. Mathematics magazine 40, 65–70 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  3. Minos, Stanford Business Software Inc. website, http://www.sbsi-sol-optimize.com/products_minos5_5.html

  4. Mladenovic, N.: Formulation space search - a new approach to optimization (plenary talk). In: Vuleta, J. (ed.) Proceedings of XXXII SYMOPIS 2005, Vrnjacka Banja, Serbia, p. 3 (2005)

    Google Scholar 

  5. Mladenović, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24, 1097–1100 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  6. Mladenović, N., Plastria, F., Urošević, D.: Reformulation descent applied to circle packing problems. Computers & Operations Research 32, 2419–2434 (2005)

    Article  MATH  Google Scholar 

  7. Mladenovic, N., Plastria, F., Urošević, D.: Stochastic formulation space search methods. In: Proceedings of EURO XXI - Iceland, p. 79, Reykjavik (2006)

    Google Scholar 

  8. Plastria, F., Mladenović, N., Urošević, D.: Variable neighborhood formulation space search for circle packing. In: 18th Mini Euro Conference VNS, Tenerife, Spain, November 2005 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Thomas Stützle Mauro Birattari Holger H. Hoos

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mladenović, N., Plastria, F., Urošević, D. (2007). Formulation Space Search for Circle Packing Problems. In: Stützle, T., Birattari, M., H. Hoos, H. (eds) Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics. SLS 2007. Lecture Notes in Computer Science, vol 4638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74446-7_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74446-7_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74445-0

  • Online ISBN: 978-3-540-74446-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics