Results 161 to 170 of about 21,266 (220)
Some of the next articles are maybe not open access.
A Travelling Salesman Problem (TSP) with Multiple Job Facilties
OPSEARCH, 2001In this paper we have considered a variation of usual travelling salesman problem introducing a more realistic situation.
Das, Shila, Ahmed, Nazimuddin
openaire +1 more source
Efficient Traveling Salesman Problem Solvers using the Ising Model with Simulated Bifurcation
Design, Automation and Test in Europe, 2022An Ising model-based solver has shown efficiency in obtaining suboptimal solutions for combinatorial optimization problems. As an NP-hard problem, the traveling salesman problem (TSP) plays an important role in various routing and scheduling applications.
Tingting Zhang, Jie Han
semanticscholar +1 more source
Multiagent Optimization System for Solving the Traveling Salesman Problem (TSP)
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2009The multiagent optimization system (MAOS) is a nature-inspired method, which supports cooperative search by the self-organization of a group of compact agents situated in an environment with certain sharing public knowledge. Moreover, each agent in MAOS is an autonomous entity with personal declarative memory and behavioral components.
Xiao-Feng, Xie, Jiming, Liu
openaire +2 more sources
Optical processor for solving the traveling salesman problem (TSP)
SPIE Proceedings, 2006This paper introduces an optical solution to (bounded-length input instances of) an NP-complete problem called the traveling salesman problem using a pure optical system. The solution is based on the multiplication of a binary-matrix, representing all feasible routes, by a weight-vector, representing the weights of the problem.
Natan T. Shaked +5 more
openaire +1 more source
European Journal of Operational Research, 2020
The clustered generalized traveling salesman problem (CGTSP) is an extension of the classical traveling salesman problem (TSP), where the set of nodes is divided into clusters of nodes, and the clusters are further divided into subclusters of nodes.
Pouya Baniasadi +3 more
semanticscholar +1 more source
The clustered generalized traveling salesman problem (CGTSP) is an extension of the classical traveling salesman problem (TSP), where the set of nodes is divided into clusters of nodes, and the clusters are further divided into subclusters of nodes.
Pouya Baniasadi +3 more
semanticscholar +1 more source
Machine Learning Approaches for the Traveling Salesman Problem: A Survey
Europe, 2021Machine Learning techniques have been applied in many contexts with great success. In this survey, we focus on their applications in the Combinatorial Optimization (CO) domain, and in particular to the Traveling Salesman Problem (TSP).
Umberto Junior Mele +2 more
semanticscholar +1 more source
Engineering applications of artificial intelligence, 2020
Ant Colony Optimization (ACO) algorithm is one of the effective solutions to solve the problem of combination optimization like traveling salesman problem (TSP) which belongs to NP-hard problem.
Sahar Ebadinezhad
semanticscholar +1 more source
Ant Colony Optimization (ACO) algorithm is one of the effective solutions to solve the problem of combination optimization like traveling salesman problem (TSP) which belongs to NP-hard problem.
Sahar Ebadinezhad
semanticscholar +1 more source
MGA-TSP: modernised genetic algorithm for the travelling salesman problem
International Journal of Reasoning-based Intelligent Systems, 2019This paper proposes a new enhanced algorithm called modernised genetic algorithm for solving the travelling salesman problem (MGA-TSP). Recently, the most successful evolutionary algorithm used for TSP problem, is GA algorithm. The main obstacles for GA is building its initial population.
N.A. Ra' +7 more
openaire +1 more source
Optimized Solution of TSP (Travelling Salesman Problem) Based on Mendelian Inheritance
Recent Advances in Computer Science and Communications, 2020Background: TSP problem has been the part of literature from many decades; it’s an important optimization issue in operation research. TSP problem always remain greedy for the better results especially if chosen working field are Genetic Algorithms (GA).
Vivek Sharma, Rakesh Kumar, Sanjay Tyagi
openaire +1 more source
IMPLEMENTASI TRAVELING SALESMAN PROBLEM (TSP) MENGGUNAKAN ALGORITMA BRUTE FORCE [PDF]
, 2021 PLN adalah suatu perusahaan yang mengurus semua aspek kelistrikan. Perusahaan tersebut harus selalu melakukan maintenance di setiap gardunya. Hal tersebut membuat semua teknisi harus memperhitungkan rute dengan jarak terpendek agar meminimumkan biaya transportasi dan waktu yang digunakan.
openaire