174 related articles for article (PubMed ID: 17278563)
1. 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]
2. 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]
3. 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]
4. 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]
5. Evolutionary algorithms refining a heuristic: a hybrid method for shared-path protections in WDM networks under SRLG constraints.
Zhang Q; Sun J; Xiao G; Tsang E
IEEE Trans Syst Man Cybern B Cybern; 2007 Feb; 37(1):51-61. PubMed ID: 17278558
[TBL] [Abstract][Full Text] [Related]
6. On the hybridization of memetic algorithms with branch-and-bound techniques.
Gallardo JE; Cotta C; Fernández AJ
IEEE Trans Syst Man Cybern B Cybern; 2007 Feb; 37(1):77-83. PubMed ID: 17278561
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. A memetic algorithm for VLSI floorplanning.
Tang M; Yao X
IEEE Trans Syst Man Cybern B Cybern; 2007 Feb; 37(1):62-9. PubMed ID: 17278559
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. Coevolving memetic algorithms: a review and progress report.
Smith JE
IEEE Trans Syst Man Cybern B Cybern; 2007 Feb; 37(1):6-17. PubMed ID: 17278554
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. Wrapper-filter feature selection algorithm using a memetic framework.
Zhu Z; Ong YS; Dash M
IEEE Trans Syst Man Cybern B Cybern; 2007 Feb; 37(1):70-6. PubMed ID: 17278560
[TBL] [Abstract][Full Text] [Related]
13. A multiobjective memetic algorithm based on particle swarm optimization.
Liu D; Tan KC; Goh CK; Ho WK
IEEE Trans Syst Man Cybern B Cybern; 2007 Feb; 37(1):42-50. PubMed ID: 17278557
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. 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]
16. A memetic algorithm for multiple-drug cancer chemotherapy schedule optimization.
Tse SM; Liang Y; Leung KS; Lee KH; Mok TS
IEEE Trans Syst Man Cybern B Cybern; 2007 Feb; 37(1):84-91. PubMed ID: 17278562
[TBL] [Abstract][Full Text] [Related]
17. A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model.
Zhang Z; Gao C; Liu Y; Qian T
Bioinspir Biomim; 2014 Sep; 9(3):036006. PubMed ID: 24613939
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. An effective PSO-based memetic algorithm for flow shop scheduling.
Liu B; Wang L; Jin YH
IEEE Trans Syst Man Cybern B Cybern; 2007 Feb; 37(1):18-27. PubMed ID: 17278555
[TBL] [Abstract][Full Text] [Related]
20. 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]
[Next] [New Search]
