On improving a solution to the ATSP with fixed origin and precedence relationships.

Título inglés	On improving a solution to the ATSP with fixed origin and precedence relationships.
Título español	Mejorando una solución del problema del viajante asimétrico con origen fijo y relaciones de precedencia.
Autor/es	Escudero, Laureano F.
Organización	Cent. Invest. UAM-IBM, Madrid, España;IBM-GMTC, Sindelfingen, Repúb. Fed. Alemana
Revista	0213-8204
Publicación	1988, 3 (1): 117-140, 9 Ref.
Tipo de documento	articulo
Idioma	Inglés
Resumen inglés	Given the directed graph G1 = (N, A1) with a node origin and a penalty matrix C, the ATSP with fixed origin and precedence relationships (hereafter, ASTP-PR) consists of finding the permutation of the nodes from the set N, such that it minimizes a matrix C based function and does not violate the precedence relationships given by the set A1. In this work we present an algorithm for improving a given feasible solution to the problem, by performing a local search that uses 3- and 4-change based procedures. Computational results on a broad set of cases is reported.
Clasificación UNESCO	120707
Palabras clave español	Problema del viajante ; Algoritmos ; Optimización
Código Z-Math	Zbl 0656.90067
Acceso al artículo completo