Results 51 to 60 of about 72,557 (222)
The Traveling Salesman Problem in the Natural Environment [PDF]
, 2010 Is it possible for humans to navigate in the natural environment wherein the path taken between various destinations is 'optimal' in some way? In the domain of optimization this challenge is traditionally framed as the "Traveling Salesman ...
Flip Phillips +2 more
core +2 more sources
Traveling salesman problem with a center [PDF]
Physical Review E, 2005 We study a travelling salesman problem where the path is optimized with a cost function that includes its length $L$ as well as a certain measure $C$ of its distance from the geometrical center of the graph. Using simulated annealing (SA) we show that such a problem has a transition point that separates two phases differing in the scaling behaviour of $
Lipowski, Adam, Lipowska, Dorota
openaire +3 more sources
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT A formation inversion algorithm with real‐time performance and accuracy is crucial for natural gamma logging while drilling (LWD). However, traditional inversion algorithms are often limited by high computational resource consumption and insufficient accuracy.
Juntao Liu +4 more
wiley +1 more source
Genetiniai algoritmai komivojažieriaus uždaviniui: negatyvieji ir pozityvieji aspektai*
Informacijos Mokslai, 2009 Šiame straipsnyje nagrinėjami klausimai, susiję su genetinių algoritmų taikymu, sprendžiant gerai žinomą kombinatorinio optimizavimo uždavinį – komivojažieriaus uždavinį (KU) (angl. traveling salesman problem).
Alfonsas Misevičius +3 more
doaj +1 more source
Constant-Factor Approximation for TSP with Disks [PDF]
, 2016 We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constant-ratio approximation for disks in the plane: Given a set of $n$ disks in the plane, a TSP tour whose length is at most $O(1)$ times the optimal can be ...
Dumitrescu, Adrian, Tóth, Csaba D.
core
A Memetic Algorithm for the Generalized Traveling Salesman Problem [PDF]
, 2009 The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from ...
Gutin, Gregory, Karapetyan, Daniel
core +4 more sources
The geometric maximum traveling salesman problem [PDF]
Journal of the ACM, 2003 We consider the traveling salesman problem when the cities are points in ℝ d for some fixed d and distances are computed according to geometric distances, determined by some norm.
Barvinok, A. +5 more
openaire +4 more sources
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm [PDF]
Journal of Optimization in Industrial Engineering, 2014 The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution.
Hossein Larki, Majid Yousefikhoshbakht
doaj
APPLICATION OF GENETIC ALGORITHMS TO THE TRAVELING SALESMAN PROBLEM
Applied Computer Science, 2023 The purpose of this paper was to investigate in practice the possibility of using evolutionary algorithms to solve the traveling salesman problem on a real example.
Tomasz SIKORA +1 more
doaj +1 more source
Random gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem
International Journal of Industrial Engineering and Production Research, 2018 this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem.
Ahmad Sheibat Alhamdi +1 more
doaj +2 more sources