An Application of the MTZ method to the solution of the Travelman Salesman Problem


Authors

DOI:

https://doi.org/10.22517/23447214.12751

Keywords:

Heuristic, TSP

Abstract

The Traveling Salesman Problem is an optimization problem that consists in finding the minimum path of a tour of n cities, departing from the city of origin or zero node, running the n cities and returning to the point of origin or zero node in the next article a solution for the traveling salesman problem is exposed using an exact heuristic called "method MTZ" wich will be solved using some of its optimization libraries.

Downloads

Download data is not yet available.

Author Biographies

Jairo Alberto Villegas, Universidad Tecnológica de Pereira

Jairo Alberto Villegas Flórez

Docente Catedra Asistente

Facultad de Ingeniería Industrial

Carlos Julio Zapata Grisales, Universidad Tecnológica de Pereira

Ingeniero Electricista

Gustavo Gatica, Universidad Andrés Bello

Ingeniero en Computación

Downloads

Published

2017-12-30

How to Cite

Villegas, J. A., Zapata Grisales, C. J., & Gatica, G. (2017). An Application of the MTZ method to the solution of the Travelman Salesman Problem. Scientia Et Technica, 22(4), 341–344. https://doi.org/10.22517/23447214.12751

Issue

Section

Industrial