Optimality Conditions to the Acyclic Travelling Salesman Problem

This paper views an optimal solution (tour) of the n-station acyclic Travelling Selesman problem as consisting of n−1 elements of the distance matrix. Considering lower bound for elements a theoretical basis for identifying and eliminating non-optimal elements was suggested. This concept of element elimination was then used to define optimality conditions. Finally, an iterative algorithm which converges at the optimal sequence, was proposed and applied to some numerical examples.

[1]  R. Bland,et al.  Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation , 1989 .

[2]  M. Padberg,et al.  Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[3]  J. Pekny,et al.  Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem , 1989 .

[4]  S. Chatterjee,et al.  Genetic algorithms and traveling salesman problems , 1996 .

[5]  F. J. Arcelus,et al.  On n/1/F setup dependent problems , 1983 .

[6]  Chryssi Malandraki,et al.  A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem , 1996 .

[7]  J. G. Wager,et al.  Set-up times in cyclic and acyclic Group Technology Scheduling systems , 1983 .

[8]  J. William Gavett,et al.  Three Heuristic Rules for Sequencing Jobs to a Single Production Facility , 1965 .

[9]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[10]  Reha Uzsoy,et al.  Minimizing total completion time on a batch processing machine with job families , 1993, Oper. Res. Lett..

[11]  E. Kastenbauer,et al.  Genotoxicity of Nitroso Compounds and Sodium Dichromate in a Model Combining Organ Cultures of Human Nasal Epithelia and the Comet Assay , 2001, ORL.

[12]  King-Tim Mak,et al.  A modified Lin-Kernighan traveling-salesman heuristic , 1993, Oper. Res. Lett..

[13]  Richard C. Wilson,et al.  Sequence dependent set-up times and job sequencing , 1977 .

[14]  Erik Demeulemeester,et al.  Modelling setup times, process batches and transfer batches using activity network logic , 1996 .