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.
@article{urn:eudml:doc:40589,
title = {On improving a solution to the ATSP with fixed origin and precedence relationships.},
journal = {Trabajos de Investigaci\'on Operativa},
volume = {3},
year = {1988},
pages = {117-140},
zbl = {0656.90067},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:40589}
}
Escudero, Laureano F. On improving a solution to the ATSP with fixed origin and precedence relationships.. Trabajos de Investigación Operativa, Tome 3 (1988) pp. 117-140. http://gdmltest.u-ga.fr/item/urn:eudml:doc:40589/