Results 21 to 30 of about 72,557 (222)
Colored Traveling Salesman Problem
IEEE Transactions on Cybernetics, 2015 The multiple traveling salesman problem (MTSP) is an important combinatorial optimization problem. It has been widely and successfully applied to the practical cases in which multiple traveling individuals (salesmen) share the common workspace (city set).
Jun, Li +4 more
openaire +2 more sources
Variants of the Traveling Salesman Problem
Studies in Business and Economics, 2019 This paper includes an introduction to the concept of spreadsheet optimization and modeling as it specifically applies to combinatorial problems. One of the best known of the classic combinatorial problems is the “Traveling Salesman Problem” (TSP).
Patterson Mike, Friesen Daniel
doaj +1 more source
Logic, 2019 Traveling Salesman Problem is a problem solving used in finding the shortest route to visit all nodes at once and then return to the initial node. Troubleshooting of the Traveling Salesman Problem using the Brute Force algorithm.
Indri Ariyanti +2 more
doaj +1 more source
An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem
Mathematics, 2023 The ant colony algorithm faces dimensional catastrophe problems when solving the large-scale traveling salesman problem, which leads to unsatisfactory solution quality and convergence speed.
Kezong Tang +4 more
doaj +1 more source
Modeling of transportation logistics processes for the urban environment [PDF]
E3S Web of Conferences, 2019 The article deals with the approach to modeling the road transport movement in large cities (with a population of over 100 thousand people) for the delivery of goods from a large warehouse to stores belonging to a trading network company, with the task ...
Romanov Petr, Romanova Irina
doaj +1 more source
Traveling salesman problem parallelization by solving clustered subproblems
Foundations of Computing and Decision Sciences, 2023 A method of parallelizing the process of solving the traveling salesman problem is suggested, where the solver is a heuristic algorithm. The traveling salesman problem parallelization is fulfilled by clustering the nodes into a given number of groups ...
Romanuke Vadim
doaj +1 more source
Lin-Kernighan Heuristic Adaptations for the Generalized Traveling Salesman Problem [PDF]
, 2010 The Lin-Kernighan heuristic is known to be one of the most successful heuristics for the Traveling Salesman Problem (TSP). It has also proven its efficiency in application to some other problems.
Balas +24 more
core +3 more sources
The Traveling Salesman Problem Under Squared Euclidean Distances [PDF]
, 2010 Let $P$ be a set of points in $\mathbb{R}^d$, and let $\alpha \ge 1$ be a real number. We define the distance between two points $p,q\in P$ as $|pq|^{\alpha}$, where $|pq|$ denotes the standard Euclidean distance between $p$ and $q$.
de Berg, Mark +4 more
core +5 more sources
A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems
International Journal of Computational Intelligence Systems, 2018 Multiple Traveling Salesman Problem (MTSP) is able to model and solve various real-life applications such as multiple scheduling, multiple vehicle routing and multiple path planning problems, etc.
Kin-Ming Lo +5 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