IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v327y2025i1p22-41.html
   My bibliography  Save this article

An effective evolutionary algorithm for packing rectangles into a fixed size circular container

Author

Listed:
  • Lai, Xiangjing
  • Wang, Lei
  • Hao, Jin-Kao
  • Wu, Qinghua

Abstract

We study the general problem of orthogonally packing rectangles in a fixed size circular container. This is a computationally challenging combinatorial optimization problem with important real-world applications and has recently received much attention from the operations research community. We propose an effective evolutionary algorithm for four variants of the problem, which integrates an improved decoding procedure and several dedicated search operators for population initialization and new solution generation. Computational results on 108 popular benchmark instances show that the proposed algorithm advances the state of the art in practically solving these four variants of the problem by finding 53 new best solutions (26 for the variants of maximizing the area of the packed items and 27 for the variants of maximizing the number of the packed items). We perform experiments to verify the design of key algorithmic components.

Suggested Citation

  • Lai, Xiangjing & Wang, Lei & Hao, Jin-Kao & Wu, Qinghua, 2025. "An effective evolutionary algorithm for packing rectangles into a fixed size circular container," European Journal of Operational Research, Elsevier, vol. 327(1), pages 22-41.
    • Handle: RePEc:eee:ejores:v:327:y:2025:i:1:p:22-41
    DOI: 10.1016/j.ejor.2025.04.044
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725003297
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.04.044?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:ejores:v:327:y:2025:i:1:p:22-41. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.