188 related articles for article (PubMed ID: 36093485)
1. A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model.
Wang Z; Wu X; Wu T
Comput Intell Neurosci; 2022; 2022():1450756. PubMed ID: 36093485
[TBL] [Abstract][Full Text] [Related]
2. Solving the Family Traveling Salesperson Problem in the Adleman-Lipton Model Based on DNA Computing.
Wu X; Wang Z; Wu T; Bao X
IEEE Trans Nanobioscience; 2022 Jan; 21(1):75-85. PubMed ID: 34460379
[TBL] [Abstract][Full Text] [Related]
3. A novel bio-heuristic computing algorithm to solve the capacitated vehicle routing problem based on Adleman-Lipton model.
Wang Z; Ren X; Ji Z; Huang W; Wu T
Biosystems; 2019 Oct; 184():103997. PubMed ID: 31369836
[TBL] [Abstract][Full Text] [Related]
4. A Novel Algorithm for Solving the Prize Collecting Traveling Salesman Problem Based on DNA Computing.
Wang ZC; Liang K; Bao XG; Wu TH
IEEE Trans Nanobioscience; 2024 Apr; 23(2):220-232. PubMed ID: 37607150
[TBL] [Abstract][Full Text] [Related]
5. A parallel algorithm for solving the n-queens problem based on inspired computational model.
Wang Z; Huang D; Tan J; Liu T; Zhao K; Li L
Biosystems; 2015 May; 131():22-9. PubMed ID: 25817410
[TBL] [Abstract][Full Text] [Related]
6. Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm.
Liu G; Xu X; Wang F; Tang Y
Comput Intell Neurosci; 2022; 2022():1008617. PubMed ID: 35463281
[TBL] [Abstract][Full Text] [Related]
7. A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model.
Wang Z; Ji Z; Wang X; Wu T; Huang W
Biosystems; 2017 Dec; 162():59-65. PubMed ID: 28890344
[TBL] [Abstract][Full Text] [Related]
8. Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem.
Qian W; Basili RAM; Eshaghian-Wilner MM; Khokhar A; Luecke G; Vary JP
Entropy (Basel); 2023 Aug; 25(8):. PubMed ID: 37628268
[TBL] [Abstract][Full Text] [Related]
9. A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model.
Tian X; Liu X; Zhang H; Sun M; Zhao Y
PLoS One; 2020; 15(12):e0242083. PubMed ID: 33264317
[TBL] [Abstract][Full Text] [Related]
10. A general resolution of intractable problems in polynomial time through DNA Computing.
Sanches CA; Soma NY
Biosystems; 2016 Dec; 150():119-131. PubMed ID: 27693626
[TBL] [Abstract][Full Text] [Related]
11. Research on improved ant colony optimization for traveling salesman problem.
Fei T; Wu X; Zhang L; Zhang Y; Chen L
Math Biosci Eng; 2022 Jun; 19(8):8152-8186. PubMed ID: 35801461
[TBL] [Abstract][Full Text] [Related]
12. A deep reinforcement learning algorithm framework for solving multi-objective traveling salesman problem based on feature transformation.
Zhao S; Gu S
Neural Netw; 2024 Aug; 176():106359. PubMed ID: 38733797
[TBL] [Abstract][Full Text] [Related]
13. Solving the clustered traveling salesman problem
Lu Y; Hao JK; Wu Q
PeerJ Comput Sci; 2022; 8():e972. PubMed ID: 35721414
[TBL] [Abstract][Full Text] [Related]
14. A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application.
Miao K; Duan H; Qian F; Dong Y
PLoS One; 2019; 14(4):e0215107. PubMed ID: 30995233
[TBL] [Abstract][Full Text] [Related]
15. Parallelizing Assignment Problem with DNA Strands.
Khorsand B; Savadi A; Naghibzadeh M
Iran J Biotechnol; 2020 Jan; 18(1):e2547. PubMed ID: 32884959
[TBL] [Abstract][Full Text] [Related]
16. Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.
Hussain A; Muhammad YS; Nauman Sajid M; Hussain I; Mohamd Shoukry A; Gani S
Comput Intell Neurosci; 2017; 2017():7430125. PubMed ID: 29209364
[TBL] [Abstract][Full Text] [Related]
17. Circular Jaccard distance based multi-solution optimization for traveling salesman problems.
Li H; Zhang M; Zeng C
Math Biosci Eng; 2022 Mar; 19(5):4458-4480. PubMed ID: 35430823
[TBL] [Abstract][Full Text] [Related]
18. Solving the Min-Max Clustered Traveling Salesmen Problem Based on Genetic Algorithm.
Bao X; Wang G; Xu L; Wang Z
Biomimetics (Basel); 2023 Jun; 8(2):. PubMed ID: 37366833
[TBL] [Abstract][Full Text] [Related]
19. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
Wang Z; Huang D; Meng H; Tang C
Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
[TBL] [Abstract][Full Text] [Related]
20. Dynamic sub-route-based self-adaptive beam search Q-learning algorithm for traveling salesman problem.
Zhang J; Liu Q; Han X
PLoS One; 2023; 18(3):e0283207. PubMed ID: 36943840
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
