126 related articles for article (PubMed ID: 37607150)
1. 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]
2. 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]
3. 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]
4. 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]
5. 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]
6. Precedence-Constrained Colored Traveling Salesman Problem: An Augmented Variable Neighborhood Search Approach.
Xu X; Li J; Zhou M; Yu X
IEEE Trans Cybern; 2022 Sep; 52(9):9797-9808. PubMed ID: 34033558
[TBL] [Abstract][Full Text] [Related]
7. A CLIQUE algorithm using DNA computing techniques based on closed-circle DNA sequences.
Zhang H; Liu X
Biosystems; 2011 Jul; 105(1):73-82. PubMed ID: 21511001
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. 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]
10. 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]
11. Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem.
Contreras-Bolton C; Parada V
PLoS One; 2015; 10(9):e0137724. PubMed ID: 26367182
[TBL] [Abstract][Full Text] [Related]
12. Solving traveling salesman problems with DNA molecules encoding numerical values.
Lee JY; Shin SY; Park TH; Zhang BT
Biosystems; 2004 Dec; 78(1-3):39-47. PubMed ID: 15555757
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. 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]
15. Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks.
Mulder SA; Wunsch DC
Neural Netw; 2003; 16(5-6):827-32. PubMed ID: 12850040
[TBL] [Abstract][Full Text] [Related]
16. Solving optimization problems simultaneously: the variants of the traveling salesman problem with time windows using multifactorial evolutionary algorithm.
Ban HB; Pham DH
PeerJ Comput Sci; 2023; 9():e1192. PubMed ID: 37346673
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. 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]
19. Annealing Ant Colony Optimization with Mutation Operator for Solving TSP.
Mohsen AM
Comput Intell Neurosci; 2016; 2016():8932896. PubMed ID: 27999590
[TBL] [Abstract][Full Text] [Related]
20. A three-phase algorithm for the pollution traveling Salesman problem.
García-Vasquez K; Linfati R; Escobar JW
Heliyon; 2024 May; 10(9):e29958. PubMed ID: 38694131
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
