ACO-iRBA: A Hybrid Approach to TSPN with Overlapping Neighborhoods

@inproceedings{Qin2017ACOiRBAAH,
  title={ACO-iRBA: A Hybrid Approach to TSPN with Overlapping Neighborhoods},
  author={Yuanlong Qin and Bo Yuan},
  booktitle={SEAL},
  year={2017}
}
The traveling salesman problem with neighborhoods (TSPN) is a generalization of TSP and can be regarded as a combination of TSP and TPP (Touring Polygons Problem). In this paper, we propose a hybrid TSPN solution named ACO-iRBA in which the TSP and TPP tasks are tackled simultaneously by ACO (Ant Colony Optimization) and iRBA, an improved version of RBA (Rubber Band Algorithm), respectively. A major feature of ACO-iRBA is that it can properly handle situations where the neighborhoods are… 

References

SHOWING 1-10 OF 21 REFERENCES

Constricting Insertion Heuristic for Traveling Salesman Problem with Neighborhoods

TLDR
This paper proposes a new method for solving Traveling Salesman Problem with Neighborhoods efficiently and compares the new method to the related approaches using existing test benchmarks from the literature.

The travelling salesman problem with neighbourhoods: MINLP solution

TLDR
This paper formulation of the travelling salesman problem with neighbourhoods is formulated as a non-convex mixed-integer nonlinear programme (MINLP) having the property that fixing all the integer variables to any integer values yield a convex non linear programme.

Algorithms for the traveling Salesman Problem with Neighborhoods involving a dubins vehicle

TLDR
Two algorithms are presented that transform this infinite dimensional combinatorial optimization problem into a finite dimensional asymmetric TSP by sampling and applying the appropriate transformations, thus allowing the use of existing approximation algorithms.

Approximation algorithms for TSP with neighborhoods in the plane

Approximation Algorithms for the Geometric Covering Salesman Problem

Ant colonies for the travelling salesman problem.

Particle swarm optimization for traveling salesman problem

TLDR
This paper has developed some special methods for solving TSP using PSO and proposed the concept of swap operator and swap sequence, and redefined some operators on the basis of them, and designed a special PSO.

TSP with Neighborhoods of Varying Size

TLDR
The first polynomial-time constant-factor approximation algorithm for disjoint convex fat objects of arbitrary size is presented, and it is shown that the problem is APX-hard and cannot be approximated within a factor of 391/390 inPolynomial time, unless P = NP.

On the Optimal Robot Routing Problem in Wireless Sensor Networks

TLDR
This paper presents a novel TSPn algorithm for this class of TSPN, which can yield significantly improved results compared to the latest approximation algorithm.