An ALNS metaheuristic for the family multiple traveling salesman problem (2024)
Fonte: Computers & operations research. Unidade: EP
Assuntos: COMÉRCIO ELETRÔNICO, LOGÍSTICA, OTIMIZAÇÃO COMBINATÓRIA, HEURÍSTICA, ALGORITMOS
ABNT
CUNHA, Cláudio Barbieri da et al. An ALNS metaheuristic for the family multiple traveling salesman problem. Computers & operations research, v. 169, p. Se 2024, 2024Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2024.106750. Acesso em: 09 nov. 2025.APA
Cunha, C. B. da, Massarotto, D. F., Fornazza, S. L., & Mendes, A. B. (2024). An ALNS metaheuristic for the family multiple traveling salesman problem. Computers & operations research, 169, Se 2024. doi:10.1016/j.cor.2024.106750NLM
Cunha CB da, Massarotto DF, Fornazza SL, Mendes AB. An ALNS metaheuristic for the family multiple traveling salesman problem [Internet]. Computers & operations research. 2024 ; 169 Se 2024.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2024.106750Vancouver
Cunha CB da, Massarotto DF, Fornazza SL, Mendes AB. An ALNS metaheuristic for the family multiple traveling salesman problem [Internet]. Computers & operations research. 2024 ; 169 Se 2024.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2024.106750
