Results 91 to 100 of about 5,666,790 (163)

The Traveling Salesman Problem (TSP): A Spatial Navigation Task for Rats. [PDF]

Bio Protoc, 2018
Blaser RE.
europepmc   +1 more source

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   +1 more source

An empirical investigation into randomly generated Euclidean symmetric traveling salesman problems [PDF]

The traveling salesman problem is one of the most well-solved hard combinatorial optimization problems. Any new algorithm or heuristic for the traveling salesman problem is empirically evaluated based on its performance on standard test instances, as ...
Sharma, Megha, Ghosh, Diptesh
core  

Solving the Traveling Salesman Problem Using a Modified Teaching-Learning Based Optimization Algorithm [PDF]

International Journal of Industrial Engineering and Production Research
The Traveling Salesman Problem (TSP) is a well-known problem in optimization and graph theory, where finding the optimal solution has always been of significant interest.
Ahmad Aliyari Boroujeni, Ameneh Khadivar
doaj  

An Immune-genetic Based TSP Solution

工程科学与技术, 2006
:Using the characteristics of the genetic algorithm and the immune algorithm, an immune-genetic algorithm was presented for solving TSP (traveling salesman problem) more effectively.
doaj  

Solving multi-depot closed-path multiple traveling salesman problem using k-means++ hierarchical clustering and neural combinatorial networks. [PDF]

Sci Rep
Zhao CS, Wong LP, Fung C.
europepmc   +1 more source

A discrete enzyme action optimizer for traveling salesman problems with a smart tourism routing application: a case study in Bitlis, Türkiye. [PDF]

Sci Rep
Tumen V, Elmastas N, Okten I, Ekinci S, Izci D, Rashdan M, Salman M.   +6 more
europepmc   +1 more source

Fuzzy graph structure model based on plithogenic set theory with applications to the traveling salesman problem (TSP)

The Traveling Salesman Problem (TSP) is a fundamental combinatorial optimization problem with broad applications in logistics, transportation, service management, and route planning.
Al-Shamiri, Mohammed M., Sultana, Fazeelat, Ali, Mumtaz, Gulistan, Muhammad   +3 more
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

Genetic algorithm-based coverage path planning for autonomous aircraft cabin cleaning by reconfigurable robot. [PDF]

PLoS One
Dinh CH, Qi CY, Van HV, Chen G, Mohan RE, Le AV.   +5 more
europepmc   +1 more source