scholarly journals Comparative Study on Travelling Salesman Problem

2021 ◽  
Vol 23 (07) ◽  
pp. 853-857
Author(s):  
Yatharth Srivastav ◽  
◽  
J.K. Saini ◽  
Keyword(s):  
Comparative Study ◽  
Travelling Salesman Problem ◽  
Optimization Algorithms ◽  
Minimum Cost ◽  
Optimization Techniques ◽  
Travelling Salesman

Travelling Salesman Problem (TSP) is a kind of LPP to find a minimum cost sequence in order to travel in each set of cities in a way that starting as well as ending should be on the same city and each city is visited exactly one time. In this paper, we will compare different optimization algorithms working principles, and we will also discuss the advantages and limitations of all the optimization techniques.

scholarly journals A Novel Cooperative Path Planning for Multi-robot Persistent Coverage with Obstacles and Coverage Period Constraints

Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 1994 ◽  
Author(s):  
Guibin Sun ◽  
Rui Zhou ◽  
Bin Di ◽  
Zhuoning Dong ◽  
Yingxun Wang
Keyword(s):  
Path Planning ◽  
Numerical Simulations ◽  
Obstacle Avoidance ◽  
Travelling Salesman Problem ◽  
Region Of Interest ◽  
Minimum Cost ◽  
Closed Path ◽  
Combinatorial Approach ◽  
Travelling Salesman ◽  
Multi Robot

In this paper, a multi-robot persistent coverage of the region of interest is considered, where persistent coverage and cooperative coverage are addressed simultaneously. Previous works have mainly concentrated on the paths that allow for repeated coverage, but ignored the coverage period requirements of each sub-region. In contrast, this paper presents a combinatorial approach for path planning, which aims to cover mission domains with different task periods while guaranteeing both obstacle avoidance and minimizing the number of robots used. The algorithm first deploys the sensors in the region to satisfy coverage requirements with minimum cost. Then it solves the travelling salesman problem to obtain the frame of the closed path. Finally, the approach partitions the closed path into the fewest segments under the coverage period constraints, and it generates the closed route for each robot on the basis of portioned segments of the closed path. Therefore, each robot can circumnavigate one closed route to cover the different task areas completely and persistently. The numerical simulations show that the proposed approach is feasible to implement the cooperative coverage in consideration of obstacles and coverage period constraints, and the number of robots used is also minimized.

scholarly journals Power Efficient Hierarchical Scheduling for DSP Transformations

VLSI Design ◽  
2002 ◽  
Vol 14 (2) ◽  
pp. 203-217
Author(s):  
P. K. Merakos ◽  
K. Masselos ◽  
C. E. Goutis
Keyword(s):  
Travelling Salesman Problem ◽  
Optimization Algorithms ◽  
Digital Signal ◽  
Scheduling Problem ◽  
Switching Activity ◽  
Travelling Salesman ◽  
Hierarchical Scheduling ◽  
Power Efficient ◽  
Target Architecture ◽  
Selection For

In this paper, the problem of scheduling the computation of partial products in transformational Digital Signal Processing (DSP) algorithms, aiming at the minimization of the switching activity in data and address buses, is addressed. The problem is stated as a hierarchical scheduling problem. Two different optimization algorithms, which are based on the Travelling Salesman Problem (TSP), are defined. The proposed optimization algorithms are independent on the target architecture and can be adapted to take into account it. Experimental results obtained from the application of the proposed algorithms in various widely used DSP transformations, like Discrete Cosine Transform (DCT) and Discrete Fourier Transform (DFT), show that significant switching activity savings in data and address buses can be achieved, resulting in corresponding power savings. In addition, the differences between the two proposed methods are underlined, providing envisage for their suitable selection for implementation, in particular transformational algorithms and architectures.

The Travelling Salesman Problem in symmetric circulant matrices with two stripes

2008 ◽  
Vol 18 (1) ◽  
pp. 165-175 ◽  
Author(s):  
IVAN GERACE ◽  
FEDERICO GRECO
Keyword(s):  
Computational Complexity ◽  
Lower Bound ◽  
Lower Bounds ◽  
Travelling Salesman Problem ◽  
Minimum Cost ◽  
Circulant Matrix ◽  
Upper And Lower Bounds ◽  
Circulant Matrices ◽  
Travelling Salesman ◽  
New Construction

The Symmetric Circulant Travelling Salesman Problem asks for the minimum cost tour in a symmetric circulant matrix. The computational complexity of this problem is not known – only upper and lower bounds have been determined. This paper provides a characterisation of the two-stripe case. Instances where the minimum cost of a tour is equal to either the upper or lower bound are recognised. A new construction providing a tour is proposed for the remaining instances, and this leads to a new upper bound that is closer than the previous one.

Sign in / Sign up

Export Citation Format

Share Document