246 related articles for article (PubMed ID: 27034650)
41. 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]
42. Training simultaneous recurrent neural network with resilient propagation for static optimization.
Serpen G; Corra J
Int J Neural Syst; 2002; 12(3-4):203-18. PubMed ID: 12370962
[TBL] [Abstract][Full Text] [Related]
43. Dynamic sub-route-based self-adaptive beam search Q-learning algorithm for traveling salesman problem.
Zhang J; Liu Q; Han X
PLoS One; 2023; 18(3):e0283207. PubMed ID: 36943840
[TBL] [Abstract][Full Text] [Related]
44. Characterization of the probabilistic traveling salesman problem.
Bowler NE; Fink TM; Ball RC
Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Sep; 68(3 Pt 2):036703. PubMed ID: 14524922
[TBL] [Abstract][Full Text] [Related]
45. An adaptive evolutionary multi-objective approach based on simulated annealing.
Li H; Landa-Silva D
Evol Comput; 2011; 19(4):561-95. PubMed ID: 21417745
[TBL] [Abstract][Full Text] [Related]
46. 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]
47. Comparison of simulated annealing and mean field annealing as applied to the generation of block designs.
Bofill P; Guimerà R; Torras C
Neural Netw; 2003 Dec; 16(10):1421-8. PubMed ID: 14622874
[TBL] [Abstract][Full Text] [Related]
48. Modified Backtracking Search Optimization Algorithm Inspired by Simulated Annealing for Constrained Engineering Optimization Problems.
Wang H; Hu Z; Sun Y; Su Q; Xia X
Comput Intell Neurosci; 2018; 2018():9167414. PubMed ID: 29666635
[TBL] [Abstract][Full Text] [Related]
49. 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]
50. A deterministic annealing algorithm for approximating a solution of the min-bisection problem.
Dang C; Ma W; Liang J
Neural Netw; 2009 Jan; 22(1):58-66. PubMed ID: 18995985
[TBL] [Abstract][Full Text] [Related]
51. 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]
52. Solving the Min-Max Clustered Traveling Salesmen Problem Based on Genetic Algorithm.
Bao X; Wang G; Xu L; Wang Z
Biomimetics (Basel); 2023 Jun; 8(2):. PubMed ID: 37366833
[TBL] [Abstract][Full Text] [Related]
53. Multiple sequence alignment by parallel simulated annealing.
Ishikawa M; Toya T; Hoshida M; Nitta K; Ogiwara A; Kanehisa M
Comput Appl Biosci; 1993 Jun; 9(3):267-73. PubMed ID: 8324627
[TBL] [Abstract][Full Text] [Related]
54. Discrete Salp Swarm Algorithm for symmetric traveling salesman problem.
Chen P; Liu M; Zhou S
Math Biosci Eng; 2023 Mar; 20(5):8856-8874. PubMed ID: 37161225
[TBL] [Abstract][Full Text] [Related]
55. 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]
56. Improved slime mould algorithm based on hybrid strategy optimization of Cauchy mutation and simulated annealing.
Zhang X; Liu Q; Bai X
PLoS One; 2023; 18(1):e0280512. PubMed ID: 36696386
[TBL] [Abstract][Full Text] [Related]
57. 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]
58. Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling salesman problem.
Fort JC
Biol Cybern; 1988; 59(1):33-40. PubMed ID: 3401516
[TBL] [Abstract][Full Text] [Related]
59. Temperature control for simulated annealing.
Munakata T; Nakamura Y
Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Oct; 64(4 Pt 2):046127. PubMed ID: 11690110
[TBL] [Abstract][Full Text] [Related]
60. A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem.
Dang C; Liang J; Yang Y
Neural Netw; 2013 Mar; 39():1-11. PubMed ID: 23296021
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
