The generalized traveling salesman problem (GTSP) is an extension of the classical
traveling salesman problem (TSP) and it is among the most researched combinatorial …

Abstract Ant Colony Optimization (ACO) algorithm is one of the effective solutions to solve
the problem of combination optimization like traveling salesman problem (TSP) which …

This paper addresses a multirobot scheduling problem in which autonomous unmanned
aerial vehicles (UAVs) must be recharged during a long-term mission. The proposal is to …

Metaheuristics are often used to find solutions to real and complex problems. These
algorithms can solve optimization problems and provide solutions close to the global …

The Lin–Kernighan heuristic is known to be one of the most successful heuristics for the
Traveling Salesman Problem (TSP). It has also proven its efficiency in application to some …

This paper presents an adaptation of the flying ant colony optimization (FACO) algorithm to
solve the traveling salesman problem (TSP). This new modification is called dynamic flying …

Given a graph G=(N, E), the covering salesman problem (CSP) is to identify the minimum
length tour “covering” all the nodes. More specifically, it seeks the minimum-length tour …

Abstract In the classical Traveling Salesman Problem, the order in which the vertices are
visited has no restrictions. The only condition imposed is that each vertex is visited only …

A novel motion planning algorithm for robotic bush trimming is presented. The algorithm is
based on an optimal route search over a graph. Differently from other works in robotic …

Recent advancements in autonomous mobile robots (AMRs), such as aerial drones, ground
vehicles, and quadrupedal robots, have significantly impacted the fields of infrastructure …