(1999), "Solving the k-best traveling salesman problem", Computers & Operations Research, Vol. 26, pp. 409-25.E. S. Van der Poort et al. "Solving the k-best traveling salesman problem". Computers & operations research 26.4 (1999)....
Given a list of cities and their pair-wise distances, the traveling salesman problem (TSP) is to find the shortest tour that visits each city once and returns to its original city (Flood, 1955). TSP is a classic problem in combinatorial optimization and belongs to the class of NP-complete...
Tensegrity Robot Proprioceptive State Estimation with Geometric Constraints 14 p. Error Threshold of SYK Codes from Strong-to-Weak Parity Symmetry Breaking 12 p. What is the origin of the JWST SMBHs? 11 p. URAvatar: Universal Relightable Gaussian Codec Avatars 28 p. Robust Gaussian Processes...
In the standard version of the traveling salesman problem (TSP), we are given a set of customers located in and around a city and the distances between each pair of customers, and need to find the shortest tour that visits each customer exactly once. Suppose that some of the customers are...
The equality generalized traveling salesman problem (E-GTSP) is an extension of the traveling salesman problem (TSP) where the set of cities is partitioned into clusters, and the salesman has to visit every cluster exactly once. It is well known that any instance of E-GTSP can be transformed...
Owing to its complexity, the traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics. The TSP is defined as the provision of minimization of total distance, cost, and duration by visiting the n number of points only once in order to arrive...
Solving the traveling salesman problem with simulated annealing techniques on aconcurrent supercomputerBertrand BraschiB. Braschi, \Solving the Traveling Salesman Problem with Simulated Annealing Techniques on a Concurrent Supercomputer", TIM3-INPG Grenoble, Report RR 752-I Nov. (...
The Traveling Salesman Problem (TSP) is a classical combinatorial optimization problem that has potential for application in several fields, specifically. Cognitive Psychology, Operations Research, and Artificial Intelligence. The TSP refers to finding the shortest tour of a number of cities. Research su...
The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given a salesman who has to visita number of cities to carry out some business. He starts and ends at a specified home cit...
In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the depot over time, during the planning horizon. The ...