Displaying similar documents to “Optimal tour planning with specified nodes”

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

Laureano F. Escudero (1988)

Trabajos de Investigación Operativa

Similarity:

Given the directed graph G = (N, A) 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 A. 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...