359 related articles for article (PubMed ID: 31369836)
1. 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]
2. 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]
3. 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]
4. 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]
5. 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]
6. 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]
7. 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]
8. Exploring the Potential of DNA Computing for Complex Big Data Problems: A Case Study on the Traveling Car Renter Problem.
Wang ZC; Wu X; Liang K; Wu TH
IEEE Trans Nanobioscience; 2024 Jul; 23(3):391-402. PubMed ID: 38709614
[TBL] [Abstract][Full Text] [Related]
9. Genetic Programming Hyper-Heuristics with Vehicle Collaboration for Uncertain Capacitated Arc Routing Problems.
MacLachlan J; Mei Y; Branke J; Zhang M
Evol Comput; 2020; 28(4):563-593. PubMed ID: 31730372
[TBL] [Abstract][Full Text] [Related]
10. A multiobjective model for the green capacitated location-routing problem considering drivers' satisfaction and time window with uncertain demand.
Alamatsaz K; Ahmadi A; Mirzapour Al-E-Hashem SMJ
Environ Sci Pollut Res Int; 2022 Jan; 29(4):5052-5071. PubMed ID: 34415526
[TBL] [Abstract][Full Text] [Related]
11. Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model.
Chang WL; Guo M
Biosystems; 2003 Dec; 72(3):263-75. PubMed ID: 14643494
[TBL] [Abstract][Full Text] [Related]
12. K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks.
He Y; Liu Z; Shi J; Wang Y; Zhang J; Liu J
PLoS One; 2015; 10(7):e0131962. PubMed ID: 26226109
[TBL] [Abstract][Full Text] [Related]
13. Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing.
Guo M; Chang WL; Ho M; Lu J; Cao J
Biosystems; 2005 Apr; 80(1):71-82. PubMed ID: 15740836
[TBL] [Abstract][Full Text] [Related]
14. Hybrid modified ant system with sweep algorithm and path relinking for the capacitated vehicle routing problem.
Thammano A; Rungwachira P
Heliyon; 2021 Sep; 7(9):e08029. PubMed ID: 34622046
[TBL] [Abstract][Full Text] [Related]
15. A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem.
Dalbah LM; Al-Betar MA; Awadallah MA; Zitar RA
J King Saud Univ Comput Inf Sci; 2022 Sep; 34(8):4782-4795. PubMed ID: 37520767
[TBL] [Abstract][Full Text] [Related]
16. Solving maximum cut problems in the Adleman-Lipton model.
Xiao D; Li W; Zhang Z; He L
Biosystems; 2005 Dec; 82(3):203-7. PubMed ID: 16236426
[TBL] [Abstract][Full Text] [Related]
17. Solving satisfiability problems using a novel microarray-based DNA computer.
Lin CH; Cheng HP; Yang CB; Yang CN
Biosystems; 2007; 90(1):242-52. PubMed ID: 17029765
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. Fast parallel DNA-based algorithms for molecular computation: the set-partition problem.
Chang WL
IEEE Trans Nanobioscience; 2007 Dec; 6(4):346-53. PubMed ID: 18217628
[TBL] [Abstract][Full Text] [Related]
20. A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack-From a Green Operation Perspective.
Xia Y; Fu Z; Tsai SB; Wang J
Int J Environ Res Public Health; 2018 May; 15(5):. PubMed ID: 29747469
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
