Publicação
A hybrid approach GABC-LS to solve mTSP
| Resumo: | The Multiple Traveling Salesman Problem (mTSP) is an interesting combinatorial optimization problem due to its numerous real-life applications. It is a problem where m salesmen visit a set of n cities so that each city is visited once. The primary purpose is to minimize the total distance traveled by all salesmen. This paper presents a hybrid approach called GABC-LS that combines an evolutionary algorithm with the swarm intelligence optimization ideas and a local search method. The proposed approach was tested on two instances and produced some better results than the best-known solutions reported in the literature. |
|---|---|
| Autores principais: | Pereira, Sílvia de Castro |
| Outros Autores: | Pires, Eduardo J. Solteiro; Oliveira, Paulo B. de Moura |
| Assunto: | Multiple traveling salesman problem Genetic algorithm Artificial bee colony Local search |
| Ano: | 2022 |
| País: | Portugal |
| Tipo de documento: | comunicação em conferência |
| Tipo de acesso: | acesso restrito |
| Instituição associada: | Instituto Politécnico de Bragança |
| Idioma: | inglês |
| Origem: | Biblioteca Digital do IPB |
| Resumo: | The Multiple Traveling Salesman Problem (mTSP) is an interesting combinatorial optimization problem due to its numerous real-life applications. It is a problem where m salesmen visit a set of n cities so that each city is visited once. The primary purpose is to minimize the total distance traveled by all salesmen. This paper presents a hybrid approach called GABC-LS that combines an evolutionary algorithm with the swarm intelligence optimization ideas and a local search method. The proposed approach was tested on two instances and produced some better results than the best-known solutions reported in the literature. |
|---|