Filters








6,993 Hits in 6.2 sec

A time- and space-optimal algorithm for the many-visits TSP [article]

André Berger, László Kozma, Matthias Mnich, Roland Vincze
2020 arXiv   pre-print
The many-visits traveling salesperson problem (MV-TSP) asks for an optimal tour of n cities that visits each city c a prescribed number k_c of times.  ...  The fastest known algorithm for MV-TSP is due to Cosmadakis and Papadimitriou (SICOMP, 1984). It runs in time n^O(n) + O(n^3 log∑_c k_c ) and requires n^Θ(n) space.  ...  IMPROVED ALGORITHMS FOR THE MANY-VISITS TSP In this section we describe and analyse our three algorithms.  ... 
arXiv:1804.06361v4 fatcat:suzfha7a6naafbnv2njlqmb4wm

A time- and space-optimal algorithm for the many-visits TSP [chapter]

André Berger, László Kozma, Matthias Mnich, Roland Vincze
2019 Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms  
The many-visits traveling salesperson problem (MV-TSP) asks for an optimal tour of n cities that visits each city c a prescribed number kc of times.  ...  The fastest known algorithm for MV-TSP is due to Cosmadakis and Papadimitriou (SICOMP, 1984). It runs in time n O(n) + O(n 3 log c kc) and requires n O(n) space.  ...  Discussion We described three new algorithms for the many-visits TSP problem.  ... 
doi:10.1137/1.9781611975482.106 dblp:conf/soda/Berger0MV19 fatcat:l4zfmgnvizckflp5dcornzas7u

RoboTSP - A Fast Solution to the Robotic Task Sequencing Problem [article]

Francisco Suárez-Ruiz, Teguh Santoso Lembono, Quang-Cuong Pham
2017 arXiv   pre-print
This travel time is in turn greatly affected by the order of visit of the targets, and by the robot configurations used to reach each target.  ...  First, we propose a fast, near-optimal, algorithm to solve RTSP.  ...  ACKNOWLEDGMENT This work was supported in part by NTUitive Gap Fund NGF-2016-01-028 and SMART Innovation Grant NG000074-ENG.  ... 
arXiv:1709.09343v2 fatcat:dqrw7xp5nzb5jfd7zjzv4uhpte

Travelling Salesman Problem in Uncertain Environments

Ma Huiru, Jia Limin, Zhang Xingchen, Miao Jianrui, Sun Jiandong
2015 Open Cybernetics and Systemics Journal  
This paper introduces uncertainty theory into travelling salesman problem (TSP), in which the link travel times are assumed to be uncertain variables, and then a chance constrained programming model is  ...  Finally, a numerical example is given, the result of which verifies the effectiveness of the proposed chance constrained programming model and the algorithm.  ...  For example, the travel time cannot be expressed as an exact value in many cases.  ... 
doi:10.2174/1874110x01509010313 fatcat:zd7h2m3uafgxlekg4x7fbbgwhm

On the minimum latency problem [article]

Avrim Blum, Prasad Chalasani, Don Coppersmith, Bill Pulleyblank, Prabhakar Raghavan, Madhu Sudan
1994 arXiv   pre-print
We give exact and approximate solutions to a number of cases, including a constant-factor approximation algorithm whenever the distance matrix satisfies the triangle inequality.  ...  We wish to construct a tour that minimizes ∑_i=1^n ℓ(i), where ℓ(i) is the latency of p_i, defined to be the distance traveled before first visiting p_i.  ...  In 9] and 5] exponential time algorithms are provided to compute the MLT optimally in general metric spaces.  ... 
arXiv:math/9409223v1 fatcat:6gqfez5nsvgoxjclsj5daje6fa

Reduced Complexity Divide and Conquer Algorithm for Large Scale TSPs

Hoda A., Ihab Talkhan
2014 International Journal of Advanced Computer Science and Applications  
In this paper, we present the idea of utilizing a spatial "geographical" Divide and Conquer technique in conjunction with heuristic TSP algorithms specifically the Nearest Neighbor 2-opt algorithm.  ...  Many heuristic methods have been devised to reach "good" solutions in reasonable time.  ...  Modern methods can find solutions for extremely large problems within a reasonable time and which are quite close to the optimal solution. There are many types of Heuristic TSPs in the literature.  ... 
doi:10.14569/ijacsa.2014.050110 fatcat:eowvrlw3pjapnpvm5ny4txar6q

The minimum latency problem

Avrim Blum, Prasad Chalasani, Don Coppersmith, Bill Pulleyblank, Prabhakar Raghavan, Madhu Sudan
1994 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94  
In [9] and [5] exponential time algorithms are provided to compute the MLT optimally in general met- ric spaces.  ...  Minieka also gives an exponential time algorithm for solv- ing the problem optimally on general trees.  ... 
doi:10.1145/195058.195125 dblp:conf/stoc/BlumCCPRS94 fatcat:mik5yfzemvhfjhusnq7c3mvi44

A Fixed-Parameter Tractable Algorithm for Spatio-Temporal Calendar Management

