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

An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles

Author

Listed:
  • Liu, Dequan
  • Teng, Hongfei

Abstract

No abstract is available for this item.

Suggested Citation

  • Liu, Dequan & Teng, Hongfei, 1999. "An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles," European Journal of Operational Research, Elsevier, vol. 112(2), pages 413-420, January.
    • Handle: RePEc:eee:ejores:v:112:y:1999:i:2:p:413-420
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00437-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Dowsland, Kathryn A. & Dowsland, William B., 1992. "Packing problems," European Journal of Operational Research, Elsevier, vol. 56(1), pages 2-14, January.
    2. Jakobs, Stefan, 1996. "On genetic algorithms for the packing of polygons," European Journal of Operational Research, Elsevier, vol. 88(1), pages 165-181, January.
    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. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 729-753, December.
    2. Beasley, J. E., 2004. "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, Elsevier, vol. 156(3), pages 601-627, August.
    3. Leung, Stephen C.H. & Zhang, Defu & Sim, Kwang Mong, 2011. "A two-stage intelligent search algorithm for the two-dimensional strip packing problem," European Journal of Operational Research, Elsevier, vol. 215(1), pages 57-69, November.
    4. Hadjiconstantinou, Eleni & Iori, Manuel, 2007. "A hybrid genetic algorithm for the two-dimensional single large object placement problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1150-1166, December.
    5. Song, X. & Chu, C.B. & Nie, Y.Y. & Bennell, J.A., 2006. "An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1870-1889, December.
    6. Bennell, Julia A. & Soon Lee, Lai & Potts, Chris N., 2013. "A genetic algorithm for two-dimensional bin packing with due dates," International Journal of Production Economics, Elsevier, vol. 145(2), pages 547-560.
    7. Wu, Yu-Liang & Huang, Wenqi & Lau, Siu-chung & Wong, C. K. & Young, Gilbert H., 2002. "An effective quasi-human based heuristic for solving the rectangle packing problem," European Journal of Operational Research, Elsevier, vol. 141(2), pages 341-358, September.
    8. Zehetner, Dominik & Gansterer, Margaretha, 2022. "The collaborative batching problem in multi-site additive manufacturing," International Journal of Production Economics, Elsevier, vol. 248(C).
    9. A Ghanmi & R H A D Shaw, 2008. "Modelling and analysis of Canadian Forces strategic lift and pre-positioning options," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1591-1602, December.
    10. Lins, Lauro & Lins, Sostenes & Morabito, Reinaldo, 2002. "An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container," European Journal of Operational Research, Elsevier, vol. 141(2), pages 421-439, September.
    11. Song, X. & Chu, C.B. & Lewis, R. & Nie, Y.Y. & Thompson, J., 2010. "A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting," European Journal of Operational Research, Elsevier, vol. 202(2), pages 368-378, April.
    12. Morabito, Reinaldo & Belluzzo, Luciano, 2007. "Optimising the cutting of wood fibre plates in the hardboard industry," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1405-1420, December.
    13. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    14. E G Birgin & R D Lobato & R Morabito, 2010. "An effective recursive partitioning approach for the packing of identical rectangles in a rectangle," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(2), pages 306-320, February.
    15. Nestor M Cid-Garcia & Yasmin A Rios-Solis, 2021. "Exact solutions for the 2d-strip packing problem using the positions-and-covering methodology," PLOS ONE, Public Library of Science, vol. 16(1), pages 1-20, January.
    16. Arenales, Marcos & Morabito, Reinaldo, 1995. "An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems," European Journal of Operational Research, Elsevier, vol. 84(3), pages 599-617, August.
    17. Lodi, Andrea & Martello, Silvano & Vigo, Daniele, 1999. "Approximation algorithms for the oriented two-dimensional bin packing problem," European Journal of Operational Research, Elsevier, vol. 112(1), pages 158-166, January.
    18. Saeed Asaeedi & Farzad Didehvar & Ali Mohades, 2018. "NLP Formulation for Polygon Optimization Problems," Mathematics, MDPI, vol. 7(1), pages 1-25, December.
    19. José Fernando Gonçalves & Mauricio G. C. Resende, 2011. "A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 180-201, August.
    20. Heckmann, Ralf & Lengauer, Thomas, 1998. "Computing closely matching upper and lower bounds on textile nesting problems," European Journal of Operational Research, Elsevier, vol. 108(3), pages 473-489, August.

    More about this item

    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:112:y:1999:i:2:p:413-420. 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: 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.