探索 DNA 计算在解决复杂大数据问题方面的潜力:旅行租车问题案例研究》。

IF 3.7 4区 生物学 Q1 BIOCHEMICAL RESEARCH METHODS IEEE Transactions on NanoBioscience Pub Date : 2024-03-06 DOI:10.1109/TNB.2024.3396142
Zhao-Cai Wang;Xian Wu;Kun Liang;Tun-Hua Wu
{"title":"探索 DNA 计算在解决复杂大数据问题方面的潜力:旅行租车问题案例研究》。","authors":"Zhao-Cai Wang;Xian Wu;Kun Liang;Tun-Hua Wu","doi":"10.1109/TNB.2024.3396142","DOIUrl":null,"url":null,"abstract":"The traveling car renter problem (TCRP) is a variant of the Traveling Salesman Problem (TSP) wherein the salesman utilizes rented cars for travel. The primary objective of this problem is to identify a solution that minimizes the cumulative operating costs. Given its classification as a non-deterministic polynomial (NP) problem, traditional computers are not proficient in effectively resolving it. Conversely, DNA computing exhibits unparalleled advantages when confronted with NP-hard problems. This paper presents a DNA algorithm, based on the Adleman-Lipton model, as a proposed approach to address TCRP. The solution for TCRP can be acquired by following a series of fundamental steps, including coding, interaction, and extraction. The time computing complexity of the proposed DNA algorithm is \n<inline-formula> <tex-math>$\\boldsymbol {O}(\\boldsymbol {n}^{\\boldsymbol {2}}\\boldsymbol {m})$ </tex-math></inline-formula>\n for TCRP with n cities and m types of cars. By conducting simulation experiments, the solutions for certain instances of TCRP are computed and compared to those obtained by alternative algorithms. The proposed algorithm further illustrates the potential of DNA computing, as a form of parallel computing, to address more intricate large-scale problems.","PeriodicalId":13264,"journal":{"name":"IEEE Transactions on NanoBioscience","volume":"23 3","pages":"391-402"},"PeriodicalIF":3.7000,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Exploring the Potential of DNA Computing for Complex Big Data Problems: A Case Study on the Traveling Car Renter Problem\",\"authors\":\"Zhao-Cai Wang;Xian Wu;Kun Liang;Tun-Hua Wu\",\"doi\":\"10.1109/TNB.2024.3396142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The traveling car renter problem (TCRP) is a variant of the Traveling Salesman Problem (TSP) wherein the salesman utilizes rented cars for travel. The primary objective of this problem is to identify a solution that minimizes the cumulative operating costs. Given its classification as a non-deterministic polynomial (NP) problem, traditional computers are not proficient in effectively resolving it. Conversely, DNA computing exhibits unparalleled advantages when confronted with NP-hard problems. This paper presents a DNA algorithm, based on the Adleman-Lipton model, as a proposed approach to address TCRP. The solution for TCRP can be acquired by following a series of fundamental steps, including coding, interaction, and extraction. The time computing complexity of the proposed DNA algorithm is \\n<inline-formula> <tex-math>$\\\\boldsymbol {O}(\\\\boldsymbol {n}^{\\\\boldsymbol {2}}\\\\boldsymbol {m})$ </tex-math></inline-formula>\\n for TCRP with n cities and m types of cars. By conducting simulation experiments, the solutions for certain instances of TCRP are computed and compared to those obtained by alternative algorithms. The proposed algorithm further illustrates the potential of DNA computing, as a form of parallel computing, to address more intricate large-scale problems.\",\"PeriodicalId\":13264,\"journal\":{\"name\":\"IEEE Transactions on NanoBioscience\",\"volume\":\"23 3\",\"pages\":\"391-402\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2024-03-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on NanoBioscience\",\"FirstCategoryId\":\"99\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10520927/\",\"RegionNum\":4,\"RegionCategory\":\"生物学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"BIOCHEMICAL RESEARCH METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on NanoBioscience","FirstCategoryId":"99","ListUrlMain":"https://ieeexplore.ieee.org/document/10520927/","RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BIOCHEMICAL RESEARCH METHODS","Score":null,"Total":0}
引用次数: 0

摘要

旅行汽车租赁问题(TCRP)是旅行推销员问题(TSP)的一种变体,其中推销员利用租赁的汽车进行旅行。该问题的主要目标是找出一个能使累计运营成本最小化的解决方案。鉴于该问题被归类为非确定性多项式 (NP) 问题,传统计算机无法有效解决该问题。相反,DNA 计算在面对 NP 难问题时却表现出无与伦比的优势。本文提出了一种基于 Adleman-Lipton 模型的 DNA 算法,作为解决 TCRP 的建议方法。通过一系列基本步骤,包括编码、交互和提取,可以获得 TCRP 的解决方案。对于有 n 个城市和 m 种汽车的 TCRP,所提出的 DNA 算法的时间计算复杂度为 O(n2m)。通过模拟实验,计算出了 TCRP 某些实例的解决方案,并与其他算法的解决方案进行了比较。所提出的算法进一步说明了 DNA 计算作为并行计算的一种形式,在解决更复杂的大规模问题方面的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Exploring the Potential of DNA Computing for Complex Big Data Problems: A Case Study on the Traveling Car Renter Problem
The traveling car renter problem (TCRP) is a variant of the Traveling Salesman Problem (TSP) wherein the salesman utilizes rented cars for travel. The primary objective of this problem is to identify a solution that minimizes the cumulative operating costs. Given its classification as a non-deterministic polynomial (NP) problem, traditional computers are not proficient in effectively resolving it. Conversely, DNA computing exhibits unparalleled advantages when confronted with NP-hard problems. This paper presents a DNA algorithm, based on the Adleman-Lipton model, as a proposed approach to address TCRP. The solution for TCRP can be acquired by following a series of fundamental steps, including coding, interaction, and extraction. The time computing complexity of the proposed DNA algorithm is $\boldsymbol {O}(\boldsymbol {n}^{\boldsymbol {2}}\boldsymbol {m})$ for TCRP with n cities and m types of cars. By conducting simulation experiments, the solutions for certain instances of TCRP are computed and compared to those obtained by alternative algorithms. The proposed algorithm further illustrates the potential of DNA computing, as a form of parallel computing, to address more intricate large-scale problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on NanoBioscience
IEEE Transactions on NanoBioscience 工程技术-纳米科技
CiteScore
7.00
自引率
5.10%
发文量
197
审稿时长
>12 weeks
期刊介绍: The IEEE Transactions on NanoBioscience reports on original, innovative and interdisciplinary work on all aspects of molecular systems, cellular systems, and tissues (including molecular electronics). Topics covered in the journal focus on a broad spectrum of aspects, both on foundations and on applications. Specifically, methods and techniques, experimental aspects, design and implementation, instrumentation and laboratory equipment, clinical aspects, hardware and software data acquisition and analysis and computer based modelling are covered (based on traditional or high performance computing - parallel computers or computer networks).
期刊最新文献
Electrospun Stannic Oxide Nanofiber Thin-Film Based Sensing Device for Monitoring Functional Behaviours of Adherent Mammalian Cells. "Galaxy" encoding: toward high storage density and low cost. 2024 Index IEEE Transactions on NanoBioscience Vol. 23 Table of Contents Front Cover
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1