IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i4p647-656.html
   My bibliography  Save this article

Heuristic for constrained two-dimensional three-staged patterns

Author

Listed:
  • Yi-Ping Cui

    (College of Computer and Electronic Information, Guangxi University, Nanning, China)

  • Yaodong Cui

    (College of Computer and Electronic Information, Guangxi University, Nanning, China)

  • Tianbing Tang

    (College of Computer and Electronic Information, Guangxi University, Nanning, China)

  • Wei Hu

    (Library, Guangxi University, Nanning, China)

Abstract

Three-staged cutting patterns are often used in dividing large plates into small rectangular items. Vertical cuts separate the plate into segments in the first stage, horizontal cuts split each segment into strips in the second stage, and vertical cuts divide each strip into items in the third stage. A heuristic algorithm for generating constrained three-staged patterns is presented in this paper. The optimization objective is to maximize the pattern value that is the total value of the included items, while the frequency of each item type should not exceed the specified upper bound. The algorithm uses an exact procedure to generate strips and two heuristic procedures to generate segments and the pattern. The pattern-generation procedure first determines an initial solution and then uses its information to generate more segments to extend the solution space. Computational results show that the algorithm is effective in improving solution quality.

Suggested Citation

  • Yi-Ping Cui & Yaodong Cui & Tianbing Tang & Wei Hu, 2015. "Heuristic for constrained two-dimensional three-staged patterns," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(4), pages 647-656, April.
    • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:4:p:647-656
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n4/pdf/jors201433a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v66/n4/full/jors201433a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

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


    Cited by:

    1. Yaodong Cui & Xiang Song & Yan Chen & Yi-Ping Cui, 2017. "New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(3), pages 269-280, March.

    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:pal:jorsoc:v:66:y:2015:i:4:p:647-656. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.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.