Skip to main content

Improving Cutting-Stock Plans with Multi-objective Genetic Algorithms

  • Conference paper
Book cover Bio-inspired Modeling of Cognitive Tasks (IWINAC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4527))

Abstract

In this paper, we confront a variant of the cutting-stock problem with multiple objectives. The starting point is a solution calculated by a heuristic algorithm, termed SHRP, that aims to optimize the two main objectives, i.e. the number of cuts and the number of different patterns. Here, we propose a multi-objective genetic algorithm to optimize other secondary objectives such as changeovers, completion times of orders pondered by priorities and open stacks. We report experimental results showing that the multi-objective genetic algorithm is able to improve the solutions obtained by SHRP on the secondary objectives.

This work has been partially supported by the Principality of Asturias Government under Research Contract FC-06-BP04-021.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Puente, J., Sierra, M., González, I., Vela, C., Alonso, C., Varela, R.: An actual problem in optimizing plastic rolls cutting. In: Workshop on Planning, Scheduling and Temporal Reasoning (CAEPIA), pp. 21–30 (2005)

    Google Scholar 

  2. Varela, R., Puente, J., Sierra, M., González, I., Vela, C.: An effective solution for an actual cutting stock problem in manufacturing plastic rolls. In: Proceedings APMOD (2006)

    Google Scholar 

  3. Resende, M., Ribeiro, G.: Greedy randomized adaptive search procedures. In: Handbook of Metaheuristics, pp. 219–249. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  4. Belov, G., Scheithauer, G.: Setup and open stacks minimization in one-dimensional stock cutting. INFORMS Journal of Computing 19(1) (2007)

    Google Scholar 

  5. Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Operations Research 9, 849–859 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  6. Zhou, G., Gen, M.: Genetic algorithm approach on multi-criteria minimum spanning tree problem. European Journal of Operational Research 114, 141–152 (1999)

    Article  MATH  Google Scholar 

  7. Muñoz, C.: A Multiobjective Evolutionary Algorithm to Compute Cutting Plans for Plastic Rolls. Technical Report. University of Oviedo, Gijón School of Computting (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

José Mira José R. Álvarez

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Muñoz, C., Sierra, M., Puente, J., Vela, C.R., Varela, R. (2007). Improving Cutting-Stock Plans with Multi-objective Genetic Algorithms. In: Mira, J., Álvarez, J.R. (eds) Bio-inspired Modeling of Cognitive Tasks. IWINAC 2007. Lecture Notes in Computer Science, vol 4527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73053-8_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73053-8_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73052-1

  • Online ISBN: 978-3-540-73053-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics