BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

141 related articles for article (PubMed ID: 37810357)

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

  • 42. On Hierarchical Multi-UAV Dubins Traveling Salesman Problem Paths in a Complex Obstacle Environment.
    Fu J; Sun G; Liu J; Yao W; Wu L
    IEEE Trans Cybern; 2024 Jan; 54(1):123-135. PubMed ID: 37099468
    [TBL] [Abstract][Full Text] [Related]  

  • 43. Path Planning Optimization of Intelligent Vehicle Based on Improved Genetic and Ant Colony Hybrid Algorithm.
    Shi K; Huang L; Jiang D; Sun Y; Tong X; Xie Y; Fang Z
    Front Bioeng Biotechnol; 2022; 10():905983. PubMed ID: 35845413
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Exploration of Joint Optimization and Visualization of Inventory Transportation in Agricultural Logistics Based on Ant Colony Algorithm.
    Dong B; Duan M; Li Y
    Comput Intell Neurosci; 2022; 2022():2041592. PubMed ID: 35755759
    [TBL] [Abstract][Full Text] [Related]  

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

  • 46. A novel approach for solving travelling thief problem using enhanced simulated annealing.
    Ali H; Zaid Rafique M; Shahzad Sarfraz M; Malik MSA; Alqahtani MA; Alqurni JS
    PeerJ Comput Sci; 2021; 7():e377. PubMed ID: 33834093
    [TBL] [Abstract][Full Text] [Related]  

  • 47. Homotopic Convex Transformation: A New Landscape Smoothing Method for the Traveling Salesman Problem.
    Shi J; Sun J; Zhang Q; Ye K
    IEEE Trans Cybern; 2022 Jan; 52(1):495-507. PubMed ID: 32275640
    [TBL] [Abstract][Full Text] [Related]  

  • 48. A Localization Method of Ant Colony Optimization in Nonuniform Space.
    Xu Q; Zhang L; Yu W
    Sensors (Basel); 2022 Sep; 22(19):. PubMed ID: 36236488
    [TBL] [Abstract][Full Text] [Related]  

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

  • 50. Efficient convex-elastic net algorithm to solve the Euclidean traveling salesman problem.
    Al-Mulhem M; Al-Maghrabi T
    IEEE Trans Syst Man Cybern B Cybern; 1998; 28(4):618-20. PubMed ID: 18255981
    [TBL] [Abstract][Full Text] [Related]  

  • 51. An improved ant colony algorithm with diversified solutions based on the immune strategy.
    Qin L; Pan Y; Chen L; Chen Y
    BMC Bioinformatics; 2006 Dec; 7 Suppl 4(Suppl 4):S3. PubMed ID: 17217521
    [TBL] [Abstract][Full Text] [Related]  

  • 52. Chaotic simulated annealing multi-verse optimization enhanced kernel extreme learning machine for medical diagnosis.
    Liu J; Wei J; Heidari AA; Kuang F; Zhang S; Gui W; Chen H; Pan Z
    Comput Biol Med; 2022 May; 144():105356. PubMed ID: 35299042
    [TBL] [Abstract][Full Text] [Related]  

  • 53. Analysis of College Course Scheduling Problem Based on Ant Colony Algorithm.
    Ge R; Chen J
    Comput Intell Neurosci; 2022; 2022():7918323. PubMed ID: 36059409
    [TBL] [Abstract][Full Text] [Related]  

  • 54. Evolutionary algorithms guided by Erdős-Rényi complex networks.
    Bucheli VA; Solarte Pabón O; Ordoñez H
    PeerJ Comput Sci; 2024; 10():e1773. PubMed ID: 38259892
    [TBL] [Abstract][Full Text] [Related]  

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

  • 56. Improved Ant Colony Clustering Algorithm and Its Performance Study.
    Gao W
    Comput Intell Neurosci; 2016; 2016():4835932. PubMed ID: 26839533
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Mobile Robot Path Planning Based on Ant Colony Algorithm With A
    Dai X; Long S; Zhang Z; Gong D
    Front Neurorobot; 2019; 13():15. PubMed ID: 31057388
    [TBL] [Abstract][Full Text] [Related]  

  • 58. A New Generalized Partition Crossover for the Traveling Salesman Problem: Tunneling between Local Optima.
    Tinós R; Whitley D; Ochoa G
    Evol Comput; 2020; 28(2):255-288. PubMed ID: 30900928
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Energy Efficient Hybrid Routing Protocol Based on the Artificial Fish Swarm Algorithm and Ant Colony Optimisation for WSNs.
    Li X; Keegan B; Mtenzi F
    Sensors (Basel); 2018 Oct; 18(10):. PubMed ID: 30297606
    [TBL] [Abstract][Full Text] [Related]  

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

    [Previous]   [Next]    [New Search]
    of 8.