A Pigeon Group Decomposition Based Algorithm for Logistics Service Transaction Matching Under Blockchain

Abstract

The transmission security problem in the industrial Internet of Things is the focus of industrial manufacturing development. Blockchain technology can well solve this problem. The massive data generated in the Industrial Internet of Things will be transmitted to the blockchain system through the gateway, the throughput and deployment costs need to be considered. This paper proposes a pigeon flock algorithm based on decomposition to solve this problem. It uses the excellent navigation ability of carrier pigeons to improve search efficiency. At the same time, two independent archives are used to balance convergence and diversity. After the solution set in the convergence archives is classified, the solution set is evaluated by the Tchebycheff function, and some better solutions are retained. The diversity archive chooses some solutions that are quite different from other solutions to maintain diversity. This article uses this algorithm to obtain the solutions with low throughput and high deployment when the blockchain is implemented in the Industrial Internet of Things. Finally, 7 questions in the DTLZ test question are selected to prove the validity of the proposed algorithm. These questions have 5, 10, and 15 goals. In the experimental results, it can be seen that the proposed algorithm is better than NSGAIII, MOEADD and NSGAII on most of the test problems.