Adapting blockchain's proof-of-work mechanism for multiple traveling salesmen problem optimization

Area of Science:

• Computer Science
• Operations Research
• Supply Chain Management

Background:

• Traditional Proof-of-Work (PoW) blockchains are energy-intensive and offer no direct benefit to network participants.
• Existing logistics and distribution networks face challenges in optimizing delivery routes and managing data securely.

Purpose of the Study:

• To propose an energy-efficient blockchain network utilizing Proof of Useful Work (PoUW) for product distribution.
• To integrate optimization techniques for enhancing delivery routes and reducing travel distances.

Main Methods:

• Developed a PoUW blockchain where miners solve the Traveling Salesman Problem (TSP) instead of traditional mathematical problems.
• Employed clustering techniques and Guided Local Search (GLS) to compute shortest paths for distribution routes.
• Tested the proposed architecture on TSP-LIB instances.

Main Results:

• The PoUW mechanism achieved an average efficiency of 0.08 compared to other meta-heuristics.
• The proposed architecture reduced total travel distances by an average of 0.025%.
• Block generation time decreased by 11.11% compared to existing methods.

Conclusions:

• The Proof of Useful Work blockchain offers a more sustainable and efficient alternative to traditional PoW for logistics and product distribution.
• Integrating TSP optimization into blockchain technology significantly improves route efficiency and reduces operational costs.
• This approach enhances the security and data management capabilities of distribution networks while minimizing environmental impact.