Please use this identifier to cite or link to this item:
|Title:||A set of sequencing heuristic and the computer code for the TSP.|
|Authors:||Charles-Owaba, O. E.|
Oladokun, V. O.
|Abstract:||This paper proposes a set sequencing heuristic solution for the travelling salesman problem (TSP). It attempts to first select, preferably a set of M smallest elements of the TSP matrix and then form a sequence. A computer code of the procedure was developed in Fortran 77 and used to examine its efficiency and relative effectiveness. It was found to be as effective as, but more efficient than the best of the nearest neighbour heuristics.|
|Appears in Collections:||scholarly works|
Files in This Item:
|(1)ui_inpro_charles-owaba_set_1999.pdf||1.77 MB||Adobe PDF|
Items in UISpace are protected by copyright, with all rights reserved, unless otherwise indicated.