Aplicação da técnica de recozimento simulado em problemas de planejamento florestal multiobjetivo

Detalhes bibliográficos
Ano de defesa: 2004
Autor(a) principal: Gustavo Willam Pereira
Orientador(a): Não Informado pela instituição
Banca de defesa: Não Informado pela instituição
Tipo de documento: Dissertação
Tipo de acesso: Acesso aberto
Idioma: por
Instituição de defesa: Universidade Federal de Minas Gerais
Programa de Pós-Graduação: Não Informado pela instituição
Departamento: Não Informado pela instituição
País: Não Informado pela instituição
Palavras-chave em Português:
Link de acesso: https://hdl.handle.net/1843/SLBS-642QH6
Resumo: This study has as objective to discuss the Simulated Annealing's applicability in the solution of problems of planning forest under multiple objectives. Therefore, an optimization model is proposed under multiple objectives and implemented an algorithm for the solution of the model, PSA (Pareto Simulated Annealing), a variation of Simulated Annealing simple objective, for the solution heuristic of the model under the vision of multiple objectives. Later on, various tests were deed with the algorithm in problems of several loads to measure its efficiency and its efficacyand compared the results with the CPLEX, a software that uses an exact algorithm for the solution of problems of Programming Integer 0-1, and with the algorithm SPEA implemented by Teixeira (2002), that uses the metaheurístic Genetics Algorithms for the solution of the same problem. In terms of efficacy between SPEA and PSA can be affirmed that the two were equivalent for problems of small load; the efficiency of PSA, in relation to SPEA, was superior. For problems of medium to great load SPEA was not able to solve probably for loss of memory of the system, while PSA showed a good performance. In a competitive environment where the taking of decision should be made with agility, PSA showed interesting in spite of not being an exact algorithm, it obtained an approximation of 99,68%, in a worthless time when compared withCPLEX. It is concluded by the applicability and for the efficiency of the metaheurístic Simulated Annealing in the solution of problems of planning forest under multiple objectives and, therefore, for the applicability of PSA, in particular, as a good alternative for the treatment of these problems. Its performance showed satisfactory and very good in relation of the algorithms evolutionary, in particular SPEA, on theproblem-test group, where several parameters were defined through of real data associated with a company of the forest area.
id UFMG_88cf6ce6fb97a2cd15d2d2ff4335865b
oai_identifier_str oai:repositorio.ufmg.br:1843/SLBS-642QH6
network_acronym_str UFMG
network_name_str Repositório Institucional da UFMG
repository_id_str
spelling 2019-08-11T02:57:13Z2025-09-09T01:27:59Z2019-08-11T02:57:13Z2004-03-26https://hdl.handle.net/1843/SLBS-642QH6This study has as objective to discuss the Simulated Annealing's applicability in the solution of problems of planning forest under multiple objectives. Therefore, an optimization model is proposed under multiple objectives and implemented an algorithm for the solution of the model, PSA (Pareto Simulated Annealing), a variation of Simulated Annealing simple objective, for the solution heuristic of the model under the vision of multiple objectives. Later on, various tests were deed with the algorithm in problems of several loads to measure its efficiency and its efficacyand compared the results with the CPLEX, a software that uses an exact algorithm for the solution of problems of Programming Integer 0-1, and with the algorithm SPEA implemented by Teixeira (2002), that uses the metaheurístic Genetics Algorithms for the solution of the same problem. In terms of efficacy between SPEA and PSA can be affirmed that the two were equivalent for problems of small load; the efficiency of PSA, in relation to SPEA, was superior. For problems of medium to great load SPEA was not able to solve probably for loss of memory of the system, while PSA showed a good performance. In a competitive environment where the taking of decision should be made with agility, PSA showed interesting in spite of not being an exact algorithm, it obtained an approximation of 99,68%, in a worthless time when compared withCPLEX. It is concluded by the applicability and for the efficiency of the metaheurístic Simulated Annealing in the solution of problems of planning forest under multiple objectives and, therefore, for the applicability of PSA, in particular, as a good alternative for the treatment of these problems. Its performance showed satisfactory and very good in relation of the algorithms evolutionary, in particular SPEA, on theproblem-test group, where several parameters were defined through of real data associated with a company of the forest area.Universidade Federal de Minas GeraisPlanejamento florestalMultiobjetivoOtimização combinatóriaAlgoritmos de computadorComputaçãoAplicação da técnica de recozimento simulado em problemas de planejamento florestal multiobjetivoinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisGustavo Willam Pereirainfo:eu-repo/semantics/openAccessporreponame:Repositório Institucional da UFMGinstname:Universidade Federal de Minas Gerais (UFMG)instacron:UFMGHeleno do Nascimento SantosGeraldo Robson MateusFlávio Lopes RodriguesEste estudo tem como objetivo discutir a aplicabilidade do Simulated Annealing na solução de problemas de planejamento florestal multiobjetivo. Para tanto, é proposto um modelo de otimização sob critérios múltiplos e implementado um algoritmo para a solução do modelo, o PSA (Pareto Simulated Annealing), uma variação do Simulated Annealing uniobjetivo, para a solução heurística do modelo sob a visão multiobjetivo. Posteriormente, foram realizados vários testes com o algoritmo em problemas de diversos portes para medir a eficiência e a eficácia e os resultados foram comparados com o CPLEX, um software que utiliza um algoritmo exato branch-and-bound para a solução de problemas de Programação Inteira 0-1, e com o algoritmo SPEA implementado por Teixeira (2002), que utiliza a metaheurística Algoritmos Genéticos para a solução do mesmo problema. Em termos de eficácia entre o SPEA e o PSA pode-se afirmar que os dois foram equivalentes para problemas de pequeno porte; a eficiência do PSA, em relação ao SPEA, mostrou-se superior. Para problemas de médio a grande porte o SPEA não foi capaz de resolver provavelmente por falta de memória do sistema, enquanto que o PSA mostrou uma escalabilidade muito boa. Em um ambiente competitivo onde a tomada de decisão deve ser feita com agilidade, o PSA mostrou-se interessante, e apesar de não ser um algoritmo exato, conseguiu uma aproximação de 99,68%, em um tempo menor quando comparado com o CPLEX. Conclui-se pela aplicabilidade e pela eficiência da metaheurística Simulated Annealing na solução de problemas de planejamento florestal multiobjetivo e, portanto, pela aplicabilidade do PSA, em particular, como uma boa alternativa para o tratamento destes problemas. Seu desempenho mostrou-se satisfatório e bem superior aos algoritmos evolucionários, em particular o SPEA, sobre o conjunto de problemas-teste, onde vários parâmetros foram definidos por meio de dados reais associados à uma empresa da área florestal.UFMGORIGINALgustavowilliampereira.pdfapplication/pdf612904https://repositorio.ufmg.br//bitstreams/8afa24e6-6de9-4a76-9ff5-953aea510c54/downloade0af7e2fe90eabd4d0a59f0886d3e7e2MD51trueAnonymousREADTEXTgustavowilliampereira.pdf.txttext/plain139361https://repositorio.ufmg.br//bitstreams/878f59d6-59f2-4a05-94ae-0ec4485cfe74/download188da3441af6e994ac00a14466736747MD52falseAnonymousREAD1843/SLBS-642QH62025-09-08 22:27:59.479open.accessoai:repositorio.ufmg.br:1843/SLBS-642QH6https://repositorio.ufmg.br/Repositório InstitucionalPUBhttps://repositorio.ufmg.br/oairepositorio@ufmg.bropendoar:2025-09-09T01:27:59Repositório Institucional da UFMG - Universidade Federal de Minas Gerais (UFMG)false
dc.title.none.fl_str_mv Aplicação da técnica de recozimento simulado em problemas de planejamento florestal multiobjetivo
title Aplicação da técnica de recozimento simulado em problemas de planejamento florestal multiobjetivo
spellingShingle Aplicação da técnica de recozimento simulado em problemas de planejamento florestal multiobjetivo
Gustavo Willam Pereira
Otimização combinatória
Algoritmos de computador
Computação
Planejamento florestal
Multiobjetivo
title_short Aplicação da técnica de recozimento simulado em problemas de planejamento florestal multiobjetivo
title_full Aplicação da técnica de recozimento simulado em problemas de planejamento florestal multiobjetivo
title_fullStr Aplicação da técnica de recozimento simulado em problemas de planejamento florestal multiobjetivo
title_full_unstemmed Aplicação da técnica de recozimento simulado em problemas de planejamento florestal multiobjetivo
title_sort Aplicação da técnica de recozimento simulado em problemas de planejamento florestal multiobjetivo
author Gustavo Willam Pereira
author_facet Gustavo Willam Pereira
author_role author
dc.contributor.author.fl_str_mv Gustavo Willam Pereira
dc.subject.por.fl_str_mv Otimização combinatória
Algoritmos de computador
Computação
topic Otimização combinatória
Algoritmos de computador
Computação
Planejamento florestal
Multiobjetivo
dc.subject.other.none.fl_str_mv Planejamento florestal
Multiobjetivo
description This study has as objective to discuss the Simulated Annealing's applicability in the solution of problems of planning forest under multiple objectives. Therefore, an optimization model is proposed under multiple objectives and implemented an algorithm for the solution of the model, PSA (Pareto Simulated Annealing), a variation of Simulated Annealing simple objective, for the solution heuristic of the model under the vision of multiple objectives. Later on, various tests were deed with the algorithm in problems of several loads to measure its efficiency and its efficacyand compared the results with the CPLEX, a software that uses an exact algorithm for the solution of problems of Programming Integer 0-1, and with the algorithm SPEA implemented by Teixeira (2002), that uses the metaheurístic Genetics Algorithms for the solution of the same problem. In terms of efficacy between SPEA and PSA can be affirmed that the two were equivalent for problems of small load; the efficiency of PSA, in relation to SPEA, was superior. For problems of medium to great load SPEA was not able to solve probably for loss of memory of the system, while PSA showed a good performance. In a competitive environment where the taking of decision should be made with agility, PSA showed interesting in spite of not being an exact algorithm, it obtained an approximation of 99,68%, in a worthless time when compared withCPLEX. It is concluded by the applicability and for the efficiency of the metaheurístic Simulated Annealing in the solution of problems of planning forest under multiple objectives and, therefore, for the applicability of PSA, in particular, as a good alternative for the treatment of these problems. Its performance showed satisfactory and very good in relation of the algorithms evolutionary, in particular SPEA, on theproblem-test group, where several parameters were defined through of real data associated with a company of the forest area.
publishDate 2004
dc.date.issued.fl_str_mv 2004-03-26
dc.date.accessioned.fl_str_mv 2019-08-11T02:57:13Z
2025-09-09T01:27:59Z
dc.date.available.fl_str_mv 2019-08-11T02:57:13Z
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 https://hdl.handle.net/1843/SLBS-642QH6
url https://hdl.handle.net/1843/SLBS-642QH6
dc.language.iso.fl_str_mv por
language por
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Universidade Federal de Minas Gerais
publisher.none.fl_str_mv Universidade Federal de Minas Gerais
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFMG
instname:Universidade Federal de Minas Gerais (UFMG)
instacron:UFMG
instname_str Universidade Federal de Minas Gerais (UFMG)
instacron_str UFMG
institution UFMG
reponame_str Repositório Institucional da UFMG
collection Repositório Institucional da UFMG
bitstream.url.fl_str_mv https://repositorio.ufmg.br//bitstreams/8afa24e6-6de9-4a76-9ff5-953aea510c54/download
https://repositorio.ufmg.br//bitstreams/878f59d6-59f2-4a05-94ae-0ec4485cfe74/download
bitstream.checksum.fl_str_mv e0af7e2fe90eabd4d0a59f0886d3e7e2
188da3441af6e994ac00a14466736747
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFMG - Universidade Federal de Minas Gerais (UFMG)
repository.mail.fl_str_mv repositorio@ufmg.br
_version_ 1862106046525341696