A carregar...
Publicação
A hybrid approach GABC-LS to solve mTSP
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 416.2 KB | Adobe PDF |
Orientador(es)
Resumo(s)
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.
Descrição
Palavras-chave
Multiple traveling salesman problem Genetic algorithm Artificial bee colony Local search
Contexto Educativo
Citação
Pereira, Sílvia de Castro; Pires, Eduardo J. Solteiro; Oliveira, Paulo B. de Moura (2022). A hybrid approach GABC-LS to solve mTSP. In International Conference on Optimization, Learning Algorithms and Applications OL2A. p. 1-13. ISBN 978-3-031-23236-7
Editora
Springer