IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v15y2008i4d10.1007_s10878-007-9089-x.html
   My bibliography  Save this article

Simplest optimal guillotine cutting patterns for strips of identical circles

Author

Listed:
  • Yaodong Cui

    (Guangxi Normal University)

  • Tianlong Gu

    (Guilin University of Electronic Technology)

  • Wei Hu

    (Guangxi Normal University)

Abstract

The manufacturing industry often uses the cutting and stamping process to divide stock plates into circles. A guillotine machine cuts the plate into strips for stamping at the cutting stage, and then a stamping press punches out the circles from the strips at the stamping stage. The problem discussed is to cut a plate into strips of identical circles such that the number of circles is maximized. A dynamic programming algorithm is presented for generating the simplest optimal cutting patterns of the strips. The computational results indicate that the algorithm is much efficient in simplifying the cutting process.

Suggested Citation

  • Yaodong Cui & Tianlong Gu & Wei Hu, 2008. "Simplest optimal guillotine cutting patterns for strips of identical circles," Journal of Combinatorial Optimization, Springer, vol. 15(4), pages 357-367, May.
    • Handle: RePEc:spr:jcomop:v:15:y:2008:i:4:d:10.1007_s10878-007-9089-x
    DOI: 10.1007/s10878-007-9089-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-007-9089-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-007-9089-x?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. Agrawal, P. K., 1993. "Minimising trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts," European Journal of Operational Research, Elsevier, vol. 64(3), pages 410-422, February.
    2. George, John A. & George, Jennifer M. & Lamar, Bruce W., 1995. "Packing different-sized circles into a rectangular container," European Journal of Operational Research, Elsevier, vol. 84(3), pages 693-712, August.
    3. Cui, Yaodong, 2006. "Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors," European Journal of Operational Research, Elsevier, vol. 169(1), pages 30-40, February.
    4. Arslanov, M. Z., 2000. "Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles," European Journal of Operational Research, Elsevier, vol. 125(2), pages 239-248, September.
    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. Cui, Yaodong, 2006. "Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors," European Journal of Operational Research, Elsevier, vol. 169(1), pages 30-40, February.
    2. W Q Huang & Y Li & H Akeb & C M Li, 2005. "Greedy algorithms for packing unequal circles into a rectangular container," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 539-548, May.
    3. T. Kubach & A. Bortfeldt & H. Gehring, 2009. "Parallel greedy algorithms for packing unequal circles into a strip or a rectangle," 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. 17(4), pages 461-477, December.
    4. Birgin, E. G. & Martinez, J. M. & Ronconi, D. P., 2005. "Optimizing the packing of cylinders into a rectangular container: A nonlinear approach," European Journal of Operational Research, Elsevier, vol. 160(1), pages 19-33, January.
    5. Hifi, M. & M'Hallah, R., 2007. "A dynamic adaptive local search algorithm for the circular packing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1280-1294, December.
    6. Castillo, Ignacio & Kampas, Frank J. & Pintér, János D., 2008. "Solving circle packing problems by global optimization: Numerical results and industrial applications," European Journal of Operational Research, Elsevier, vol. 191(3), pages 786-802, December.
    7. Ronald E. Giachetti & Jean Carlo Sanchez, 2009. "A model to design recreational boat mooring fields," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(2), pages 158-174, March.
    8. Hakim Akeb & Mhand Hifi, 2010. "A hybrid beam search looking-ahead algorithm for the circular packing problem," Journal of Combinatorial Optimization, Springer, vol. 20(2), pages 101-130, August.
    9. Hifi, Mhand & Yousef, Labib, 2019. "A local search-based method for sphere packing problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 482-500.
    10. 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.
    11. Hifi, Mhand & Paschos, Vangelis Th. & Zissimopoulos, Vassilis, 2004. "A simulated annealing approach for the circular cutting problem," European Journal of Operational Research, Elsevier, vol. 159(2), pages 430-448, December.
    12. Yaohua He & Yong Wu, 2013. "Packing non-identical circles within a rectangle with open length," Journal of Global Optimization, Springer, vol. 56(3), pages 1187-1215, July.
    13. 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.
    14. 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.
    15. Suliman, S.M.A., 2006. "A sequential heuristic procedure for the two-dimensional cutting-stock problem," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 177-185, February.
    16. Cui, Yaodong & Gu, Tianlong & Hu, Wei, 2009. "A cutting-and-inventory control problem in the manufacturing industry of stainless steel wares," Omega, Elsevier, vol. 37(4), pages 864-875, August.
    17. Stoyan, Yu. G. & Yas'kov, G., 2004. "A mathematical model and a solution method for the problem of placing various-sized circles into a strip," European Journal of Operational Research, Elsevier, vol. 156(3), pages 590-600, August.
    18. Arslanov, M.Z. & Ashigaliev, D.U. & Ismail, E.E., 2008. "Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds," European Journal of Operational Research, Elsevier, vol. 185(1), pages 105-121, February.
    19. Yaodong Cui & Qiang Wang, 2007. "Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors," Journal of Combinatorial Optimization, Springer, vol. 14(1), pages 35-44, July.
    20. Wang, Huaiqing & Huang, Wenqi & Zhang, Quan & Xu, Dongming, 2002. "An improved algorithm for the packing of unequal circles within a larger containing circle," European Journal of Operational Research, Elsevier, vol. 141(2), pages 440-453, September.

    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:spr:jcomop:v:15:y:2008:i:4:d:10.1007_s10878-007-9089-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.