D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm
The Traveling Salesman Problem (TSP) which is a theoretical computer science and operations research problem, has several applications even in its purest formulation, such as the manufacture of microchips, planning, and logistics. There are many methods proposed in the literature to solve TSP with g...
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10268392/ |