• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

将区块链的工作量证明机制应用于多个旅行商问题的优化。

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

作者信息

Sabry Nareman, Shabana Bahaa, Handosa Mohamed, Rashad M Z

机构信息

Department of Computer Science, Faculty of Computers and Information, Mansoura University, Mansoura, 35516, Egypt.

Computer Science Department, Misr Higher Institute for Commerce and Computers, Mansoura, Egypt.

出版信息

Sci Rep. 2023 Sep 6;13(1):14676. doi: 10.1038/s41598-023-41536-0.

DOI:10.1038/s41598-023-41536-0
PMID:37673897
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC10482856/
Abstract

The blockchain network uses a Proof-of-Work (PoW) mechanism to validate transactions and keep the blockchain growth safe against tampering, but it is hugely energy-consuming with no benefit to the peer-to-peer network participants. In this paper, we proposed a blockchain network for distributing products to different locations based on the use of the Proof of Useful Work mechanism, in which miners use computing resources to optimize the traveling salesman problem (TSP) as an alternative to solving mathematical problems that represent the basis of the traditional PoW mechanism to get a new block. According to this proposed blockchain, it not only receives and securely stores the distribution locations but also improves the paths for salesmen when traveling between different locations during the transportation process. This strategy aims to take advantage of the miners' efforts to minimize the traveled distance by applying the clustering technique and computing the shortest path by Guided Local Search (GLS) for each cluster at the same time. According to the tested results on TSP-LIB instances, the used strategy works efficiently with an average of 0.08 compared to the rest of the meta-heuristics, and the proposed architecture reduced total distances with an average of 0.025%. In addition, the block generation time in the blockchain decreased by 11.11% compared to other works.

摘要

区块链网络使用工作量证明(PoW)机制来验证交易,并确保区块链的增长安全不被篡改,但它消耗大量能源,对对等网络参与者没有任何好处。在本文中,我们提出了一种基于有用工作量证明机制的区块链网络,用于将产品分发到不同地点,其中矿工使用计算资源来优化旅行商问题(TSP),以替代解决代表传统PoW机制基础的数学问题来获取新块。根据这个提议的区块链,它不仅接收并安全存储分发地点,还在运输过程中改进了推销员在不同地点之间旅行的路径。该策略旨在利用矿工的努力,通过应用聚类技术并同时为每个聚类通过引导式局部搜索(GLS)计算最短路径,来最小化旅行距离。根据在TSP-LIB实例上的测试结果,与其他元启发式算法相比,所使用的策略平均以0.08的效率运行,并且所提议的架构平均减少了0.025%的总距离。此外,与其他工作相比,区块链中的块生成时间减少了11.11%。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/8d67666cb262/41598_2023_41536_Fig8_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/aa99b2477ff0/41598_2023_41536_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/c09dcc26232d/41598_2023_41536_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/1ec149b0b488/41598_2023_41536_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/1035df75286e/41598_2023_41536_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/7c252fef29b3/41598_2023_41536_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/221c73a5fed3/41598_2023_41536_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/253c1f689233/41598_2023_41536_Fig7_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/8d67666cb262/41598_2023_41536_Fig8_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/aa99b2477ff0/41598_2023_41536_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/c09dcc26232d/41598_2023_41536_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/1ec149b0b488/41598_2023_41536_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/1035df75286e/41598_2023_41536_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/7c252fef29b3/41598_2023_41536_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/221c73a5fed3/41598_2023_41536_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/253c1f689233/41598_2023_41536_Fig7_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/df1c/10482856/8d67666cb262/41598_2023_41536_Fig8_HTML.jpg

相似文献

1
Adapting blockchain's proof-of-work mechanism for multiple traveling salesmen problem optimization.将区块链的工作量证明机制应用于多个旅行商问题的优化。
Sci Rep. 2023 Sep 6;13(1):14676. doi: 10.1038/s41598-023-41536-0.
2
Solving the Min-Max Clustered Traveling Salesmen Problem Based on Genetic Algorithm.基于遗传算法求解最小-最大聚类旅行商问题
Biomimetics (Basel). 2023 Jun 6;8(2):238. doi: 10.3390/biomimetics8020238.
3
SimBlock Simulator Enhancement with Difficulty Level Algorithm Based on Proof-of-Work Consensus for Lightweight Blockchain.基于工作量证明共识的难度级别算法增强 SimBlock 模拟器用于轻量级区块链
Sensors (Basel). 2022 Nov 22;22(23):9057. doi: 10.3390/s22239057.
4
Sharding-Based Proof-of-Stake Blockchain Protocols: Key Components & Probabilistic Security Analysis.基于分片的权益证明区块链协议:关键组件与概率安全分析。
Sensors (Basel). 2023 Mar 4;23(5):2819. doi: 10.3390/s23052819.
5
Trusted Data Analysis and Consensus Mechanism of Product Traceability Based on Blockchain.基于区块链的产品可追溯性可信数据分析与共识机制。
Comput Intell Neurosci. 2022 Aug 27;2022:3035231. doi: 10.1155/2022/3035231. eCollection 2022.
6
FAWPA: A FAW Attack Protection Algorithm Based on the Behavior of Blockchain Miners.FAWPA:一种基于区块链矿工行为的 FAW 攻击保护算法。
Sensors (Basel). 2022 Jul 4;22(13):5032. doi: 10.3390/s22135032.
7
Solving the clustered traveling salesman problem traveling salesman problem methods.解决聚类旅行商问题的旅行商问题方法。
PeerJ Comput Sci. 2022 Jun 13;8:e972. doi: 10.7717/peerj-cs.972. eCollection 2022.
8
Blockchain and K-Means Algorithm for Edge AI Computing.区块链和 K-Means 算法在边缘人工智能计算中的应用。
Comput Intell Neurosci. 2022 May 29;2022:1153208. doi: 10.1155/2022/1153208. eCollection 2022.
9
Research on improved ant colony optimization for traveling salesman problem.旅行商问题的改进蚁群优化算法研究。
Math Biosci Eng. 2022 Jun 6;19(8):8152-8186. doi: 10.3934/mbe.2022381.
10
Vervet monkey (Chlorocebus pygerythrus) behavior in a multi-destination route: Evidence for planning ahead when heuristics fail.长尾猕猴(Chlorocebus pygerythrus)在多目的地路线中的行为:启发式失败时提前计划的证据。
PLoS One. 2018 May 29;13(5):e0198076. doi: 10.1371/journal.pone.0198076. eCollection 2018.

本文引用的文献

1
Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic.通过聚类和改进的多重启迭代局部搜索元启发式解决旅行商问题。
PLoS One. 2018 Aug 22;13(8):e0201868. doi: 10.1371/journal.pone.0201868. eCollection 2018.