Matches in SemOpenAlex for { <https://semopenalex.org/work/W4387197237> ?p ?o ?g. }
- W4387197237 endingPage "106566" @default.
- W4387197237 startingPage "106544" @default.
- W4387197237 abstract "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 gains and losses. We propose a discrete metaheuristic method called D-PFA to solve this problem more efficiently. Initially, the Pathfinder Algorithm (PFA) was presented to handle issues involving continuous optimization, where it worked effectively. In recent years, there have been various published variants of PFA, and it has been frequently employed to address engineering challenges. In this study, the original PFA algorithm is broken into four sub-algorithms and every sub-algorithm is discretized and coupled to form a new algorithm. The proposed algorithm has a high degree of flexibility, a quick response time, strong exploration and exploitation. To validate the significant advantages of the proposed D-PFA, 34 different instances with different sizes are used in simulation results. The proposed method was also compared with 12 State-of-the-Art algorithms. Results indicate that the suggested approach is more competitive and resilient in solving TSP than other algorithms in different aspects. A conclusion and an outlook on future studies and applications are given at the end of the paper." @default.
- W4387197237 created "2023-09-30" @default.
- W4387197237 creator A5001726949 @default.
- W4387197237 creator A5005001256 @default.
- W4387197237 creator A5053168995 @default.
- W4387197237 creator A5057742137 @default.
- W4387197237 creator A5070641581 @default.
- W4387197237 creator A5084304385 @default.
- W4387197237 creator A5087542455 @default.
- W4387197237 creator A5092971425 @default.
- W4387197237 date "2023-01-01" @default.
- W4387197237 modified "2023-10-13" @default.
- W4387197237 title "D-PFA: A Discrete Metaheuristic Method For Solving Traveling Salesman Problem Using Pathfinder Algorithm" @default.
- W4387197237 cites W1648376981 @default.
- W4387197237 cites W1968594877 @default.
- W4387197237 cites W1999525576 @default.
- W4387197237 cites W2003718423 @default.
- W4387197237 cites W2004969812 @default.
- W4387197237 cites W2032982318 @default.
- W4387197237 cites W2039069560 @default.
- W4387197237 cites W2061438946 @default.
- W4387197237 cites W2074195549 @default.
- W4387197237 cites W2091437223 @default.
- W4387197237 cites W2091638274 @default.
- W4387197237 cites W2119233436 @default.
- W4387197237 cites W2165142526 @default.
- W4387197237 cites W2213244149 @default.
- W4387197237 cites W2239574596 @default.
- W4387197237 cites W2527653733 @default.
- W4387197237 cites W2564185836 @default.
- W4387197237 cites W2583603977 @default.
- W4387197237 cites W2593517983 @default.
- W4387197237 cites W2623214827 @default.
- W4387197237 cites W2701355419 @default.
- W4387197237 cites W2734835295 @default.
- W4387197237 cites W2746348292 @default.
- W4387197237 cites W2748032639 @default.
- W4387197237 cites W2754370586 @default.
- W4387197237 cites W2796372273 @default.
- W4387197237 cites W2801036921 @default.
- W4387197237 cites W2802476378 @default.
- W4387197237 cites W2803452670 @default.
- W4387197237 cites W2910903121 @default.
- W4387197237 cites W2912155195 @default.
- W4387197237 cites W2919805933 @default.
- W4387197237 cites W2921200099 @default.
- W4387197237 cites W2921893399 @default.
- W4387197237 cites W2939101141 @default.
- W4387197237 cites W2963103847 @default.
- W4387197237 cites W2978084563 @default.
- W4387197237 cites W2983435741 @default.
- W4387197237 cites W2991534645 @default.
- W4387197237 cites W2994356841 @default.
- W4387197237 cites W3006956408 @default.
- W4387197237 cites W3015120250 @default.
- W4387197237 cites W3016252250 @default.
- W4387197237 cites W3016616254 @default.
- W4387197237 cites W3030134631 @default.
- W4387197237 cites W3088853939 @default.
- W4387197237 cites W3096920982 @default.
- W4387197237 cites W3103176522 @default.
- W4387197237 cites W3120176251 @default.
- W4387197237 cites W3125942591 @default.
- W4387197237 cites W3128926298 @default.
- W4387197237 cites W3134031301 @default.
- W4387197237 cites W3139531072 @default.
- W4387197237 cites W3139666781 @default.
- W4387197237 cites W3155999555 @default.
- W4387197237 cites W3157250556 @default.
- W4387197237 cites W3157599146 @default.
- W4387197237 cites W3166116884 @default.
- W4387197237 cites W3169868693 @default.
- W4387197237 cites W3194414553 @default.
- W4387197237 cites W3203933566 @default.
- W4387197237 cites W3204426246 @default.
- W4387197237 cites W3213107765 @default.
- W4387197237 cites W4207008679 @default.
- W4387197237 cites W4214849974 @default.
- W4387197237 cites W4221056794 @default.
- W4387197237 cites W4224909966 @default.
- W4387197237 cites W4280523160 @default.
- W4387197237 cites W4294351658 @default.
- W4387197237 cites W4302363622 @default.
- W4387197237 cites W4312399522 @default.
- W4387197237 cites W4313596935 @default.
- W4387197237 cites W4321248138 @default.
- W4387197237 doi "https://doi.org/10.1109/access.2023.3320562" @default.
- W4387197237 hasPublicationYear "2023" @default.
- W4387197237 type Work @default.
- W4387197237 citedByCount "0" @default.
- W4387197237 crossrefType "journal-article" @default.
- W4387197237 hasAuthorship W4387197237A5001726949 @default.
- W4387197237 hasAuthorship W4387197237A5005001256 @default.
- W4387197237 hasAuthorship W4387197237A5053168995 @default.
- W4387197237 hasAuthorship W4387197237A5057742137 @default.
- W4387197237 hasAuthorship W4387197237A5070641581 @default.
- W4387197237 hasAuthorship W4387197237A5084304385 @default.
- W4387197237 hasAuthorship W4387197237A5087542455 @default.