Results 101 to 110 of about 15,296 (207)
TSP – Infrastructure for the Traveling Salesperson Problem [PDF]
The traveling salesperson (or, salesman) problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city ...
Kurt Hornik +2 more
core +1 more source
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)The Traveling Salesman Problem (TSP) is a problem that represents a difficult combinatorial optimization problem starting from practical problems. The ant colony optimization (ACO) algorithm is implemented in several topics, particularly in solving ...
Gabriel Bodhi, Charleen, Devi Fitrianah
doaj +1 more source
Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP)
, 2012 In this paper, the author proposes optimal tree as a "gauge" for the generation of the initial population at random in the Genetic Algorithms (GA) to benchmark against the good and the bad parent tours. Thus, without having the so-called bad parent tours in the initiate population, it will speed up the GA.
openaire +2 more sources
How to make a greedy heuristic for the asymmetric traveling salesman problem competitive [PDF]
It is widely confirmed by many computational experiments that a greedy type heuristics for the Traveling Salesman Problem (TSP) produces rather poor solutions except for the Euclidean TSP.
Goldengorin, B., Jäger, G.
core +1 more source
Ingeniare: Revista Chilena de Ingeniería, 2011 En este trabajo se estudió el problema de secuenciamiento de trabajos en el taller de flujo de permutación con tiempos de preparación dependientes de la secuencia y minimización de makespan.
Eduardo Salazar Hornig +1 more
doaj
DynaThe traveling salesman problem (TSP) is the canonical combinatorial optimization problem famous throughout literature. There exists an objective function associated with every feasible solution.
Jerry L. Shaw +4 more
doaj +1 more source
The Application of Ant Colony Algorithm in Solve the Traveling Salesman Problem with Fuzzy Movement Time among Cities [PDF]
Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī, 2010 Traveling salesman problem (TSP) is one of the most well-known combinational optimization problems which recently has been a suitable base to validate different heuristic and Meta heuristic algorithms.
Jamshid Salehi Sadaghiani
doaj
Fault-tolerance of a neural network solving the traveling salesman problem [PDF]
This study presents the results of a fault-injection experiment that stimulates a neural network solving the Traveling Salesman Problem (TSP). The network is based on a modified version of Hopfield's and Tank's original method.
Arras, M., Palumbo, D., Protzel, P.
core +1 more source
A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
Annals of Operations ResearchAbstract The traveling salesman (or salesperson) problem, short TSP, is of strong interest to many researchers from mathematics, economics, and computer science. Manifold TSP variants occur in nearly every scientific field and application domain: e.g., engineering, physics, biology, life sciences, and manufacturing.
Sophia Saller +2 more
openaire +2 more sources
Coevolutionary Memetic Algorithms for Solving Traveling Salesman Problem (TSP)
, 2013 ABSTRACT: In this thesis, Coevolutionary Memetic Algorithms are used for solving the well-known Traveling Salesman Problem (TSP). Traveling Salesman Problem is NP-Complete which means no algorithm can solve this problem in a computing time that increases polynomially with respect to the problem size.
openaire +1 more source