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
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
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
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
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".
Gyula Pap, József Varnyú
openaire +3 more sources
Novel Heuristic for New Pentagonal Neutrosophic Travelling Salesman Problem [PDF]
Neutrosophic Sets and Systems, 2022 This paper presents a new variant of Travelling Salesman Problem (TSP) and its first resolution. In literature there is not any research work that has presented the TSP under pentagonal fuzzy neutrosophic environment yet.
Souhail Dhouib
doaj +1 more source
Optimization of Single-valued Triangular Neutrosophic Fuzzy Travelling Salesman Problem [PDF]
Neutrosophic Sets and Systems, 2023 The travelling salesman problem(TSP) is a classic optimization puzzle, widely studied and celebrated for its significance in operations research, mathematics and computer science.
Subadhra Srinivas, K. Prabakaran
doaj +1 more source
The Attractive Traveling Salesman Problem [PDF]
European Journal of Operational Research, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Günes Erdogan +2 more
openaire +2 more sources
POPMUSIC for the travelling salesman problem [PDF]
European Journal of Operational Research, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Taillard, Eric, Helsgaun, Keld
openaire +3 more sources