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
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
Hybrid pointer networks for traveling salesman problems optimization. [PDF]
PLoS ONE, 2021 In this work, we proposed a hybrid pointer network (HPN), an end-to-end deep reinforcement learning architecture is provided to tackle the travelling salesman problem (TSP). HPN builds upon graph pointer networks, an extension of pointer networks with an
Ahmed Stohy +7 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
An effective method for solving multiple travelling salesman problem based on NSGA-II
Systems Science and 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
exaly +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
Traveling salesman games [PDF]
Mathematical Programming, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Potters, J.A.M., Curiel, I., Tijs, S.H.
openaire +6 more sources
Freakonometrics, 2017 International audience ; The traveling salesman problem is the task of determining an optimal path through several points and return to the starting point.
Lihoreau, Mathieu +2 more
openaire +4 more sources
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
An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows [PDF]
Yugoslav Journal of Operations Research, 2013 General Variable Neighborhood Search (GVNS) is shown to be a powerful and robust methodology for solving travelling salesman and vehicle routing problems.
Mladenović Nenad +2 more
doaj +1 more source