Bernhard Nebel, Jochen Renz
2009 International Joint Conference on Artificial Intelligence  
We present a novel algorithm for TW-TSPs that enables us to find the optimal solution to TW-TSP problems occurring in real-world calendar management applications efficiently.  ...  Different tasks have to be scheduled according to the user preferences. In many cases, tasks are at different locations and travel times have to be considered.  ...  Now, you want to visit as many apartments as possible. Clearly, there are too many and because of the restricted visiting times, you will not be able to visit them all.  ... 
dblp:conf/ijcai/NebelR09 fatcat:srdzd2payzfwxjmaga3vy4vhde

Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios

Patrick Jaillet, Michael R. Wagner
2006 Transportation Science  
We also provide a general result on polynomial-time online algorithms for the online TSP.  ...  In a variety of disclosure date scenarios and metric spaces, we give new online algorithms and quantify the value of this advanced information in the form of improved competitive ratios.  ...  Acknowledgments The authors thank the anonymous referees for very thoughtful comments that significantly improved this paper. This work was supported in part by NSF Contract DMI-0230981.  ... 
doi:10.1287/trsc.1060.0147 fatcat:g6evo4da75hpvh3g6re6hetflm

Traveling salesman problem: approach to optimality

Radosław Jadczak
2014 Przedsiebiorczosc i Zarzadzanie  
Vehicle starting from the selected city must visit a set of another cities exactly once and return to the starting city in such a way that the total distance of the route is minimized.  ...  Traveling Salesman Problem (TSP) is a basic and one of the most important transportation problems in operational logistics.  ...  Due to the fact that there are not optimal solution (or even near optimal solution) in many parts of the solution space, search strategy should to skip these parts.  ... 
doi:10.2478/eam-2014-0024 fatcat:vo5ajanosnd47fb3ihottsgw5m

Introductory Chapter: Traveling Salesman Problem - An Overview [chapter]

Donald Davendra, Magdalena Bialic-Davendra
2020 Novel Trends in the Traveling Salesman Problem  
Both space and time complexity of the TSP problem can be considered as exponential. History The genesis of the TSP problem is difficult to pinpoint.  ...  The TSP problem over time has evolved into many different branches, each with different constraints: Symmetric TSP (STSP) -the basic TSP problem, where the distance between city i and city j is the same  ... 
doi:10.5772/intechopen.94435 fatcat:3xwr5daslrajzp7jka7scrsdcq

Faster Algorithms for Orienteering and k-TSP [article]

Lee-Ad Gottlieb, Robert Krauthgamer, Havana Rika
2022 arXiv   pre-print
We consider the rooted orienteering problem in Euclidean space: Given n points P in ℝ^d, a root point s∈ P and a budget ℬ>0, find a path that starts from s, has total length at most ℬ, and visits as many  ...  The previous Polynomial-Time Approximation Scheme (PTAS) for this problem, due to Chen and Har-Peled (2008), runs in time n^O(d√(d)/δ)(log n)^(d/δ)^O(d), and improving on this time bound was left as an  ...  We thank Rajesh Chitnis for helpful discussions.  ... 
arXiv:2002.07727v2 fatcat:cdictiy4erhdthursithc6hfve

Page 839 of The Journal of the Operational Research Society Vol. 51, Issue 7 [page]

2000 The Journal of the Operational Research Society  
This TSP corresponds to deciding the optimal visiting sequence for the given nodes while satisfying the allocation, time windows and precedence constraints.  ...  Dumas ef al'* have developed a dynamic programming algorithm for the TSP- TW which makes use of extensive domination and elimina- tion tests to reduce the state space and enhance the performance of the  ... 

A New Hybrid Algorithm for Traveler Salesman Problem based on Genetic Algorithms and Artificial Neural Networks

Alireza Arab Asadi, Ali Naserasadi, Zeinab Arab Asadi
2011 International Journal of Computer Applications  
Traveler Salesman Problem (TSP) is one the most famous and important problems in the field of operation research and optimization.  ...  In the last decades, many innovative algorithms have been presented to solve this problem but most of them are inappropriate and inefficient and have high complexity.  ...  Also, we showed that the hybrid algorithm has better time and space complexity than the other algorithms. Answer is optimal?  ... 
doi:10.5120/2945-3926 fatcat:5qowemqnczbp3h33lwgnerrbqe

The Traveling Firefighter Problem [article]

Majid Farhadi, Alejandro Toriello, Prasad Tetali
2021 arXiv   pre-print
For p = ∞ the problem becomes a path variant of the TSP, and for p = 1 it defines the Traveling Repairman Problem (TRP), both at the center of classical combinatorial optimization.  ...  We also study the all-norm-TSP problem [Golovin et al. '08], in which the objective is to find a route that is (approximately) optimal with respect to the minimization of any norm of the visit times, and  ...  First author would like to thank Joseph Bakhtiar for discussions, and Jai Moondra for a careful reading of the paper, and their helpful comments.  ... 
arXiv:2107.10454v1 fatcat:ea7z5gr47vdlbnudnj5wdv26zi
« Previous Showing results 1 — 15 out of 6,993 results