Multi-Tour Set Traveling Salesman Problem in Planning Power Transmission Line Inspection

The On-line Asymmetric Traveling Salesman Problem

We consider two on-line versions of the asymmetric traveling salesman problem with triangle inequality. For the homing version, in which the salesman is required to return in the city where it started from, we give a 3+ √ 5 2 -competitive algorithm and prove that this is best possible. For the nomadic version, the on-line analogue of the shortest asymmetric hamiltonian path problem, we show tha...

Solving the Inspection Problem via Colored Traveling Salesman Tours

This paper describes an effective approach to solve the inspection problem via colored traveling salesman tours. Given an environment with obstacles and regions to be inspected, the approach plans a collision-free and dynamicallyfeasible motion trajectory that enables the vehicle to inspect all the regions of interest while reducing the distance traveled. A key aspect of the approach is the tra...

An Approach for Solving Traveling Salesman Problem

In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace

The integration of drones into civil airspace is one of the most challenging problems for the automation of the controlled airspace, and the optimization of the drone route is a key step for this process. In this paper, we optimize the route planning of a drone mission that consists of departing from an airport, flying over a set of mission way points and coming back to the initial airport. We ...

The traveling salesman problem