Results 101 to 110 of about 4,732 (227)

Discrete Starfish Optimization Algorithm for Symmetric Travelling Salesman Problem

IEEE Access
This paper introduces a new discrete StarFish Optimization Algorithm (D-SFOA) to solve a complex discrete Symmetric Travelling Salesman Problem (STSP).
Muhammet Aktas, Fatih Kilic
doaj   +1 more source

Amoeba-inspired analog electronic computing system integrating resistance crossbar for solving the travelling salesman problem. [PDF]

Sci Rep, 2020
Saito K, Aono M, Kasai S.
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  

Insertion Heuristics for Central Cycle Problems [PDF]

, 2006
A central cycle problem requires a cycle that is reasonably short and keeps a the maximum distance from any node not on the cycle to its nearest node on the cycle reasonably low.
Lamb, John Douglas
core  

Aircraft Group Coordinated Flight Route Optimization Using Branch-and-Bound Procedure in Resolving the Problem of Environmental Monitoring

ITM Web of Conferences, 2017
The solution of a travelling salesman problem (TSP) for the case of two-dimensional flight routing is suggested. Unlike the case of one-dimensional routing, this solution implies the formation of two initial matriсes of the distances between the points ...
Lebedev Georgy, Goncharenko Vladimir, Mikhaylin Denis, Rumakina Alena   +3 more
doaj   +1 more source

On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)

AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;semidefinite programming;quadratic as- signment ...
Klerk, E. de, Pasechnik, D.V., Sotirov, R.   +2 more
core  

Can the Agent with Limited Information Solve Travelling Salesman Problem?

Complexity, 2017
Here, we develop new heuristic algorithm for solving TSP (Travelling Salesman Problem). In our proposed algorithm, the agent cannot estimate tour lengths but detect only a few neighbor sites. Under the circumstances, the agent occasionally ignores the NN
Tomoko Sakiyama, Ikuo Arizono
doaj   +1 more source

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

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  

Dataset for the electric capacitated traveling salesman problem. [PDF]

Data Brief, 2023
Gialos A, Zeimpekis V.
europepmc   +1 more source