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

A genetic algorithm solution for one-dimensional bundled stock cutting

Author

Listed:
  • Wagner, Bret J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Wagner, Bret J., 1999. "A genetic algorithm solution for one-dimensional bundled stock cutting," European Journal of Operational Research, Elsevier, vol. 117(2), pages 368-381, September.
    • Handle: RePEc:eee:ejores:v:117:y:1999:i:2:p:368-381
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00244-6
    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. Robert W. Haessler, 1975. "Controlling Cutting Pattern Changes in One-Dimensional Trim Problems," Operations Research, INFORMS, vol. 23(3), pages 483-493, June.
    2. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    3. Stadtler, Hartmut, 1990. "A one-dimensional cutting stock problem in the aluminium industry and its solution," European Journal of Operational Research, Elsevier, vol. 44(2), pages 209-223, January.
    4. Goulimis, Constantine, 1990. "Optimal solutions for the cutting stock problem," European Journal of Operational Research, Elsevier, vol. 44(2), pages 197-208, January.
    5. Vahrenkamp, Richard, 1996. "Random search in the one-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 95(1), pages 191-200, November.
    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. Reinertsen, Harald & Vossen, Thomas W.M., 2010. "The one-dimensional cutting stock problem with due dates," European Journal of Operational Research, Elsevier, vol. 201(3), pages 701-711, March.
    2. Lu, Hao-Chun & Huang, Yao-Huei, 2015. "An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry," European Journal of Operational Research, Elsevier, vol. 246(1), pages 51-65.
    3. Beraldi, P. & Bruni, M.E. & Conforti, D., 2009. "The stochastic trim-loss problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 42-49, August.

    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. Umetani, Shunji & Yagiura, Mutsunori & Ibaraki, Toshihide, 2003. "One-dimensional cutting stock problem to minimize the number of different patterns," European Journal of Operational Research, Elsevier, vol. 146(2), pages 388-402, April.
    2. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    3. Keehoon Kwon & Doyeong Kim & Sunkuk Kim, 2021. "Cutting Waste Minimization of Rebar for Sustainable Structural Work: A Systematic Literature Review," Sustainability, MDPI, vol. 13(11), pages 1-21, May.
    4. 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.
    5. Hajizadeh, Iman & Lee, Chi-Guhn, 2007. "Alternative configurations for cutting machines in a tube cutting mill," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1385-1396, December.
    6. Dongho Lee & Seunghyun Son & Doyeong Kim & Sunkuk Kim, 2020. "Special-Length-Priority Algorithm to Minimize Reinforcing Bar-Cutting Waste for Sustainable Construction," Sustainability, MDPI, vol. 12(15), pages 1-15, July.
    7. Ramiro Varela & Camino Vela & Jorge Puente & María Sierra & Inés González-Rodríguez, 2009. "An effective solution for a real cutting stock problem in manufacturing plastic rolls," Annals of Operations Research, Springer, vol. 166(1), pages 125-146, February.
    8. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    9. Mateus Martin & Horacio Hideki Yanasse & Luiz Leduíno Salles-Neto, 2022. "Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 557-582, August.
    10. Tao Wu & Kerem Akartunal? & Raf Jans & Zhe Liang, 2017. "Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 523-543, August.
    11. Holthaus, Oliver, 2002. "Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths," European Journal of Operational Research, Elsevier, vol. 141(2), pages 295-312, September.
    12. Gleb Belov & Guntram Scheithauer, 2007. "Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 27-35, February.
    13. Gradisar, Miro & Resinovic, Gortan & Kljajic, Miroljub, 1999. "A hybrid approach for optimization of one-dimensional cutting," European Journal of Operational Research, Elsevier, vol. 119(3), pages 719-728, December.
    14. Sesh Murthy & Rama Akkiraju & Richard Goodwin & Pinar Keskinocak & John Rachlin & Frederick Wu & James Yeh & Robert Fuhrer & Santhosh Kumaran & Alok Aggarwal & Martin Sturzenbecker & Ranga Jayaraman &, 1999. "Cooperative Multiobjective Decision Support for the Paper Industry," Interfaces, INFORMS, vol. 29(5), pages 5-30, October.
    15. Pinar Keskinocak & Frederick Wu & Richard Goodwin & Sesh Murthy & Rama Akkiraju & Santhosh Kumaran & Annap Derebail, 2002. "Scheduling Solutions for the Paper Industry," Operations Research, INFORMS, vol. 50(2), pages 249-259, April.
    16. Chen, Chuen-Lung S. & Hart, Stephen M. & Tham, Wai Mui, 1996. "A simulated annealing heuristic for the one-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 93(3), pages 522-535, September.
    17. Erjavec, J. & Gradisar, M. & Trkman, P., 2012. "Assessment of stock size to minimize cutting stock production costs," International Journal of Production Economics, Elsevier, vol. 135(1), pages 170-176.
    18. W. D. D. Madhavee & N. Saldin & U. C. Vaidyarathna & C. J. Jayawardene, 2018. "A Practical Application of the Generalized Cutting Stock Algorithm," Academic Journal of Applied Mathematical Sciences, Academic Research Publishing Group, vol. 4(3), pages 15-21, 03-2018.
    19. Chengbin Chu & Julien Antonio, 1999. "Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems," Operations Research, INFORMS, vol. 47(4), pages 495-508, August.
    20. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.

    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:117:y:1999:i:2:p:368-381. 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.