BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

129 related articles for article (PubMed ID: 38392165)

  • 1. A New Approach Based on Collective Intelligence to Solve Traveling Salesman Problems.
    Kiran MS; Beskirli M
    Biomimetics (Basel); 2024 Feb; 9(2):. PubMed ID: 38392165
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem.
    Dahan F; El Hindi K; Mathkour H; AlSalman H
    Sensors (Basel); 2019 Apr; 19(8):. PubMed ID: 30999688
    [TBL] [Abstract][Full Text] [Related]  

  • 3. 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]  

  • 4. 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]  

  • 5. 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]  

  • 6. A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling Salesman Problem.
    Odili JB; Noraziah A; Zarina M
    Comput Intell Neurosci; 2021; 2021():6625438. PubMed ID: 33986793
    [TBL] [Abstract][Full Text] [Related]  

  • 7. 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]  

  • 8. 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]  

  • 9. 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]  

  • 10. 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]  

  • 11. Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems.
    Mavrovouniotis M; Muller FM; Shengxiang Yang
    IEEE Trans Cybern; 2017 Jul; 47(7):1743-1756. PubMed ID: 27323387
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A solution quality assessment method for swarm intelligence optimization algorithms.
    Zhang Z; Wang GG; Zou K; Zhang J
    ScientificWorldJournal; 2014; 2014():183809. PubMed ID: 25013845
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Multi-Objective Ant Colony Optimization Based on the Physarum-Inspired Mathematical Model for Bi-Objective Traveling Salesman Problems.
    Zhang Z; Gao C; Lu Y; Liu Y; Liang M
    PLoS One; 2016; 11(1):e0146709. PubMed ID: 26751562
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem.
    Stodola P; Michenka K; Nohel J; Rybanský M
    Entropy (Basel); 2020 Aug; 22(8):. PubMed ID: 33286654
    [TBL] [Abstract][Full Text] [Related]  

  • 15. 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]  

  • 16. 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]  

  • 17. An evolutionary algorithm for large traveling salesman problems.
    Tsai HK; Yang JM; Tsai YF; Kao CY
    IEEE Trans Syst Man Cybern B Cybern; 2004 Aug; 34(4):1718-29. PubMed ID: 15462439
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Colored Traveling Salesman Problem.
    Li J; Zhou M; Sun Q; Dai X; Yu X
    IEEE Trans Cybern; 2015 Nov; 45(11):2390-401. PubMed ID: 25494521
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES/spl I.bar/DECOMPOSE.
    Aras N; Altinel IK; Oommen J
    IEEE Trans Neural Netw; 2003; 14(4):869-90. PubMed ID: 18238067
    [TBL] [Abstract][Full Text] [Related]  

  • 20. 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]  

    [Next]    [New Search]
    of 7.