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

Trabajos de Investigación Operativa (1988)

- Volume: 3, Issue: 1, page 117-140
- ISSN: 0213-8204

## Access Full Article

top## Abstract

top## How to cite

topEscudero, Laureano F.. "On improving a solution to the ATSP with fixed origin and precedence relationships.." Trabajos de Investigación Operativa 3.1 (1988): 117-140. <http://eudml.org/doc/40589>.

@article{Escudero1988,

abstract = {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.},

author = {Escudero, Laureano F.},

journal = {Trabajos de Investigación Operativa},

keywords = {Problema del viajante; Algoritmos; Optimización; directed graph; permutation; precedence relation; local search; asymmetric travelling salesman; manufacturing},

language = {eng},

number = {1},

pages = {117-140},

title = {On improving a solution to the ATSP with fixed origin and precedence relationships.},

url = {http://eudml.org/doc/40589},

volume = {3},

year = {1988},

}

TY - JOUR

AU - Escudero, Laureano F.

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

JO - Trabajos de Investigación Operativa

PY - 1988

VL - 3

IS - 1

SP - 117

EP - 140

AB - 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.

LA - eng

KW - Problema del viajante; Algoritmos; Optimización; directed graph; permutation; precedence relation; local search; asymmetric travelling salesman; manufacturing

UR - http://eudml.org/doc/40589

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.