Asymmetric TSP is a type of TSP that is on a directed graph which means paths may not exist in both directions between nodes or the distances might be different. Based on simulated annealing, this ...
Abstract: Nowadays, with the increase of e-commerce sites, the cargo sector has been growing rapidly. Also, the pandemic process in consequence of COVID-19 virus in the world shows that cargo ...
For example, the European Commission is looking at an error-correcting code known as the McEliece cryptosystem. Developed more than 40 years ago by American engineer Robert McEliece, this system uses ...
We introduce a method for solving a quadratic unconstrained binary optimization (QUBO) with the two-way one-hot constraints by dividing the QUBO into parts and solving it with an Ising machine. The ...
The travelling salesman problem (TSP) can be stated as follows: "A traveling salesman wants to visit each of $n$ cities exactly once and return to his starting point ...
Abstract: Ant colony optimization (ACO) is a new heuristic algorithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results