Results 31 to 40 of about 877 (188)
On the Recoverable Traveling Salesman Problem
CoRR, 2021 In this paper we consider the Recoverable Traveling Salesman Problem (TSP). Here the task is to find two tours simultaneously, such that the intersection between the tours is at least a given minimum size, while the sum of travel distances with respect to two different distance metrics is minimized.
Marc Goerigk, Stefan Lendl, Lasse Wulf
openaire +2 more sources
The intermittent travelling salesman problem [PDF]
International Transactions in Operational Research, 2018 AbstractIn this paper, we introduce a new variant of the travelling salesman problem, namely the intermittent travelling salesman problem (ITSP), which is inspired by real‐world drilling/texturing applications. In this problem, each vertex can be visited more than once and there is a temperature constraint enforcing a time lapse between two consecutive
Pham, Tú San +2 more
openaire +2 more sources
Solving open travelling salesman subset-tour problem through a hybrid genetic algorithm [PDF]
Journal of Project Management, 2021 In open travelling salesman subset-tour problem (OTSSP), the salesman needs to traverse a set of k (≤n) out of n cities and after visiting the last city, the salesman does not necessarily return to the central depot.
Singamsetty, Purusotham +2 more
doaj +1 more source
Some new results on the travelling salesman problem
Vallis Aurea, 2015 The travelling salesman problem (or The sales representative problem) has been insufficiently explored so far. One of the first results on this issue was provided by Euler in 1759 (The problem of moving a knight on the chess board), Knight's Tour Problem.
Dominika Crnjac Milić +1 more
doaj +1 more source
An Algorithm for the Traveling Salesman Problem [PDF]
Operations Research, 1963 A “branch and bound” algorithm is presented for solving the traveling salesman problem. The set of all tours (feasible solutions) is broken up into increasingly small subsets by a procedure called branching. For each subset a lower bound on the length of the tours therein is calculated.
Little, J. D. C. +3 more
openaire +2 more sources
Colored Traveling Salesman Problem
IEEE Transactions on Cybernetics, 2015 The multiple traveling salesman problem (MTSP) is an important combinatorial optimization problem. It has been widely and successfully applied to the practical cases in which multiple traveling individuals (salesmen) share the common workspace (city set).
Jun Li 0011 +4 more
openaire +2 more sources
Solving multiple travelling salesman problem through deep convolutional neural network
IET Cyber-systems and Robotics, 2023 The multiple travelling salesman problem (mTSP) is a classical optimisation problem that is widely applied in various fields. Although the mTSP was solved using both classical algorithms and artificial neural networks, reiteration is inevitable for these
Zhengxuan Ling, Yueling Zhou, Yu Zhang
doaj +1 more source
Solving the Travelling Salesman Problem by Using Artificial Bee Colony Algorithm
Journal of Computing Research and Innovation, 2022 Travelling Salesman Problem (TSP) is a list of cities that must visit all cities that start and end in the same city to find the minimum cost of time or distance. The Artificial Bee Colony (ABC) algorithm was used in this study to resolve the TSP.
Siti Hafawati Jamaluddin +3 more
doaj +3 more sources
Robot Path Planning Based On The Travelling Salesman Problem
Chemical Engineering Transactions, 2015 Against the background of "Robot Travelling China" competition, this paper introduces the idea of TSP to seek optimal motion path. Applying the knowledge of graph theory to analyze and transform the map of competition.
G.Q. Wang +4 more
doaj +1 more source
Robotics, 2022 Industrial robot applications should be designed to allow the robot to provide the best performance for increasing throughput. In this regard, both trajectory and task order optimization are crucial, since they can heavily impact cycle time. Moreover, it
Matteo Bottin +2 more
doaj +1 more source