IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v89y2016icp506-517.html
   My bibliography  Save this article

Quasi-human seniority-order algorithm for unequal circles packing

Author

Listed:
  • Zhu, Dingju

Abstract

In the existing methods for solving unequal circles packing problems, the initial configuration is given arbitrarily or randomly, but the impact of different initial configurations for existing packing algorithm to the speed of existing packing algorithm solving unequal circles packing problems is very large. The quasi-human seniority-order algorithm proposed in this paper can generate a better initial configuration for existing packing algorithm to accelerate the speed of existing packing algorithm solving unequal circles packing problems. In experiments, the quasi-human seniority-order algorithm is applied to generate better initial configurations for quasi-physical elasticity methods to solve the unequal circles packing problems, and the experimental results show that the proposed quasi-human seniority-order algorithm can greatly improve the speed of solving the problem.

Suggested Citation

  • Zhu, Dingju, 2016. "Quasi-human seniority-order algorithm for unequal circles packing," Chaos, Solitons & Fractals, Elsevier, vol. 89(C), pages 506-517.
    • Handle: RePEc:eee:chsofr:v:89:y:2016:i:c:p:506-517
    DOI: 10.1016/j.chaos.2016.02.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077916300613
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2016.02.030?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. János Balogh & József Békési & Gábor Galambos & Gerhard Reinelt, 2014. "On-line bin packing with restricted repacking," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 115-131, January.
    2. Gyorgy Dosa & Zsolt Tuza & Deshi Ye, 2013. "Bin packing with “Largest In Bottom” constraint: tighter bounds and generalizations," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 416-436, October.
    3. Galiev, Shamil I. & Lisafina, Maria S., 2013. "Linear models for the approximate solution of the problem of packing equal circles into a given domain," European Journal of Operational Research, Elsevier, vol. 230(3), pages 505-514.
    4. López, C.O. & Beasley, J.E., 2011. "A heuristic for the circle packing problem with a variety of containers," European Journal of Operational Research, Elsevier, vol. 214(3), pages 512-525, November.
    5. A. Grosso & A. Jamali & M. Locatelli & F. Schoen, 2010. "Solving the problem of packing equal and unequal circles in a circular container," Journal of Global Optimization, Springer, vol. 47(1), pages 63-81, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lai, Xiangjing & Hao, Jin-Kao & Yue, Dong & Lü, Zhipeng & Fu, Zhang-Hua, 2022. "Iterated dynamic thresholding search for packing equal circles into a circular container," European Journal of Operational Research, Elsevier, vol. 299(1), pages 137-153.
    2. Liu, Jingfa & Jiang, Yucong & Li, Gang & Xue, Yu & Liu, Zhaoxia & Zhang, Zhen, 2015. "Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 431(C), pages 166-174.
    3. Zhengguan Dai & Kathleen Xu & Melkior Ornik, 2021. "Repulsion-based p-dispersion with distance constraints in non-convex polygons," Annals of Operations Research, Springer, vol. 307(1), pages 75-91, December.
    4. Feifeng Zheng & Li Luo & E. Zhang, 2015. "NF-based algorithms for online bin packing with buffer and bounded item size," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 360-369, August.
    5. López, C.O. & Beasley, J.E., 2016. "A formulation space search heuristic for packing unequal circles in a fixed size circular container," European Journal of Operational Research, Elsevier, vol. 251(1), pages 64-73.
    6. Xiangjing Lai & Jin-Kao Hao & Renbin Xiao & Fred Glover, 2023. "Perturbation-Based Thresholding Search for Packing Equal Circles and Spheres," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 725-746, July.
    7. Papp, Dávid & Regős, Krisztina & Domokos, Gábor & Bozóki, Sándor, 2023. "The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices," European Journal of Operational Research, Elsevier, vol. 310(2), pages 511-517.
    8. Perboli, Guido & Brotcorne, Luce & Bruni, Maria Elena & Rosano, Mariangela, 2021. "A new model for Last-Mile Delivery and Satellite Depots management: The impact of the on-demand economy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    9. Fu, Zhanghua & Huang, Wenqi & Lü, Zhipeng, 2013. "Iterated tabu search for the circular open dimension problem," European Journal of Operational Research, Elsevier, vol. 225(2), pages 236-243.
    10. Andreas Fischer & Igor Litvinchev & Tetyana Romanova & Petro Stetsyuk & Georgiy Yaskov, 2023. "Quasi-Packing Different Spheres with Ratio Conditions in a Spherical Container," Mathematics, MDPI, vol. 11(9), pages 1-19, April.
    11. Minghui Zhang & Xin Han & Yan Lan & Hing-Fung Ting, 2017. "Online bin packing problem with buffer and bounded size revisited," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 530-542, February.
    12. Frank J. Kampas & János D. Pintér & Ignacio Castillo, 2020. "Packing ovals in optimized regular polygons," Journal of Global Optimization, Springer, vol. 77(1), pages 175-196, May.
    13. I Al-Mudahka & M Hifi & R M'Hallah, 2011. "Packing circles in the smallest circle: an adaptive hybrid algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 1917-1930, November.
    14. Galiev, Shamil I. & Lisafina, Maria S., 2013. "Linear models for the approximate solution of the problem of packing equal circles into a given domain," European Journal of Operational Research, Elsevier, vol. 230(3), pages 505-514.
    15. József Békési & Gábor Galambos, 2018. "Tight bounds for NF-based bounded-space online bin packing algorithms," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 350-364, February.
    16. Zeng, Zhizhong & Yu, Xinguo & He, Kun & Huang, Wenqi & Fu, Zhanghua, 2016. "Iterated Tabu Search and Variable Neighborhood Descent for packing unequal circles into a circular container," European Journal of Operational Research, Elsevier, vol. 250(2), pages 615-627.
    17. Amirgaliyeva, Zhazira & Mladenović, Nenad & Todosijević, Raca & Urošević, Dragan, 2017. "Solving the maximum min-sum dispersion by alternating formulations of two different problems," European Journal of Operational Research, Elsevier, vol. 260(2), pages 444-459.
    18. János Balogh & Leah Epstein & Asaf Levin, 2021. "More on ordered open end bin packing," Journal of Scheduling, Springer, vol. 24(6), pages 589-614, December.
    19. Brimberg, Jack & Kalczynski, Pawel & Drezner, Zvi, 2024. "Different formulations of the gray pattern problem and their optimal solutions," European Journal of Operational Research, Elsevier, vol. 316(1), pages 61-71.
    20. Wang, Yingcong & Wang, Yanfeng & Sun, Junwei & Huang, Chun & Zhang, Xuncai, 2019. "A stimulus–response-based allocation method for the circle packing problem with equilibrium constraints," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 522(C), pages 232-247.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:89:y:2016:i:c:p:506-517. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.