The sparrow search algorithm (SSA) tends to fall into local optima and to have insufficient
stagnation when applied to the traveling salesman problem (TSP). To address this issue, we …

In this letter, we address the multi-goal path planning problem to determine a cost-efficient
path to visit a set of three-dimensional regions. The problem is a variant of the traveling …

We consider the online search problem in which a server starting at the origin of a d-
dimensional Euclidean space has to find an arbitrary hyperplane. The best-possible …

Worst-case analysis is a performance measure that is often too pessimistic to indicate which
algorithms we should use in practice. A classical example is in the context of the Euclidean …

Given a compact $ E\subset\mathbb {R}^ n $ and $ s> 0$, the maximum distance problem
seeks a compact and connected subset of $\mathbb {R}^ n $ of smallest one dimensional …

Abstract We introduce the Observation Route Problem (ORP) defined as follows: Given a set
of n pairwise disjoint obstacles (regions) in the plane, find a shortest tour (route) such that an …

A polygon C is an intersecting polygon for a set O of objects in the plane if C intersects each
object in O, where the polygon includes its interior. We study the problem of computing the …

We study the variant of the Euclidean Traveling Salesman problem where instead of a set of
points, we are given a set of lines as input, and the goal is to find the shortest tour that visits …

Traveling salesman problem (TSP) is one of the most studied combinatorial optimization
problems; several exact, heuristic or even learning-based strategies have been proposed to …

The Traveling Salesman Problem with Neighborhoods (TSPN) is a generalization of the
classic Traveling Salesman Problem that consists of finding a minimum-length path that …