Model Enhancement: Improving Optimization for TSP Problem in NP-Blockchain Using Subspace

NP-Blockchain is essentially a newly built method or algorithm based on Bitcoincryptocurrencies, often used to find the optimal solution to difficult polynomial-timeproblems, additionally, one of these major issues is considered to be the traveling salesmanproblem; besides, it is also important to add that a combination of miners are used to figureout the optimal solution or even a solution close to the optimal in this particular blockchain,which can practically be applied in many cases, such as reducing the transportation cost ofonline shops for the delivery of their customer orders. Furthermore, this article also intends toincrease the probability of finding the optimal solution by making certain adjustments to thepreviously modeled salesman problem, these adjustments or changes include thetransformation of the miner’s search space into several subspaces, leading to a reduction inthe number of common sequences produced by the miners, resulting in a greater number ofdistinct sequences being produced and essentially increasing the probability of finding theoptimal sequence overall. Take note that this modified structure can very well be used as amodel for other difficult indefinite polynomial-time problems as well.

کلیدواژه ها:

Blockchain ، Proof-of-work ، TSP ، Bitcoin ، Crypto currency