166 related articles for article (PubMed ID: 19095545)
1. Multiagent optimization system for solving the traveling salesman problem (TSP).
Xie XF; Liu J
IEEE Trans Syst Man Cybern B Cybern; 2009 Apr; 39(2):489-502. PubMed ID: 19095545
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. Predatory search algorithm with restriction of solution distance.
Liu C; Wang D
Biol Cybern; 2005 May; 92(5):293-302. PubMed ID: 15838682
[TBL] [Abstract][Full Text] [Related]
4. 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]
5. 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]
6. A neural-network-based approach to the double traveling salesman problem.
Plebe A; Anile AM
Neural Comput; 2002 Feb; 14(2):437-71. PubMed ID: 11802920
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. Implementation of an effective hybrid GA for large-scale traveling salesman problems.
Nguyen HD; Yoshihara I; Yamamori K; Yasunaga M
IEEE Trans Syst Man Cybern B Cybern; 2007 Feb; 37(1):92-9. PubMed ID: 17278563
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. A global repair operator for capacitated arc routing problem.
Mei Y; Tang K; Yao X
IEEE Trans Syst Man Cybern B Cybern; 2009 Jun; 39(3):723-34. PubMed ID: 19211356
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. 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]
13. Mathematical improvement of the Hopfield model for feasible solutions to the traveling salesman problem by a synapse dynamical system.
Takahashi Y
IEEE Trans Syst Man Cybern B Cybern; 1998; 28(6):906-19. PubMed ID: 18256012
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. 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]
16. Ant system: optimization by a colony of cooperating agents.
Dorigo M; Maniezzo V; Colorni A
IEEE Trans Syst Man Cybern B Cybern; 1996; 26(1):29-41. PubMed ID: 18263004
[TBL] [Abstract][Full Text] [Related]
17. A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem.
Jiang ZB; Yang Q
PLoS One; 2016; 11(11):e0165804. PubMed ID: 27812175
[TBL] [Abstract][Full Text] [Related]
18. Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.
Nallaperuma S; Neumann F; Sudholt D
Evol Comput; 2017; 25(4):673-705. PubMed ID: 27893278
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. 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]
[Next] [New Search]
