Problema de recobrimento de conjuntos com agrupamento: modelos e algoritmos
Autor(a) principal: | |
---|---|
Data de Publicação: | 2015 |
Tipo de documento: | Dissertação |
Idioma: | por |
Título da fonte: | Repositório Institucional Manancial UFSM |
Texto Completo: | http://repositorio.ufsm.br/handle/1/15440 |
Resumo: | This work addresses the clustered set covering problem, a variant of the classic set covering problem in which sets are arranged in K disjoint clusters. Two practical applications found in the literature are presented. The first originates from electrical engineering, specifically from the problem addressed by Fritzen et al. (2012). An intrinsic characteristic of this problem led to a generalization in set allocation, so that the intersection between clusters is allowed. The second application comes from the mining industry and is owed to Bilal et al. (2014). They proposed a set of instances and a metaheuristic based on iterated tabu search (ITS). Regarding solution methods, the first contribution of this work is a mathematical formulation with column generation, used in order to obtain upper bounds for the instances. Two other contributions refer to the ITS metaheuristic, with the former consisting in a parallel approach for the tabu search component, while the latter resides in the addition of a neighborhood solved with integer programming and based on hard variable fixing. The idea behind the addition of the neighborhood is to occupy the time saved by the parallel approach with the improvement of promising solutions obtained by tabu search. The computational results show improvements in solution quality for the vast majority of instances. Moreover, given the magnitude of the costs involved in the problem, it is possible to conclude that the improvement of ITS metaheuristic with the contributions presented in this work can provide significant economic benefit. |
id |
UFSM-20_6558987328388263c4afea3d761c5eaa |
---|---|
oai_identifier_str |
oai:repositorio.ufsm.br:1/15440 |
network_acronym_str |
UFSM-20 |
network_name_str |
Repositório Institucional Manancial UFSM |
repository_id_str |
3913 |
spelling |
2019-01-23T12:20:15Z2019-01-23T12:20:15Z2015-04-14http://repositorio.ufsm.br/handle/1/15440This work addresses the clustered set covering problem, a variant of the classic set covering problem in which sets are arranged in K disjoint clusters. Two practical applications found in the literature are presented. The first originates from electrical engineering, specifically from the problem addressed by Fritzen et al. (2012). An intrinsic characteristic of this problem led to a generalization in set allocation, so that the intersection between clusters is allowed. The second application comes from the mining industry and is owed to Bilal et al. (2014). They proposed a set of instances and a metaheuristic based on iterated tabu search (ITS). Regarding solution methods, the first contribution of this work is a mathematical formulation with column generation, used in order to obtain upper bounds for the instances. Two other contributions refer to the ITS metaheuristic, with the former consisting in a parallel approach for the tabu search component, while the latter resides in the addition of a neighborhood solved with integer programming and based on hard variable fixing. The idea behind the addition of the neighborhood is to occupy the time saved by the parallel approach with the improvement of promising solutions obtained by tabu search. The computational results show improvements in solution quality for the vast majority of instances. Moreover, given the magnitude of the costs involved in the problem, it is possible to conclude that the improvement of ITS metaheuristic with the contributions presented in this work can provide significant economic benefit.Este trabalho aborda o problema de recobrimento de conjuntos com agrupamento, definido como uma variante do problema de recobrimento de conjuntos clássico, na qual os conjuntos estão dispostos em K agrupamentos disjuntos. São apresentadas duas aplicações práticas para o problema encontradas na literatura. A primeira delas tem origem na engenharia elétrica, especificamente no problema abordado por Fritzen et al (2012). Uma característica intrínseca ao problema, levou à generalização da atribuição dos conjuntos aos agrupamentos, de forma que a intersecção seja permitida. A segunda aplicação é oriunda da indústria de mineração e devida a Bilal et al. (2014), que propõem um conjunto de instâncias e uma meta-heurística baseada em iterated tabu search (ITS). Em se tratando de métodos de resolução, a primeira contribuição apresentada neste trabalho consiste em uma formulação matemática com geração de colunas para obtenção de limitantes superiores para as instâncias. Outras duas contribuições se referem à meta-heurística ITS, sendo que a primeira consiste em uma abordagem paralela para o componente de busca tabu, enquanto a segunda reside na adição de uma vizinhança resolvida com programação inteira e que faz uso de hard variable fixing. A ideia subjacente ao uso da vizinhança é ocupar o tempo economizado na paralelização com o aperfeiçoamento de soluções promissoras obtidas pela busca tabu. Os resultados computacionais obtidos mostram melhora na qualidade da solução para a ampla maioria das instâncias. Dada ainda a magnitude dos custos envolvidos no problema, é possível concluir que o aprimoramento da meta-heurística ITS com as sugestões deste trabalho pode ser de significativo benefício econômico.Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPESporUniversidade Federal de Santa MariaCentro de TecnologiaPrograma de Pós-Graduação em Ciência da ComputaçãoUFSMBrasilCiência da ComputaçãoAttribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/openAccessOtimização combinatóriaModelo matemáticoMeta-heurísticaCombinatorial optimizationMathematical modelMetaheuristicCNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAOProblema de recobrimento de conjuntos com agrupamento: modelos e algoritmosClustered set covering problem: models and algorithmsinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisMüller, Felipe Martinshttp://lattes.cnpq.br/5941686828835081Santos, Haroldo Gambinihttp://lattes.cnpq.br/6320646681995247http://lattes.cnpq.br/6675232795085485Brum, Artur Ferreira10030000000760071f97871-5101-4fa8-b821-aa730e3775c4d159ac34-69cd-49ef-8e20-f9059f8107c2cf3917a2-ae96-4958-a03e-71238b4f165areponame:Repositório Institucional Manancial UFSMinstname:Universidade Federal de Santa Maria (UFSM)instacron:UFSMCC-LICENSElicense_rdflicense_rdfapplication/rdf+xml; charset=utf-8805http://repositorio.ufsm.br/bitstream/1/15440/2/license_rdf4460e5956bc1d1639be9ae6146a50347MD52LICENSElicense.txtlicense.txttext/plain; charset=utf-816http://repositorio.ufsm.br/bitstream/1/15440/3/license.txtf8fcb28efb1c8cf0dc096bec902bf4c4MD53ORIGINALDIS_PPGCC_2015_BRUM_ARTUR.pdfDIS_PPGCC_2015_BRUM_ARTUR.pdfDissertação de Mestradoapplication/pdf426381http://repositorio.ufsm.br/bitstream/1/15440/1/DIS_PPGCC_2015_BRUM_ARTUR.pdf43a89d4bb200cb5b6bdd0aeccb37f901MD51TEXTDIS_PPGCC_2015_BRUM_ARTUR.pdf.txtDIS_PPGCC_2015_BRUM_ARTUR.pdf.txtExtracted texttext/plain99574http://repositorio.ufsm.br/bitstream/1/15440/4/DIS_PPGCC_2015_BRUM_ARTUR.pdf.txt68e2a4999532edcaa15c0cdcfa55c2a1MD54THUMBNAILDIS_PPGCC_2015_BRUM_ARTUR.pdf.jpgDIS_PPGCC_2015_BRUM_ARTUR.pdf.jpgIM Thumbnailimage/jpeg4601http://repositorio.ufsm.br/bitstream/1/15440/5/DIS_PPGCC_2015_BRUM_ARTUR.pdf.jpg8c202b3959ed42b45cb062fe96c21817MD551/154402019-01-24 03:00:31.202oai:repositorio.ufsm.br:1/15440Q3JlYXRpdmUgQ29tbW9ucw==Repositório Institucionalhttp://repositorio.ufsm.br/PUBhttp://repositorio.ufsm.br/oai/requestouvidoria@ufsm.bropendoar:39132019-01-24T05:00:31Repositório Institucional Manancial UFSM - Universidade Federal de Santa Maria (UFSM)false |
dc.title.por.fl_str_mv |
Problema de recobrimento de conjuntos com agrupamento: modelos e algoritmos |
dc.title.alternative.eng.fl_str_mv |
Clustered set covering problem: models and algorithms |
title |
Problema de recobrimento de conjuntos com agrupamento: modelos e algoritmos |
spellingShingle |
Problema de recobrimento de conjuntos com agrupamento: modelos e algoritmos Brum, Artur Ferreira Otimização combinatória Modelo matemático Meta-heurística Combinatorial optimization Mathematical model Metaheuristic CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
title_short |
Problema de recobrimento de conjuntos com agrupamento: modelos e algoritmos |
title_full |
Problema de recobrimento de conjuntos com agrupamento: modelos e algoritmos |
title_fullStr |
Problema de recobrimento de conjuntos com agrupamento: modelos e algoritmos |
title_full_unstemmed |
Problema de recobrimento de conjuntos com agrupamento: modelos e algoritmos |
title_sort |
Problema de recobrimento de conjuntos com agrupamento: modelos e algoritmos |
author |
Brum, Artur Ferreira |
author_facet |
Brum, Artur Ferreira |
author_role |
author |
dc.contributor.advisor1.fl_str_mv |
Müller, Felipe Martins |
dc.contributor.advisor1Lattes.fl_str_mv |
http://lattes.cnpq.br/5941686828835081 |
dc.contributor.referee1.fl_str_mv |
Santos, Haroldo Gambini |
dc.contributor.referee1Lattes.fl_str_mv |
http://lattes.cnpq.br/6320646681995247 |
dc.contributor.authorLattes.fl_str_mv |
http://lattes.cnpq.br/6675232795085485 |
dc.contributor.author.fl_str_mv |
Brum, Artur Ferreira |
contributor_str_mv |
Müller, Felipe Martins Santos, Haroldo Gambini |
dc.subject.por.fl_str_mv |
Otimização combinatória Modelo matemático Meta-heurística |
topic |
Otimização combinatória Modelo matemático Meta-heurística Combinatorial optimization Mathematical model Metaheuristic CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
dc.subject.eng.fl_str_mv |
Combinatorial optimization Mathematical model Metaheuristic |
dc.subject.cnpq.fl_str_mv |
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
description |
This work addresses the clustered set covering problem, a variant of the classic set covering problem in which sets are arranged in K disjoint clusters. Two practical applications found in the literature are presented. The first originates from electrical engineering, specifically from the problem addressed by Fritzen et al. (2012). An intrinsic characteristic of this problem led to a generalization in set allocation, so that the intersection between clusters is allowed. The second application comes from the mining industry and is owed to Bilal et al. (2014). They proposed a set of instances and a metaheuristic based on iterated tabu search (ITS). Regarding solution methods, the first contribution of this work is a mathematical formulation with column generation, used in order to obtain upper bounds for the instances. Two other contributions refer to the ITS metaheuristic, with the former consisting in a parallel approach for the tabu search component, while the latter resides in the addition of a neighborhood solved with integer programming and based on hard variable fixing. The idea behind the addition of the neighborhood is to occupy the time saved by the parallel approach with the improvement of promising solutions obtained by tabu search. The computational results show improvements in solution quality for the vast majority of instances. Moreover, given the magnitude of the costs involved in the problem, it is possible to conclude that the improvement of ITS metaheuristic with the contributions presented in this work can provide significant economic benefit. |
publishDate |
2015 |
dc.date.issued.fl_str_mv |
2015-04-14 |
dc.date.accessioned.fl_str_mv |
2019-01-23T12:20:15Z |
dc.date.available.fl_str_mv |
2019-01-23T12:20:15Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/masterThesis |
format |
masterThesis |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://repositorio.ufsm.br/handle/1/15440 |
url |
http://repositorio.ufsm.br/handle/1/15440 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.relation.cnpq.fl_str_mv |
100300000007 |
dc.relation.confidence.fl_str_mv |
600 |
dc.relation.authority.fl_str_mv |
71f97871-5101-4fa8-b821-aa730e3775c4 d159ac34-69cd-49ef-8e20-f9059f8107c2 cf3917a2-ae96-4958-a03e-71238b4f165a |
dc.rights.driver.fl_str_mv |
Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
Universidade Federal de Santa Maria Centro de Tecnologia |
dc.publisher.program.fl_str_mv |
Programa de Pós-Graduação em Ciência da Computação |
dc.publisher.initials.fl_str_mv |
UFSM |
dc.publisher.country.fl_str_mv |
Brasil |
dc.publisher.department.fl_str_mv |
Ciência da Computação |
publisher.none.fl_str_mv |
Universidade Federal de Santa Maria Centro de Tecnologia |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional Manancial UFSM instname:Universidade Federal de Santa Maria (UFSM) instacron:UFSM |
instname_str |
Universidade Federal de Santa Maria (UFSM) |
instacron_str |
UFSM |
institution |
UFSM |
reponame_str |
Repositório Institucional Manancial UFSM |
collection |
Repositório Institucional Manancial UFSM |
bitstream.url.fl_str_mv |
http://repositorio.ufsm.br/bitstream/1/15440/2/license_rdf http://repositorio.ufsm.br/bitstream/1/15440/3/license.txt http://repositorio.ufsm.br/bitstream/1/15440/1/DIS_PPGCC_2015_BRUM_ARTUR.pdf http://repositorio.ufsm.br/bitstream/1/15440/4/DIS_PPGCC_2015_BRUM_ARTUR.pdf.txt http://repositorio.ufsm.br/bitstream/1/15440/5/DIS_PPGCC_2015_BRUM_ARTUR.pdf.jpg |
bitstream.checksum.fl_str_mv |
4460e5956bc1d1639be9ae6146a50347 f8fcb28efb1c8cf0dc096bec902bf4c4 43a89d4bb200cb5b6bdd0aeccb37f901 68e2a4999532edcaa15c0cdcfa55c2a1 8c202b3959ed42b45cb062fe96c21817 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional Manancial UFSM - Universidade Federal de Santa Maria (UFSM) |
repository.mail.fl_str_mv |
ouvidoria@ufsm.br |
_version_ |
1808854698058317824 |