Skip to main content
SpringerLink
Log in
Book cover

Mexican International Conference on Artificial Intelligence

MICAI 2014: Nature-Inspired Computation and Machine Learning pp 319–330Cite as

Solving Binary Cutting Stock with Matheuristics

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8857))

Abstract

Many Combinatorial Optimization (CO) problems are classifed as NP - complete problems. The process of solving CO problems in an efficient manner is important since several industry, government and scientific problems can be statedin this form. This work presents a benchmark of three different methodologies to solve the Binary Cutting Stock (BCS) problem; exact methodology by applying Column Generation (CG), a Genetic Algorithm (GA) and an hybrid between exact methods and Genetic Algorithms in a Column Generation framework which we denominate Matheuristic (MA). This benchmark analysis is aimed to show Matheuristic solution quality is as good as the obtained by the exact methodology. Details about implementation and computational performance are discussed.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aickelin, U., Dowsland, K.A.: An indirect genetic algorithm for a nurse-scheduling problem. Computers and Operations Research 31(5), 761–778 (2004)

    Article  MATH  Google Scholar 

  2. Barnhart, C., Cohn, A.M., Johnson, E.L., Klabjan, D., Nemhauser, G.L., Vance, P.H.: Airline crew scheduling. In: Hall, R.W. (ed.) Handbook of Transportation Science. International Series in Operations Research and Management Science, vol. 56, pp. 517–560. Springer US (2003)

    Google Scholar 

  3. Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. European Journal of Operational Research 94(2), 392–404 (1996)

    Article  MATH  Google Scholar 

  4. Cacchiani, V., Caprara, A., Toth, P.: Non-cyclic train timetabling and comparability graphs. Operations Research Letters 38(3), 179–184 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  5. Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Annals of Operations Research 98(1-4), 353–371 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Christiansen, C.H., Lysgaard, J., Wahlk, S.: A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands. Operations Research Letters 37(6), 392–398 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chvatal, V.: Linear Programming. A Series of Books in the Mathematical Sciences. W. H. Freeman (1983)

    Google Scholar 

  8. Chvtal, V., Cook, W., Hartmann, M.: On cutting-plane proofs in combinatorial optimization. Linear Algebra and its Applications, 114-115(0), 455–499 (1989); Special Issue Dedicated to Hoffman, A.J.

    Google Scholar 

  9. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (2009)

    Google Scholar 

  10. Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Operations Research 8(1), 101–111 (1960)

    Article  MATH  Google Scholar 

  11. Desaulniers, G., Desrosiers, J., Dumas, Y., Marc, S., Rioux, B., Solomon, M.M., Soumis, F.: Crew pairing at air france. European Journal of Operational Research 97(2), 245–259 (1997)

    Article  MATH  Google Scholar 

  12. Drezner, Z.: Compounded genetic algorithms for the quadratic assignment problem. Operations Research Letters 33(5), 475–480 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Natural Computing Series. Springer (2003)

    Google Scholar 

  14. Garey, R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences. W.H. Freeman (1979)

    Google Scholar 

  15. Gilmore, P.C., Gomory, R.E.: A Linear Programming Approach to the Cutting-Stock Problem. Operations Research 9(6), 849–859 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  16. Haessler, R.W., Sweeney, P.E.: Cutting stock problems and solution procedures. European Journal of Operational Research 54(2), 141–150 (1991)

    Article  MATH  Google Scholar 

  17. Jin, M., Liu, K., Eksioglu, B.: A column generation approach for the split delivery vehicle routing problem. Operations Research Letters 36(2), 265–270 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  18. Russell, S.J., Norvig, P.: Artificial intelligence: a modern approach. Prentice Hall series in artificial intelligence. Pearson Education/Prentice Hall (2010)

    Google Scholar 

  19. Singh, G., Ernst, A.T.: Resource constraint scheduling with a fractional shared resource. Operations Research Letters 39(5), 363–368 (2011)

    MATH  MathSciNet  Google Scholar 

  20. Vance, P.H., Barnhart, C., Johnson, E.L., Nemhauser, G.L.: Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications 3(2), 111–130 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  21. Zheng, Y.-L., Lei, D.-M.: Hybrid Niche Genetic Algorithm for Set Covering Problem. In: 2007 International Conference on Machine Learning and Cybernetics, pp. 1009–1013 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto Tecnologico y de Estudios Superiores de Monterrey, Mexico

    Ivan Adrian Lopez Sanchez, Jaime Mora Vargas & Miguel Gonzalez Mendoza

  2. Hewlett-Packard, USA

    Cipriano A. Santos

Authors
  1. Ivan Adrian Lopez Sanchez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jaime Mora Vargas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cipriano A. Santos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Miguel Gonzalez Mendoza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centro de Investigación en Computación, Instituto Politécnico Nacional, Av. Juan Dios Bátiz s/n, Col. Nueva Industrial Vallejo, 07738, Mexico City, Mexico

    Alexander Gelbukh

  2. Universidad Autónoma del Estado de Hidalgo, Área Académica de Computación y Electrónica, Carretera Pachuca-Tulancingo, , Km. 4.5, Col. Carboneras, Mineral de la Reforma,, 42180, Hidalgo, Mexico

    Félix Castro Espinoza

  3. Facultad de ciencias, Universidad Autónoma Nacional de México, Ciudad Universitaria, México DF, Mexico

    Sofía N. Galicia-Haro

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Lopez Sanchez, I.A., Mora Vargas, J., Santos, C.A., Gonzalez Mendoza, M. (2014). Solving Binary Cutting Stock with Matheuristics. In: Gelbukh, A., Espinoza, F.C., Galicia-Haro, S.N. (eds) Nature-Inspired Computation and Machine Learning. MICAI 2014. Lecture Notes in Computer Science(), vol 8857. Springer, Cham. https://doi.org/10.1007/978-3-319-13650-9_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13650-9_29

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13649-3

  • Online ISBN: 978-3-319-13650-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation