Results 31 to 40 of about 11,422 (178)
Solving MTSP with Two-stage SA and GA Based on Spark [PDF]
Zhengzhou Daxue xuebao. Gongxue banA two-stage KSAGA algorithm combining Spark-based simulated annealing and genetic algorithms was proposed for the single-depot multiple traveling salesman problem with minimum total path length. In the first stage, the multiple traveling salesman problem
SUN Jian, LIU Pin, LI Hao, CHEN Pan
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
Good triangulations yield good tours [PDF]
, 2008 Consider the following heuristic for planar Euclidean instances of the traveling salesman problem (TSP): select a subset of the edges which induces a planar graph, and solve either the TSP or its graphical relaxation on that graph. In this paper, we give
Pearson, N +3 more
core +1 more source
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
New techniques for cost sharing in combinatorial optimization games [PDF]
, 2010 Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for such games.
Caprara, A +3 more
core +1 more source
A Multi-Phase Method for Euclidean Traveling Salesman Problems
Axioms, 2022 The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and ends in the same city and visits the remaining n−1 cities exactly once.
Víctor Hugo Pacheco-Valencia +3 more
doaj +1 more source
A model of human performance on the traveling salesperson problem. [PDF]
, 2000 A computational model is proposed of how humans solve the traveling salesperson problem (TSP). Tests of the model are reported, using human performance measures from a variety of 10-, 20-, 40-, and 60-node problems, a single 48-node problem, and a single
MacGregor, J. N. +8 more
core +1 more source
On the Solution of the Traveling Salesman Problem by a Modification of the Hungarian Method
Кібернетика та комп'ютерні технологіїIntroduction. The traveling salesman problem is becoming an important object of research in various fields of science, economics and technology. Construction of efficient algorithms with an optimality criterion for the obtained solution is a relevant ...
Dmitri Terzi
doaj +1 more source