A Labelling Method for the Travelling Salesman Problem
The travelling salesman problem (TSP) is a problem whereby a finite number of nodes are supposed to be visited exactly once, one after the other, in such a way that the total weight of connecting arcs used to visit these nodes is minimized. We propose a labelling method to solve the TSP problem. The...
Main Authors: | Trust Tawanda, Philimon Nyamugure, Santosh Kumar, Elias Munapo |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-05-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/13/11/6417 |
Similar Items
-
An analysis of several heuristics for the traveling salesman problems /
by: 428771 Rosenkrants, Daniel J., et al. -
Solving the clustered traveling salesman problem via traveling salesman problem methods
by: Yongliang Lu, et al.
Published: (2022-06-01) -
Study on genetic algorithm and heuristic method for solving traveling salesman problem /
by: 443801 Sze, San Nah
Published: (2004) -
Genetic algorithm to the bi-objective multiple travelling salesman problem
by: Shayathri Linganathan, et al.
Published: (2024-03-01) -
The traveling salesman problem : a computational study /
by: Applegate, David L.
Published: (2007)