Travelling salesman problem (TSP) is a prominent computational problem where trail technique is used to calculate all the possible travel and choose the best one. Since there is …
M Agrawal, V Jain - 2020 Second International Conference on …, 2020 - ieeexplore.ieee.org
Travelling Salesman Problem is a very popular problem in graph theory and it is applicable to solve many problems of science and engineering. It has its applications in electronics …
A Kumar - 2020 4th International Conference on Intelligent …, 2020 - ieeexplore.ieee.org
Genetic Algorithms are the best solution to solve NP-Hard problem. Travelling Salesman Problem (TSP) is one of them which can be solved by GA. TSP Algorithm takes more time to …
R Liu, Y Wang - 2019 IEEE/ACIS 18th International Conference …, 2019 - ieeexplore.ieee.org
Genetic algorithm has been widely used in many fields because of its good global search capability. In this paper, we mainly introduce the research on Traveling Salesman Problem …
I Muhandhis, M Shubhan, HI Dani… - Jurnal Teknologi dan …, 2023 - ejurnal.itats.ac.id
This research aims to make it easier for the campus marketing team to determine the minimum route when visiting several schools in one day. We develop an optimum route …
AT Al-Taani, HS Majdalawi… - 2023 24th International …, 2023 - ieeexplore.ieee.org
Multiple travelling salesman problem (MTSP) is considered as one of the common critical problems in the operational research area to find a solution for many complex issues. In this …
The travelling salesman problem (TSP) is one of the oldest and most common problems that should be optimized using one of the optimization algorithms to make the salesman's travel …