Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

A Short Note on a Simple Search Heuristic for the Diskspacking Problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper presents a short note on a simple heuristic to find a feasible arrangement of a given set of different disks in a given circular area. By restarting with good initial solutions and escaping from the local minima early, a heuristic that simulates a system of elastic solids can solve such a disks packing problem more quickly. A number of computational results show the effectiveness of these improvements.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Dowsland, K.A. (1991). “Palletisation of Cylinders in Cases.” OR Spektrum 13, 171-172.

    Google Scholar 

  • Dowsland, K.A. and W.B. Dowsland. (1992). “Packing Problems.” European Journal of Operational Research 56(1), 2-14.

    Article  Google Scholar 

  • Fraser, H.J. and J.A. George. (1994). “Integrated Container Loading Software for Pulp and Paper Industry.” European Journal of Operational Research 77/3, 466-474.

    Article  Google Scholar 

  • George, J.A. (1996). “Multiple Container Packing: A Case Study of Pipe Packing.” Journal of Operational Research Society 47, 1098-1109.

    Google Scholar 

  • George, J.A., J.M. George, and B.W. Lamar. (1995). “Packing Different-Sized Disks into a Rectangular Container.” European Journal of Operational Research 84, 693-712.

    Article  Google Scholar 

  • Graham, R.L., B.D. Lubachevsky, K.J. Nurmela, and P.R.J. Östergård. (1998). “Dense Packings of Congruent Circles in a Circle.” Discrete Mathematics 181, 139-154.

    Article  Google Scholar 

  • Haessler, R.W. and P.E. Sweeney. (1991). “Cutting Stock Problems and Solution Procedures.” European Journal of Operational Research 54, 141-150.

    Article  Google Scholar 

  • Isermann, H. (1991). “Heuristiken zur Lösung. Des zweidi-mensionalen Packproblems für Rundgef.” OR Spektrum 13, 213-223.

    Google Scholar 

  • Landau, L.D. and E.M. Lifschitz. (1976). Mechanics. Oxford: Pergamon Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretical Computer Science Institute, Huazhong University of Science and Technology, Wuhan, 430074, China

    Huang Wenqi & Kang Yan

  2. School of Software, Yunnan University, Kunming, 650091, China

    Huang Wenqi & Kang Yan

Authors
  1. Huang Wenqi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kang Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wenqi, H., Yan, K. A Short Note on a Simple Search Heuristic for the Diskspacking Problem. Ann Oper Res 131, 101–108 (2004). https://doi.org/10.1023/B:ANOR.0000039514.14699.03

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:ANOR.0000039514.14699.03

Search

Navigation