Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic. [PDF]
PLoS ONE, 2018 This article finds feasible solutions to the travelling salesman problem, obtaining the route with the shortest distance to visit n cities just once, returning to the starting city.
Gustavo Erick Anaya Fuentes +3 more
doaj +2 more sources
On solving Travelling Salesman Problem with Vertex Requisitions [PDF]
Yugoslav Journal of Operations Research, 2017 We consider the Travelling Salesman Problem with Vertex Requisitions where, for each position of the tour, at most two possible vertices are given. It is known that the problem is strongly NP-hard.
Eremeev Anton V., Kovalenko Yulia V.
doaj +4 more sources
Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem [PDF]
ISPRS International Journal of Geo-Information, 2018 The Equality-Generalized Travelling Salesman Problem (E-GTSP), which is an extension of the Travelling Salesman Problem (TSP), is stated as follows: given groups of points within a city, like banks, supermarkets, etc., find a minimum cost Hamiltonian ...
Mohammed Zia +2 more
doaj +3 more sources
Travelling Salesman Problem with a Center [PDF]
Physical Review E, 2005 We study a travelling salesman problem where the path is optimized with a cost function that includes its length $L$ as well as a certain measure $C$ of its distance from the geometrical center of the graph.
Adam Lipowski +5 more
core +3 more sources
The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm [PDF]
The Scientific World Journal, 2014 The ordered clustered travelling salesman problem is a variation of the usual travelling salesman problem in which a set of vertices (except the starting vertex) of the network is divided into some prespecified clusters.
Zakir Hussain Ahmed
doaj +2 more sources
The multi-stripe travelling salesman problem. [PDF]
Ann Oper Res, 2017 In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with q larger than 1, the objective function sums the costs for travelling from one city to each of the next q cities along the tour.
Çela E, Deineko VG, Woeginger GJ.
europepmc +8 more sources
Some new results on the travelling salesman problem [PDF]
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 +3 more sources
An efficient genetic algorithm for solving open multiple travelling salesman problem with load balancing constraint [PDF]
Decision Science Letters, 2021 The multiple travelling salesman problem (MTSP) is one of the widely studied combinatorial optimization problems with various theoretical and practical applications.
Purusotham Singamsetty +1 more
doaj +1 more source
Synchronized Traveling Salesman Problem
Journal of Graph Algorithms and Applications, 2021 We consider a variation of the well-known traveling salesman problem in which there are multiple agents who all have to tour the whole set of nodes of the same graph, while obeying node- and edge-capacity constraints require that agents must not "crash".
Pap, Gyula, Varnyú, József
openaire +3 more sources
Solving the clustered traveling salesman problem via traveling salesman problem methods
PeerJ Computer Science, 2022 The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications. In this work, we explore a transformation approach that solves the CTSP by converting it to the well-studied TSP. For this purpose, we first investigate a technique to convert a CTSP instance to a
Lu, Yongliang, Hao, Jin-Kao, Wu, Qinghua
openaire +3 more sources