Results 81 to 90 of about 5,666,790 (163)
A hybrid genetic algorithm and inver over approach for the travelling salesman problem [PDF]
, 2010 This article posted here with permission of the IEEE - Copyright @ 2010 IEEEThis paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP).
Yang, S +5 more
core +1 more source
, 2016 Travelling Salesman Problem (TSP) is one of the most researched combinatorial problems in mathematics. This chapter incorporates chaotic maps in evolutionary algorithms as random number generators and applies it to the TSP.
Zelinka, Ivan +3 more
core +1 more source
TSP – Infrastructure for the Traveling Salesperson Problem
Journal of Statistical Software, 2007 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 ...
Michael Hahsler, Kurt Hornik
doaj
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
, 2000 In this thesis, we study neighbourhoods of exponential size that can be searched in polynomial time. Such neighbourhoods are used in local search algorithms for classes of combinatorial optimisation problems.
Congram, Richard K., Congram, R.K.
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
On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96) [PDF]
AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;semidefinite programming;quadratic as- signment ...
Klerk, E. de +2 more
core
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
A review of the Tabu Search Literature on Traveling Salesman Problems [PDF]
The Traveling Salesman Problem (TSP) is one of the most widely studied problems inrncombinatorial optimization. It has long been known to be NP-hard and hence research onrndeveloping algorithms for the TSP has focused on approximate methods in addition ...
Sumanta Basu, Ghosh, Diptesh
core