ABSTRACT
This paper proposes a set sequencing heuristic solution for the travelling saIesman 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 neighbourhood heuristics.
Charles, O & Oladokun, V (2021). A SET SEQUENCING HEURISTIC AND THE COMPUTER CODE FOR SOLVTNG THE TSP. Afribary. Retrieved from https://afribary.com/works/a-set-sequencing-heuristic-and-the-computer-code-for-solvtng-the-tsp
Charles, O and V Oladokun "A SET SEQUENCING HEURISTIC AND THE COMPUTER CODE FOR SOLVTNG THE TSP" Afribary. Afribary, 23 Mar. 2021, https://afribary.com/works/a-set-sequencing-heuristic-and-the-computer-code-for-solvtng-the-tsp. Accessed 18 May. 2024.
Charles, O, V Oladokun . "A SET SEQUENCING HEURISTIC AND THE COMPUTER CODE FOR SOLVTNG THE TSP". Afribary, Afribary, 23 Mar. 2021. Web. 18 May. 2024. < https://afribary.com/works/a-set-sequencing-heuristic-and-the-computer-code-for-solvtng-the-tsp >.
Charles, O and Oladokun, V . "A SET SEQUENCING HEURISTIC AND THE COMPUTER CODE FOR SOLVTNG THE TSP" Afribary (2021). Accessed May 18, 2024. https://afribary.com/works/a-set-sequencing-heuristic-and-the-computer-code-for-solvtng-the-tsp