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

A 2-exchange heuristic for nesting problems

Author

Listed:
  • Gomes, A. Miguel
  • Oliveira, Jose F.

Abstract

No abstract is available for this item.

Suggested Citation

  • Gomes, A. Miguel & Oliveira, Jose F., 2002. "A 2-exchange heuristic for nesting problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 359-370, September.
    • Handle: RePEc:eee:ejores:v:141:y:2002:i:2:p:359-370
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00130-3
    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. Li, Zhenyu & Milenkovic, Victor, 1995. "Compaction and separation algorithms for non-convex polygons and their applications," European Journal of Operational Research, Elsevier, vol. 84(3), pages 539-561, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Luiz H. Cherri & Adriana C. Cherri & Edilaine M. Soler, 2018. "Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations," Journal of Global Optimization, Springer, vol. 72(1), pages 89-107, September.
    2. Chehrazad, Sahar & Roose, Dirk & Wauters, Tony, 2022. "A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation," European Journal of Operational Research, Elsevier, vol. 300(3), pages 809-826.
    3. Hongtao Tang & Xixing Li & Shunsheng Guo & Shuwei Liu & Li Li & Lang Huang, 2017. "An optimizing model to solve the nesting problem of rectangle pieces based on genetic algorithm," Journal of Intelligent Manufacturing, Springer, vol. 28(8), pages 1817-1826, December.
    4. Toledo, Franklina M.B. & Carravilla, Maria Antónia & Ribeiro, Cristina & Oliveira, José F. & Gomes, A. Miguel, 2013. "The Dotted-Board Model: A new MIP model for nesting irregular shapes," International Journal of Production Economics, Elsevier, vol. 145(2), pages 478-487.
    5. Igor Kierkosz & Maciej Łuczak, 2019. "A one-pass heuristic for nesting problems," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 29(1), pages 37-60.
    6. Nikolaus Furian & Siegfried Vössner, 2014. "A hybrid algorithm for constrained order packing," 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(1), pages 157-186, March.
    7. J A Bennell & J F Oliveira, 2009. "A tutorial in irregular shape packing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 93-105, May.
    8. Gomes, A. Miguel & Oliveira, Jose F., 2006. "Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming," European Journal of Operational Research, Elsevier, vol. 171(3), pages 811-829, June.
    9. Eunice López-Camacho & Gabriela Ochoa & Hugo Terashima-Marín & Edmund Burke, 2013. "An effective heuristic for the two-dimensional irregular bin packing problem," Annals of Operations Research, Springer, vol. 206(1), pages 241-264, July.
    10. Lastra-Díaz, Juan J. & Ortuño, M. Teresa, 2024. "Mixed-integer programming models for irregular strip packing based on vertical slices and feasibility cuts," European Journal of Operational Research, Elsevier, vol. 313(1), pages 69-91.
    11. Costa, M. Teresa & Gomes, A. Miguel & Oliveira, José F., 2009. "Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet," European Journal of Operational Research, Elsevier, vol. 192(1), pages 29-40, January.
    12. Burke, E.K. & Hellier, R.S.R. & Kendall, G. & Whitwell, G., 2007. "Complete and robust no-fit polygon generation for the irregular stock cutting problem," European Journal of Operational Research, Elsevier, vol. 179(1), pages 27-49, May.
    13. Umetani, Shunji & Murakami, Shohei, 2022. "Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1009-1026.
    14. Egeblad, Jens & Nielsen, Benny K. & Odgaard, Allan, 2007. "Fast neighborhood search for two- and three-dimensional nesting problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1249-1266, December.
    15. Yu, M.T. & Lin, T.Y. & Hung, C., 2009. "Active-set sequential quadratic programming method with compact neighbourhood algorithm for the multi-polygon mass production cutting-stock problem with rotatable polygons," International Journal of Production Economics, Elsevier, vol. 121(1), pages 148-161, September.
    16. Miguel Santoro & Felipe Lemos, 2015. "Irregular packing: MILP model based on a polygonal enclosure," Annals of Operations Research, Springer, vol. 235(1), pages 693-707, December.
    17. Edmund Burke & Robert Hellier & Graham Kendall & Glenn Whitwell, 2006. "A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem," Operations Research, INFORMS, vol. 54(3), pages 587-601, June.
    18. Elkeran, Ahmed, 2013. "A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering," European Journal of Operational Research, Elsevier, vol. 231(3), pages 757-769.

    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. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.
    2. Qiang Luo & Yunqing Rao, 2022. "Improved Sliding Algorithm for Generating No-Fit Polygon in the 2D Irregular Packing Problem," Mathematics, MDPI, vol. 10(16), pages 1-18, August.
    3. Bennell, Julia A. & Oliveira, Jose F., 2008. "The geometry of nesting problems: A tutorial," European Journal of Operational Research, Elsevier, vol. 184(2), pages 397-415, January.
    4. Masoud Hekmatfar & M. R. M. Aliha & Mir Saman Pishvaee & Tomasz Sadowski, 2023. "A Robust Flexible Optimization Model for 3D-Layout of Interior Equipment in a Multi-Floor Satellite," Mathematics, MDPI, vol. 11(24), pages 1-41, December.
    5. E G Birgin & J M Martínez & W F Mascarenhas & D P Ronconi, 2006. "Method of sentinels for packing items within arbitrary convex regions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 735-746, June.
    6. Leao, Aline A.S. & Toledo, Franklina M.B. & Oliveira, José Fernando & Carravilla, Maria Antónia & Alvarez-Valdés, Ramón, 2020. "Irregular packing problems: A review of mathematical models," European Journal of Operational Research, Elsevier, vol. 282(3), pages 803-822.
    7. Julia A. Bennell & Kathryn A. Dowsland, 2001. "Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting," Management Science, INFORMS, vol. 47(8), pages 1160-1172, August.
    8. Burke, E.K. & Hellier, R.S.R. & Kendall, G. & Whitwell, G., 2007. "Complete and robust no-fit polygon generation for the irregular stock cutting problem," European Journal of Operational Research, Elsevier, vol. 179(1), pages 27-49, May.
    9. Edmund K. Burke & Graham Kendall & Glenn Whitwell, 2009. "A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 505-516, August.
    10. Dickinson, John K. & Knopf, George K., 2000. "A moment based metric for 2-D and 3-D packing," European Journal of Operational Research, Elsevier, vol. 122(1), pages 133-144, April.
    11. Donald Jones, 2014. "A fully general, exact algorithm for nesting irregular shapes," Journal of Global Optimization, Springer, vol. 59(2), pages 367-404, July.
    12. Dowsland, Kathryn A. & Vaid, Subodh & Dowsland, William B., 2002. "An algorithm for polygon placement using a bottom-left strategy," European Journal of Operational Research, Elsevier, vol. 141(2), pages 371-381, September.
    13. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    14. Lastra-Díaz, Juan J. & Ortuño, M. Teresa, 2024. "Mixed-integer programming models for irregular strip packing based on vertical slices and feasibility cuts," European Journal of Operational Research, Elsevier, vol. 313(1), pages 69-91.
    15. Jie Fang & Yunqing Rao & Xusheng Zhao & Bing Du, 2023. "A Hybrid Reinforcement Learning Algorithm for 2D Irregular Packing Problems," Mathematics, MDPI, vol. 11(2), pages 1-17, January.
    16. Sato, André Kubagawa & Martins, Thiago Castro & Gomes, Antonio Miguel & Tsuzuki, Marcos Sales Guerra, 2019. "Raster penetration map applied to the irregular packing problem," European Journal of Operational Research, Elsevier, vol. 279(2), pages 657-671.
    17. Stoyan, Yu G. & Patsuk, V. N., 2000. "A method of optimal lattice packing of congruent oriented polygons in the plane," European Journal of Operational Research, Elsevier, vol. 124(1), pages 204-216, July.
    18. Umetani, Shunji & Murakami, Shohei, 2022. "Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1009-1026.
    19. Egeblad, Jens & Nielsen, Benny K. & Odgaard, Allan, 2007. "Fast neighborhood search for two- and three-dimensional nesting problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1249-1266, December.
    20. E. K. Burke & G. Kendall & G. Whitwell, 2004. "A New Placement Heuristic for the Orthogonal Stock-Cutting Problem," Operations Research, INFORMS, vol. 52(4), pages 655-671, 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:141:y:2002:i:2:p:359-370. 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.