Results 101 to 110 of about 5,636,127 (168)

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., Lancaster, David, Dean, D.S., Lancaster, D.J.   +3 more
core   +1 more source

A comparison of heuristic and human performance on open versions of the traveling salesperson problem. [PDF]

, 2006
We compared the performance of three heuristics with that of subjects on variants of a well-known combinatorial optimization task, the Traveling Salesperson Problem (TSP). The present task consisted of finding the shortest path through an array of points
MacGregor, James N., Chronicle, Edward P., Ormerod, ThomasC.   +2 more
core   +1 more source

Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation

, 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

Improved artificial bee colony algorithm for large scale colored bottleneck traveling salesman problem

Tongxin xuebao, 2018
In the fields such as intelligent transport and multiple tasks cooperation, the model scale constructed by colored bottleneck traveling salesman problem (CBTSP) tends to large scale, and therefore it is necessary to study the large scale CBTSP and its ...
Wenyong DONG, Xueshi DONG, Yufeng WANG
doaj   +2 more sources

Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem. [PDF]

Entropy (Basel), 2020
Stodola P, Michenka K, Nohel J, Rybanský M.   +3 more
europepmc   +1 more source

Approaches for solving some scheduling and routing problems

, 2009
We study approaches for finding good solutions, and lower bounds, for three difficult combinatorial optimisation problems.The supply ship travelling salesman problem is a simplification of a situation faced by a naval logistics coordinator who must ...
Drake, Andrew John
core   +1 more source

A reinforcement learning-enhanced discrete zebra optimization algorithm for solving the traveling salesman problem. [PDF]

Sci Rep
Ghatei S, TaghipourEivazi S, Habibi Zadnavin A, Ghaffari A.   +3 more
europepmc   +1 more source

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, Ravindra S Gajulapalli, Ghosh, Diptesh   +2 more
core  

Probabilistic greedy algorithm solver using magnetic tunneling junctions for traveling salesman problem. [PDF]

Nat Commun
Zhang R, Li X, Wan C, Hoffmann R, Hindenberg M, Xu Y, Liu S, Kong D, Xiong S, He S, Vardar A, Dai Q, Gong J, Sun Y, Zheng Z, Kämpfe T, Yu G, Han X.   +17 more
europepmc   +1 more source

A probabilistic traveling salesman problem: a survey [PDF]

Annals of computer science and information systems, 2014
Abir Henchiri, Monia Bellalouna, Walid Khaznaji   +2 more
doaj   +1 more source