Parallel hybrid metaheuristics for path planning without manual data-point tuning


Akay R., Yıldırım M. Y.

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, cilt.29, sa.16, 2026 (SCI-Expanded, Scopus)

Özet

Interpolation-based path planning is a popular problem and requires a specific number of data points for curve or line fitting. These points directly affect the solution quality, and it can be argued that determining the optimal number of data points is important. In this paper, a parallel hybrid improved sine cosine-tabu search algorithm (PHISCTS) is proposed, which searches in parallel on a candidate set with different numbers of data points and outputs the number of data points with the shortest path length and its corresponding path. This method combines the strengths of an improved sine cosine algorithm (ISCA) and tabu search (TS). In this method, a hybrid structure was designed in which ISCA and TS algorithms run sequentially. Then, this structure was configured to run in parallel with different numbers of data points on multiple cores. The proposed algorithm was first tested on CEC2015 and CEC2022 benchmark functions and showed superior performance compared to other algorithms. Secondly, it was tested on the path planning problem by designing environments with different difficulty levels. Path planning results demonstrate that the proposed PHISCTS algorithm provides a 2.97% to 265% performance advantage in path planning while delivering a 18% to 68% reduction in running time compared to other algorithms. This research highlights the role of hybrid and adaptive methods in advancing optimization techniques for mobile robot path planning applications.