Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
A set of sequencing heuristic and the computer code for the TSP.
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 ef...
Saved in:
| Format: | Conference Proceeding |
|---|---|
| Published: |
1999
|
| Tags: |
No Tags, Be the first to tag this record!
|