Traveling salesman problem solution using magnonic combinatorial device.

ABSTRACT: Traveling salesman problem (TSP) is a decision-making problem that is essential for a number of practical applications. Today, this problem is solved on digital computers exploiting Boolean-type architecture by checking one by one a number of possible routes. In this work, we describe a special type of hardware for the TSP solution. It is a magnonic combinatorial device comprising magnetic and electric parts connected in the active ring circuit. There is a number of possible propagation routes in the magnetic mesh made of phase shifters, frequency filters, and attenuators. The phase shifters mimic cities in TSP while the distance between the cities is encoded in the signal attenuation. The set of frequency filters makes the waves on different frequencies propagate through the different rou

SUBMITTER: Balinskyy M 

PROVIDER: S-EPMC10359328 | biostudies-literature | 2023 Jul

REPOSITORIES: biostudies-literature