The traveling salesman problem: a deterministic algorithm using tabu search

DOI10.15517/RMTA.V21I1.14142zbMATH Open1316.65112OpenAlexW1996088379MaRDI QIDQ5262622FDOQ5262622

Authors: Erasmo López, Oscar Salas, Alex Murillo 

Publication date: 16 July 2015

Published in: Revista de Matemática: Teoría y Aplicaciones (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15517/rmta.v21i1.14142

Recommendations

• Tabu search performance on the symmetric travelling salesman problem
• Travelling salesman problem tools for microcomputers
• scientific article; zbMATH DE number 795217
• A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs
• scientific article; zbMATH DE number 1051038

zbMATH Keywords

permutationtraveling salesman problemdeterministic algorithmtabu searchdiversificationfrequencies matrix

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Cited In (1)

• Title not available (Why is that?)

Uses Software

• TSPLIB
• Visual Basic

This page was built for publication: The traveling salesman problem: a deterministic algorithm using tabu search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262622)