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 +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 +3 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 +9 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
An effective method for solving multiple travelling salesman problem based on NSGA-II
Systems Science & Control Engineering, 2019 In this paper, an effective multi-objective evolutionary algorithm is proposed to solve the multiple travelling salesman problem. In order to obtain minimum total visited distance and minimum range between all salesmen, some novel representation ...
Yang Shuai, Shao Yunfeng, Zhang Kai
doaj +2 more sources
Unsupervised Learning for Solving the Travelling Salesman Problem [PDF]
Neural Information Processing Systems, 2023 We propose UTSP, an unsupervised learning (UL) framework for solving the Travelling Salesman Problem (TSP). We train a Graph Neural Network (GNN) using a surrogate loss.
Yimeng Min, Yiwei Bai, Carla P. Gomes
semanticscholar +1 more source
Learning to Solve Travelling Salesman Problem with Hardness-adaptive Curriculum [PDF]
AAAI Conference on Artificial Intelligence, 2022 Various neural network models have been proposed to tackle combinatorial optimization problems such as the travelling salesman problem (TSP). Existing learning-based TSP methods adopt a simple setting that the training and testing data are independent ...
Zeyang Zhang +3 more
semanticscholar +1 more source
Unconstrained binary models of the travelling salesman problem variants for quantum optimization [PDF]
Quantum Information Processing, 2021 Quantum computing is offering a novel perspective for solving combinatorial optimization problems. To fully explore the possibilities offered by quantum computers, the problems need to be formulated as unconstrained binary models, taking into account ...
Ozlem Salehi +2 more
semanticscholar +1 more source
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