Results 101 to 110 of about 3,935 (225)
How to make a greedy heuristic for the asymmetric traveling salesman problem competitive
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.
Jäger, G., Goldengorin, B.
core
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
Iterative Patching and the Asymmetric Traveling Salesman Problem
Although Branch and Bound (BnB) methods are among the most widely used techniques for solving hard problems, it is still a challenge to make these methods smarter.
Goldengorin, Boris +3 more
core
On the Core of Multiple Longest Traveling Salesman Games
In this paper we introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in which a salesman has to visit each node (player) precisely once, except its home location, in an order that maximizes the total reward ...
Borm, P.E.M. +2 more
core
Clustering solutions: a novel approach to solving NP-complete problems
, 2010 In this thesis, we introduce a novel approach to solving MAX-SAT problems. This algorithm clusters good solutions, and restarts the search from the closest feasible configuration to the centroid of each cluster.
Qasem, Mohamed
core
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
A Criteria-Based Approach to the Traveling Salesman Problem (TSP)
, 2020 The “traveling salesman problem (TSP)” is a classic minimum cost network flow problem in mathematical programming and graph theory that can be formulated in multiple configurations. The fundamental question, however, is: “what is a cost”?
Rincón, Jose +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
Implementing Tabu Search to Exploit Sparsity in ATSP Instances [PDF]
Real life traveling salesman problem (TSP) instances are often large,sparse, and asymmetric. Conventional tabu search implementations for the TSP that have been reported in the literature, almost always deals with small, dense and symmetric instances. In
Sumanta Basu +2 more
core