Results 91 to 100 of about 11,422 (178)
Fluctuations in the site-disordered traveling salesman problem
, 2007 We extend a previous statistical mechanical treatment of the traveling salesman problem by defining a discrete 'site-disordered' problem in which fluctuations about saddle points can be computed.
Dean, David, S. +3 more
core +1 more source
New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP) [PDF]
Journal of Optimization in Industrial Engineering, 2010 Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution.
Ellips Masehian
doaj
Classifying traveling salesman problems
, 1989 When should two traveling salesman problems be equivalent? This paper contains an answer which is motivated by an example. The equivalence relation is applied to 0,1 symmetric traveling salesman problems.
Warren, Richard H.
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
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
Evolutionary computation applied to combinatorial optimisation problems [PDF]
, 2007 This thesis addresses the issues associated with conventional genetic algorithms (GA) when applied to hard optimisation problems. In particular it examines the problem of selecting and implementing appropriate genetic operators in order to meet the ...
Mitchell, George G.
core
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
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
The Symmetric Traveling Salesman Problem
CoRR, 2005 Let M be an nXn symetric matrix, n, even, T, an upper bound for T_OPT, an optimal tour, sigma_T, the smaller-valued perfect matching obtained from alternate edges of T expressed as a product of 2-cycles. Applying the modified Floyd-Warshall algorithm to (sigma_T)^-1M^-, we construct acceptable and 2-circuit cycles some sets of which may yield circuits ...
openaire +3 more sources
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