Packing unequal circles into a square container based on the narrow action spaces

Science China Information Sciences volume 61, Article number: 048104 (2018) Cite this article

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

US$ 39.95

Tax calculation will be finalised during checkout.

References

  1. 1

    Hifi M, M’Hallah R. A literature review on circle and sphere packing problems: models and methodologies. Adv Oper Res, 2009. doi: 10.1155/2009/150624

    Google Scholar 

  2. 2

    Szabó P G, Markót M C, Csendes T, et al. New Approaches to Circle Packing in a Square: With Program Codes. Berlin: Springer, 2007

    Google Scholar 

  3. 3

    Liu J F, Zhang K W, Yao Y L, et al. A heuristic quasiphysical algorithm with coarse and fine adjustment for multi-objective weighted circles packing problem. Comput Ind Eng, 2016, 101: 416–426

    Article  Google Scholar 

  4. 4

    He K, Mo D Z, Ye T, et al. A coarse-to-fine quasiphysical optimization method for solving the circle packing problem with equilibrium constraints. Comput Ind Eng, 2013, 66: 1049–1060

    Article  Google Scholar 

  5. 5

    He K, Huang W Q, Jin Y. An efficient deterministic heuristic for two-dimensional rectangular packing. Comput Oper Res, 2012, 39: 1355–1363

    MathSciNet  Article  MATH  Google Scholar 

  6. 6

    He K, Huang M L, Yang C K. An action-space-based global optimization algorithm for packing circles into a square container. Comput Oper Res, 2015, 58: 67–74

    MathSciNet  Article  MATH  Google Scholar 

  7. 7

    Liu D C, Nocedal J. On the limited memory BFGS method for large scale optimization. Math Program, 1989, 45: 503–528

    MathSciNet  Article  MATH  Google Scholar 

  8. 8

    Fu Z H, Huang W Q, Lü Z P. Iterated tabu search for the circular open dimension problem. Eur J Oper Res, 2013, 225: 236–243

    MathSciNet  Article  MATH  Google Scholar 

Download references

Acknowledgments

This work was supported by National Natural Science Foundation of China (Grant Nos. 61472147, 61370183, 61602196, 61772219), and Shenzhen Science and Technology Planning Project (Grant No. JCYJ20170307154749425).

Author information

Affiliations

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

    Kun He, Mohammed Dosh, Yan Jin & Shenghao Zou

  2. Shenzhen Research Institute of Huazhong University of Science and Technology, Shenzhen, 518057, China

    Kun He

  3. Faculty of Education for Girls, Kufa University, Najaf, 00964, Iraq

    Mohammed Dosh

Authors
  1. Kun He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammed Dosh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yan Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shenghao Zou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohammed Dosh.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

He, K., Dosh, M., Jin, Y. et al. Packing unequal circles into a square container based on the narrow action spaces. Sci. China Inf. Sci. 61, 048104 (2018). https://doi.org/10.1007/s11432-017-9223-3

Download citation