D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm

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...

Full description

Bibliographic Details
Main Authors: Poria Pirozmand, Ali Asghar Rahmani Hosseinabadi, Maedeh Jabbari Chari, Faezeh Pahlavan, Seyedsaeid Mirkamali, Gerhard-Wilhelm Weber, Summera Nosheen, Ajith Abraham
Format: Article
Language:English
Published: IEEE 2023-01-01
Series:IEEE Access
Subjects:
Symmetric TSP
optimization
operational research
discrete pathfinder algorithm
population-based metaheuristic
Online Access:https://ieeexplore.ieee.org/document/10268392/

Internet

https://ieeexplore.ieee.org/document/10268392/

Similar Items