176 related articles for article (PubMed ID: 36822144)
1. 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]
2. 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]
3. Hybrid pointer networks for traveling salesman problems optimization.
Stohy A; Abdelhakam HT; Ali S; Elhenawy M; Hassan AA; Masoud M; Glaser S; Rakotonirainy A
PLoS One; 2021; 16(12):e0260995. PubMed ID: 34905571
[TBL] [Abstract][Full Text] [Related]
4. 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]
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. 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]
7. Deep Reinforcement Learning for Combinatorial Optimization: Covering Salesman Problems.
Li K; Zhang T; Wang R; Wang Y; Han Y; Wang L
IEEE Trans Cybern; 2022 Dec; 52(12):13142-13155. PubMed ID: 34437087
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. Dynamic graph Conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem.
Wang Y; Chen Z
Math Biosci Eng; 2022 Jul; 19(10):9730-9748. PubMed ID: 36031965
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. An accelerated end-to-end method for solving routing problems.
Zhu T; Shi X; Xu X; Cao J
Neural Netw; 2023 Jul; 164():535-545. PubMed ID: 37216756
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. 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]
14. 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]
15. 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]
16. Solving Dynamic Traveling Salesman Problems With Deep Reinforcement Learning.
Zhang Z; Liu H; Zhou M; Wang J
IEEE Trans Neural Netw Learn Syst; 2023 Apr; 34(4):2119-2132. PubMed ID: 34520362
[TBL] [Abstract][Full Text] [Related]
17. On approximating a new generalization of traveling salesman problem.
Huang Z; Liao X; Naik PA; Lu X
Heliyon; 2024 May; 10(10):e31297. PubMed ID: 38818174
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. A Graph-Based Neural Approach to Linear Sum Assignment Problems.
Aironi C; Cornell S; Squartini S
Int J Neural Syst; 2024 Mar; 34(3):2450011. PubMed ID: 38231046
[TBL] [Abstract][Full Text] [Related]
20. 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]
[Next] [New Search]
