Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/71357
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Quiroga-Orozco, John J. | por |
dc.contributor.author | Valério de Carvalho, José Manuel | por |
dc.contributor.author | Hoto, Robinson S., V | por |
dc.date.accessioned | 2021-04-07T10:41:57Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | Quiroga‐Orozco, J.J., Valério de Carvalho, J. and V. Hoto, R.S. (2019), A strong integer linear optimization model to the compartmentalized knapsack problem. Intl. Trans. in Op. Res., 26: 1633-1654. https://doi.org/10.1111/itor.12639 | por |
dc.identifier.issn | 0969-6016 | - |
dc.identifier.uri | https://hdl.handle.net/1822/71357 | - |
dc.description.abstract | The compartmentalized knapsack problem (CKP) is a relatively new type of problem with a wide application in industrial processes, arising, for instance, in the case of cutting steel coils in two phases in the metallurgicalindustry. In the literature, there are two mathematical formulations for the CKP: a classical formulation, which is a nonlinear integer programming (IP) model, and a recent (linear) IP formulation, obtained by discretizing the compartments that can be built for each class of items; the latter is an important contribution, because it makes the problem amenable to solution by mixed-integer linear programming tools. Combinatorial enumeration algorithms and several pseudo-polynomial decomposition heuristics were also developed for theCKP. This paper presents a new model for the exact solution of the CKP, denoted as the strong integer linear model, derived from the (linear) IP formulation by strengthening data, reducing symmetry, and lifting, and also a new pseudo-polynomial heuristic, the heuristic of the pk strong capacities. Computational experiments are presented with a large set of instances that show the advantage of the new approaches. The strong model solves the CKP exactly more than seven times faster, and the new heuristic is more efficient, presenting a good balance in the terms ofeffectiveness. | por |
dc.description.sponsorship | We thank the referees for the valuable comments and suggestions that helped to improve the presentation. The first author has been supported by CAPES through the Partnerships Program for Education and Training (PAEC) between the Organization of American States (OAS) and the Coimbra Group of Brazilian Universities (GCUB). The second author has been supported by COMPETE: POCI‐01‐0145‐FEDER‐007043 and FCT – Fundação para a Ciência e a Tecnologia within the Project Scope: UID/CEC/00319/2013. We thank FICO® for giving us the Xpress suite. | por |
dc.language.iso | eng | por |
dc.publisher | Wiley | por |
dc.relation | info:eu-repo/grantAgreement/FCT/5876/147280/PT | por |
dc.rights | restrictedAccess | por |
dc.subject | compartmentalized knapsack problem | por |
dc.subject | linear strong model optimization | por |
dc.subject | discrete optimization | por |
dc.subject | linear programming | por |
dc.title | A strong integer linear optimization model to the compartmentalized knapsack problem | por |
dc.type | article | por |
dc.peerreviewed | yes | por |
dc.relation.publisherversion | https://onlinelibrary.wiley.com/doi/full/10.1111/itor.12639 | por |
oaire.citationStartPage | 1633 | por |
oaire.citationEndPage | 1654 | por |
oaire.citationIssue | 5 | por |
oaire.citationVolume | 26 | por |
dc.date.updated | 2021-04-07T09:55:56Z | - |
dc.identifier.doi | 10.1111/itor.12639 | por |
dc.date.embargo | 10000-01-01 | - |
dc.subject.wos | Social Sciences | - |
dc.subject.wos | Science & Technology | - |
sdum.export.identifier | 8975 | - |
sdum.journal | International Transactions in Operational Research | por |
oaire.version | AM | por |
Aparece nas coleções: | CAlg - Artigos em revistas internacionais / Papers in international journals |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
artigoITOR RepositoriUM.pdf Acesso restrito! | 282,94 kB | Adobe PDF | Ver/Abrir |