344 related articles for article (PubMed ID: 18263004)
1. 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]
2. 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]
3. Annealing Ant Colony Optimization with Mutation Operator for Solving TSP.
Mohsen AM
Comput Intell Neurosci; 2016; 2016():8932896. PubMed ID: 27999590
[TBL] [Abstract][Full Text] [Related]
4. Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem.
Stodola P; Michenka K; Nohel J; Rybanský M
Entropy (Basel); 2020 Aug; 22(8):. PubMed ID: 33286654
[TBL] [Abstract][Full Text] [Related]
5. Research on improved ant colony optimization for traveling salesman problem.
Fei T; Wu X; Zhang L; Zhang Y; Chen L
Math Biosci Eng; 2022 Jun; 19(8):8152-8186. PubMed ID: 35801461
[TBL] [Abstract][Full Text] [Related]
6. Ant colonies for the travelling salesman problem.
Dorigo M; Gambardella LM
Biosystems; 1997; 43(2):73-81. PubMed ID: 9231906
[TBL] [Abstract][Full Text] [Related]
7. Scheduling multiprocessor job with resource and timing constraints using neural networks.
Huang YM; Chen RM
IEEE Trans Syst Man Cybern B Cybern; 1999; 29(4):490-502. PubMed ID: 18252324
[TBL] [Abstract][Full Text] [Related]
8. Solving NP-Hard Problems with Physarum-Based Ant Colony System.
Liu Y; Gao C; Zhang Z; Lu Y; Chen S; Liang M; Tao L
IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(1):108-120. PubMed ID: 28182547
[TBL] [Abstract][Full Text] [Related]
9. Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP).
Hao T; Yingnian W; Jiaxing Z; Jing Z
PeerJ Comput Sci; 2023; 9():e1609. PubMed ID: 37810357
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. Multi-Objective Ant Colony Optimization Based on the Physarum-Inspired Mathematical Model for Bi-Objective Traveling Salesman Problems.
Zhang Z; Gao C; Lu Y; Liu Y; Liang M
PLoS One; 2016; 11(1):e0146709. PubMed ID: 26751562
[TBL] [Abstract][Full Text] [Related]
12. [Application study of ant colony algorithm in near infrared spectroscopy quantitative analysis].
Guo L; Ji HY
Guang Pu Xue Yu Guang Pu Fen Xi; 2007 Sep; 27(9):1703-5. PubMed ID: 18051509
[TBL] [Abstract][Full Text] [Related]
13. Combinatorial optimization with use of guided evolutionary simulated annealing.
Yip PC; Pao YH
IEEE Trans Neural Netw; 1995; 6(2):290-5. PubMed ID: 18263313
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. An improved ant colony optimization for solving the flexible job shop scheduling problem with multiple time constraints.
Yan S; Zhang G; Sun J; Zhang W
Math Biosci Eng; 2023 Feb; 20(4):7519-7547. PubMed ID: 37161161
[TBL] [Abstract][Full Text] [Related]
16. Automated selection of appropriate pheromone representations in ant colony optimization.
Montgomery J; Randall M; Hendtlass T
Artif Life; 2005; 11(3):269-91. PubMed ID: 16053571
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. 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]
19. 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]
20. 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]
[Next] [New Search]
