246 related articles for article (PubMed ID: 27034650)
21. Generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining.
Wu C; Liang Y; Lee HP; Lu C
Phys Rev E Stat Nonlin Soft Matter Phys; 2004; 70(1 Pt 2):016701. PubMed ID: 15324198
[TBL] [Abstract][Full Text] [Related]
22. Efficient constraint handling in electromagnetism-like algorithm for traveling salesman problem with time windows.
Yurtkuran A; Emel E
ScientificWorldJournal; 2014; 2014():871242. PubMed ID: 24723834
[TBL] [Abstract][Full Text] [Related]
23. Selection of an optimal neural network architecture for computer-aided detection of microcalcifications--comparison of automated optimization techniques.
Gurcan MN; Sahiner B; Chan HP; Hadjiiski L; Petrick N
Med Phys; 2001 Sep; 28(9):1937-48. PubMed ID: 11585225
[TBL] [Abstract][Full Text] [Related]
24. 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]
25. An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem.
Jin HD; Leung KS; Wong ML; Xu ZB
IEEE Trans Syst Man Cybern B Cybern; 2003; 33(6):877-88. PubMed ID: 18238240
[TBL] [Abstract][Full Text] [Related]
26. 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]
27. Parameter setting of the Hopfield network applied to TSP.
Talaván PM; Yáñez J
Neural Netw; 2002 Apr; 15(3):363-73. PubMed ID: 12125891
[TBL] [Abstract][Full Text] [Related]
28. Solving the TSP by the AALHNN algorithm.
Hu Y; Duan Q
Math Biosci Eng; 2022 Jan; 19(4):3427-3448. PubMed ID: 35341258
[TBL] [Abstract][Full Text] [Related]
29. Stability analysis of higher-order neural networks for combinatorial optimization.
Cooper B
Int J Neural Syst; 2002; 12(3-4):177-86. PubMed ID: 12370960
[TBL] [Abstract][Full Text] [Related]
30. Evaluation of the physical annealing strategy for simulated annealing: a function-based analysis in the landscape paradigm.
Hasegawa M
Phys Rev E Stat Nonlin Soft Matter Phys; 2012 May; 85(5 Pt 2):056704. PubMed ID: 23004900
[TBL] [Abstract][Full Text] [Related]
31. The simultaneous recurrent neural network for addressing the scaling problem in static optimization.
Serpen G; Patwardhan A; Geib J
Int J Neural Syst; 2001 Oct; 11(5):477-87. PubMed ID: 11709814
[TBL] [Abstract][Full Text] [Related]
32. Memory-efficient Transformer-based network model for Traveling Salesman Problem.
Yang H; Zhao M; Yuan L; Yu Y; Li Z; Gu M
Neural Netw; 2023 Apr; 161():589-597. PubMed ID: 36822144
[TBL] [Abstract][Full Text] [Related]
33. Differential Cloud Particles Evolution Algorithm Based on Data-Driven Mechanism for Applications of ANN.
Li W
Comput Intell Neurosci; 2017; 2017():8469103. PubMed ID: 28761438
[TBL] [Abstract][Full Text] [Related]
34. A medical diagnostic tool based on radial basis function classifiers and evolutionary simulated annealing.
Alexandridis A; Chondrodima E
J Biomed Inform; 2014 Jun; 49():61-72. PubMed ID: 24662274
[TBL] [Abstract][Full Text] [Related]
35. The generalized quadratic knapsack problem. A neuronal network approach.
Talaván PM; Yáñez J
Neural Netw; 2006 May; 19(4):416-28. PubMed ID: 16488117
[TBL] [Abstract][Full Text] [Related]
36. A Self-Adaptive Discrete PSO Algorithm with Heterogeneous Parameter Values for Dynamic TSP.
Strąk Ł; Skinderowicz R; Boryczka U; Nowakowski A
Entropy (Basel); 2019 Jul; 21(8):. PubMed ID: 33267452
[TBL] [Abstract][Full Text] [Related]
37. Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem.
Ezugwu AE; Akutsah F; Olusanya MO; Adewumi AO
PLoS One; 2018; 13(3):e0193751. PubMed ID: 29554662
[TBL] [Abstract][Full Text] [Related]
38. 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]
39. A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes.
Lee I; Sikora R; Shaw MJ
IEEE Trans Syst Man Cybern B Cybern; 1997; 27(1):36-54. PubMed ID: 18255838
[TBL] [Abstract][Full Text] [Related]
40. 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]
[Previous] [Next] [New Search]
