Use este identificador para citar ou linkar para este item:
http://www.repositorio.ufop.br/jspui/handle/123456789/14476
Registro completo de metadados
Campo Dublin Core | Valor | Idioma |
---|---|---|
dc.contributor.author | Chagas, Jonatas Batista Costa das | - |
dc.contributor.author | Blank, Julian | - |
dc.contributor.author | Wagner, Markus | - |
dc.contributor.author | Souza, Marcone Jamilson Freitas | - |
dc.contributor.author | Deb, Kalyanmoy | - |
dc.date.accessioned | 2022-02-10T18:16:16Z | - |
dc.date.available | 2022-02-10T18:16:16Z | - |
dc.date.issued | 2020 | pt_BR |
dc.identifier.citation | CHAGAS, J. B. C. das et al. A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem. Journal of Heuristics, v. 24, p. 267-301, 2020. Disponível em: <https://link.springer.com/article/10.1007/s10732-020-09457-7>. Acesso em: 25 ago. 2021. | pt_BR |
dc.identifier.issn | 1572-9397 | - |
dc.identifier.uri | http://www.repositorio.ufop.br/jspui/handle/123456789/14476 | - |
dc.description.abstract | In this paper, we propose a method to solve a bi-objective variant of the well-studied traveling thief problem (TTP). The TTP is a multi-component problem that combines two classic combinatorial problems: traveling salesman problem and knapsack problem. We address the BI-TTP, a bi-objective version of the TTP, where the goal is to minimize the overall traveling time and to maximize the profit of the collected items. Our proposed method is based on a biased-random key genetic algorithm with customizations addressing problem-specific characteristics. We incorporate domain knowledge through a combination of near-optimal solutions of each subproblem in the initial population and use a custom repair operator to avoid the evaluation of infeasible solutions. The bi-objective aspect of the problem is addressed through an elite population extracted based on the non-dominated rank and crowding distance. Furthermore, we provide a comprehensive study showing the influence of each parameter on the performance. Finally, we discuss the results of the BI-TTP competitions at EMO-2019 and GECCO-2019 conferences where our method has won first and second places, respectively, thus proving its ability to find high-quality solutions consistently. | pt_BR |
dc.language.iso | en_US | pt_BR |
dc.rights | restrito | pt_BR |
dc.subject | Combinatorial optimization | pt_BR |
dc.subject | Multi-objective optimization | pt_BR |
dc.subject | Real-world optimization problem | pt_BR |
dc.title | A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem. | pt_BR |
dc.type | Artigo publicado em periodico | pt_BR |
dc.identifier.uri2 | https://link.springer.com/article/10.1007/s10732-020-09457-7 | pt_BR |
dc.identifier.doi | https://doi.org/10.1007/s10732-020-09457-7 | pt_BR |
Aparece nas coleções: | DECOM - Artigos publicados em periódicos |
Arquivos associados a este item:
Arquivo | Descrição | Tamanho | Formato | |
---|---|---|---|---|
ARTIGO_NonDominatedSorting.pdf Restricted Access | 1,4 MB | Adobe PDF | Visualizar/Abrir |
Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.