Improving the Optimal Solution to the Travelling Salesman Problem in NP-Blockchain using Dynamic Programming Method

NP-Blockchain is a new technology based on Bitcoin cryptocurrency, which is used to find the optimal solution to NP-Hard problems, including the Travelling Salesman Problem (TSP). In this Blockchain, using the participation of miners, attempts are made to find the optimal solution, or a near-optimal solution, and it is used practically in areas such as reducing the transportation cost of online stores to deliver orders to customers. Despite its high potential for generating optimal solutions, it opens new perspectives for researchers to use NP-Blockchain. In this paper, we intend to use the dynamic programming method to reduce the number of searchable sequence spaces and thus increase the probability of finding the optimal solution. This causes the researchers to be more motivated to investigate and use the new introduced Blockchain.

Keywords:

NP-Blockchain , TSP , Online Stores , Bitcoin , Cryptocurrency