Mostrar el registro sencillo del ítem

A mixed-integer linear programming model for the cutting stock problem in the steel industry

dc.contributor.authorMorillo-Torres, Danielspa
dc.contributor.authorTorres Baena, Mauriciospa
dc.contributor.authorEscobar, John Wilmerspa
dc.contributor.authorRomero-Conrado, Alfonso R.spa
dc.contributor.authorRomero-Conrado, Alfonso R.spa
dc.contributor.authorGustavo, Gaticaspa
dc.date.accessioned2022-07-11T13:31:01Z
dc.date.available2022-07-11T13:31:01Z
dc.date.issued2021
dc.identifier.citationMorillo-Torres, D., Baena, M.T., Escobar, J.W., Romero-Conrado, A.R., Coronado-Hernández, J.R., Gatica, G. (2021). A Mixed-Integer Linear Programming Model for the Cutting Stock Problem in the Steel Industry. In: Figueroa-García, J.C., Díaz-Gutierrez, Y., Gaona-García, E.E., Orjuela-Cañón, A.D. (eds) Applied Computer Sciences in Engineering. WEA 2021. Communications in Computer and Information Science, vol 1431. Springer, Cham. https://doi.org/10.1007/978-3-030-86702-7_27spa
dc.identifier.isbn978-3-030-86701-0spa
dc.identifier.urihttps://hdl.handle.net/11323/9356spa
dc.description.abstractA mixed-integer linear programming (MILP) model is proposed for solving a one dimension cutting stock problem (1D-CSP) in the steel industry. A case study of a metallurgical company is presented and the objective is to minimize waste in the cutting process of steel bars, considering inventory constraints and the potential use of the resulting leftovers. The computational results showed that an optimal solution was always found with an average improvement in waste reduction of 80%. There was no significant difference when comparing results between the complete model and the model without inventory constraints.eng
dc.format.extent1 páginaspa
dc.format.mimetypeapplication/pdfspa
dc.language.isoeng
dc.publisherSpringer, Chamspa
dc.relation.ispartofseriesCommunications in Computer and Information Science;spa
dc.rightsAtribución-NoComercial-CompartirIgual 4.0 Internacional (CC BY-NC-SA 4.0)spa
dc.rights© 2021 Springer Nature Switzerland AGspa
dc.rights.urihttps://creativecommons.org/licenses/by-nc-sa/4.0/spa
dc.titleA mixed-integer linear programming model for the cutting stock problem in the steel industryeng
dc.typeCapítulo - Parte de Librospa
dc.identifier.urlhttps://doi.org/10.1007/978-3-030-86702-7_27spa
dc.source.urlhttps://link.springer.com/chapter/10.1007/978-3-030-86702-7_27spa
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessspa
dc.identifier.doi10.1007/978-3-030-86702-7_27spa
dc.identifier.instnameCorporación Universidad de la Costaspa
dc.identifier.reponameREDICUC - Repositorio CUCspa
dc.identifier.repourlhttps://repositorio.cuc.edu.co/spa
dc.publisher.placeSwitzerlandspa
dc.relation.ispartofbookApplied Computer Sciences in Engineeringspa
dc.relation.referencesBenjaoran, V., Bhokha, S.: Three-step solutions for cutting stock problem of construction steel bars. KSCE J. Civ. Eng. 18(5), 1239–1247 (2014). https://doi.org/10.1007/s12205-014-0238-3spa
dc.relation.referencesBenjaoran, V., Sooksil, N., Metham, M.: Effect of demand variations on steel bars cutting loss. Int. J. Constr. Manag. 19(2), 137–148 (2019). https://doi.org/10.1080/15623599.2017.1401258spa
dc.relation.referencesCheng, C.H., Feiring, B.R., Cheng, T.C.: The cutting stock problem - a survey. Int. J. Prod. Econ. 36(3), 291–305 (1994). https://doi.org/10.1016/0925-5273(94)00045-Xspa
dc.relation.referencesCherri, A.C., Arenales, M.N., Yanasse, H.H., Poldi, K.C., Gonçalves Vianna, A.C.: The one-dimensional cutting stock problem with usable leftovers - a survey. Eur. J. Oper. Res. 236(2), 395–402 (2014). https://doi.org/10.1016/j.ejor.2013.11.026spa
dc.relation.referencesCui, Y., Yang, Y.: A heuristic for the one-dimensional cutting stock problem with usable leftover. Eur. J. Oper. Res. 204(2), 245–250 (2010). https://doi.org/10.1016/j.ejor.2009.10.028spa
dc.relation.referencesDell’Amico, M., Furini, F., Iori, M.: A branch-and-price algorithm for the temporal bin packing problem. Comput. Oper. Res. 114, 104825 (2020). https://doi.org/10.1016/j.cor.2019.104825spa
dc.relation.referencesDelorme, M., Iori, M.: Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems. INFORMS J. Comput. 32(1), 101–119 (2020). https://doi.org/10.1287/IJOC.2018.0880spa
dc.relation.referencesDyckhoff, H.: New linear programming approach to the cutting stock problem. Oper. Res. 29(6), 1092–1104 (1981). https://doi.org/10.1287/opre.29.6.1092spa
dc.relation.referencesDyckhoff, H.: A typology of cutting and packing problems. Eur. J. Oper. Res. 44(2), 145–159 (1990). https://doi.org/10.1016/0377-2217(90)90350-Kspa
dc.relation.referencesFilho, A.A., Moretti, A.C., Pato, M.V.: A comparative study of exact methods for the bi-objective integer one-dimensional cutting stock problem. J. Oper. Res. Soc. 69(1), 91–107 (2018). https://doi.org/10.1057/s41274-017-0214-7spa
dc.relation.referencesGilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem-Part II. Oper. Res. 11(6), 863–888 (1963). https://doi.org/10.1287/opre.11.6.863spa
dc.relation.referencesGolden, B.L.: Approaches to the cutting stock problem. AIIE Trans. 8(2), 265–274 (1976). https://doi.org/10.1080/05695557608975076spa
dc.relation.referencesJahromi, M.H., Tavakkoli-Moghaddam, R., Makui, A., Shamsi, A.: Solving an one-dimensional cutting stock problem by simulated annealing and tabu search. J. Ind. Eng. Int. 8(1), 24 (2012). https://doi.org/10.1186/2251-712X-8-24spa
dc.relation.referencesKantorovich, L.V.: Mathematical methods of organizing and planning production. Manag. Sci. 6(4), 366–422 (1960). https://doi.org/10.1287/mnsc.6.4.366spa
dc.relation.referencesLackes, R., Siepermann, M., Noll, T.: The problem of one-dimensionally cutting bars with alternative cutting lengths in the tubes rolling process. In: IEEE International Conference on Industrial Engineering and Engineering Management, pp. 1627–1631. IEEE Computer Society, Department of Business Information Management, Technische Universität Dortmund, Dortmund, Germany (2012). https://doi.org/10.1109/IEEM.2012.6838022spa
dc.relation.referencesLemos, F.K., Cherri, A.C., de Araujo, S.A.: The cutting stock problem with multiple manufacturing modes applied to a construction industry. Int. J. Prod. Res. 59(4), 1–19 (2020). https://doi.org/10.1080/00207543.2020.1720923spa
dc.relation.referencesMaher, R.A., Melhem, N.N., Almutlaq, M.: Developing a control and management system for reinforcement steel-leftover in industrial factories. IFAC-PapersOnLine 52(13), 625–629 (2019). https://doi.org/10.1016/j.ifacol.2019.11.091spa
dc.relation.referencesMoussavi Nadoushani, Z.S., Hammad, A.W., Xiao, J., Akbarnezhad, A.: Minimizing cutting wastes of reinforcing steel bars through optimizing lap splicing within reinforced concrete elements. Constr. Build. Mater. 185, 600–608 (2018). https://doi.org/10.1016/j.conbuildmat.2018.07.023spa
dc.relation.referencesPitombeira-Neto, A.R., Prata, B.d.A.: A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders. Top 28(1), 178–192 (2020). https://doi.org/10.1007/s11750-019-00531-3spa
dc.relation.referencesRomero-Conrado, A.R., Coronado-Hernandez, J.R., Rius-Sorolla, G., García-Sabater, J.P.: A Tabu list-based algorithm for capacitated multilevel lot-sizing with alternate bills of materials and co-production environments. Appl. Sci. (Switzerland) 9(7), 1464 (2019). https://doi.org/10.3390/app9071464spa
dc.relation.referencesRothe, M., Reyer, M., Mathar, R.: Process optimization for cutting steel-plates. In: Liberatore, F., Parlier, G.H., Demange, M. (eds.) ICORES 2017 - Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, vol. 2017-Janua, pp. 27–37. SCITEPRESS - Science and Technology Publications, Institute for Theoretical Information Technology, RWTH Aachen University, Kopernikusstraße 16, Aachen, 52074, Germany (2017). https://doi.org/10.5220/0006108400270037spa
dc.relation.referencesValério De Carvalho, J.M.: Exact solution of bin-packing problems using column generation and branch-and-bound. Ann. Oper. Res. 86(0), 629–659 (1999). https://doi.org/10.1023/a:1018952112615spa
dc.relation.referencesVance, P.H., Barnhart, C., Johnson, E.L., Nemhauser, G.L.: Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Appl. 3(2), 111–130 (1994). https://doi.org/10.1007/BF01300970spa
dc.relation.referencesVanderbeck, F.: Computational study of a column generation algorithm for bin packing and cutting stock problems. Math. Program. Ser. B 86(3), 565–594 (1999). https://doi.org/10.1007/s101070050105spa
dc.relation.referencesVarela, R., Vela, C.R., Puente, J., Sierra, M., González-Rodríguez, I.: An effective solution for a real cutting stock problem in manufacturing plastic rolls. Ann. Oper. Res. 166(1), 125–146 (2009). https://doi.org/10.1007/s10479-008-0407-1spa
dc.relation.referencesWäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109–1130 (2007). https://doi.org/10.1016/j.ejor.2005.12.047spa
dc.relation.referencesYang, C.T., Sung, T.C., Weng, W.C.: An improved tabu search approach with mixed objective function for one-dimensional cutting stock problems. Adv. Eng. Softw. 37(8), 502–513 (2006). https://doi.org/10.1016/j.advengsoft.2006.01.005spa
dc.subject.proposalCutting stock problemeng
dc.subject.proposalMixed-integer linear programmingeng
dc.subject.proposalSteel barseng
dc.subject.proposalIndustrial applicationeng
dc.type.coarhttp://purl.org/coar/resource_type/c_3248spa
dc.type.contentTextspa
dc.type.driverinfo:eu-repo/semantics/bookPartspa
dc.type.redcolhttp://purl.org/redcol/resource_type/CAP_LIBspa
dc.type.versioninfo:eu-repo/semantics/draftspa
dc.relation.citationendpage326spa
dc.relation.citationstartpage315spa
dc.type.coarversionhttp://purl.org/coar/version/c_ab4af688f83e57aaspa
dc.rights.coarhttp://purl.org/coar/access_right/c_abf2spa
dc.identifier.eisbn978-3-030-86702-7spa


Ficheros en el ítem

Thumbnail
Nombre:
A Mixed-Integer Linear Programming ...
Tamaño:
54.01Kb
Formato:
PDF
Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

  • Artículos científicos [3148]
    Artículos de investigación publicados por miembros de la comunidad universitaria.

Mostrar el registro sencillo del ítem

Atribución-NoComercial-CompartirIgual 4.0 Internacional (CC BY-NC-SA 4.0)
Excepto si se señala otra cosa, la licencia del ítem se describe como Atribución-NoComercial-CompartirIgual 4.0 Internacional (CC BY-NC-SA 4.0)