150 related articles for article (PubMed ID: 37366833)
1. 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]
2. 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]
3. Research on a hybrid neural network task assignment algorithm for solving multi-constraint heterogeneous autonomous underwater robot swarms.
Ru J; Hao D; Zhang X; Xu H; Jia Z
Front Neurorobot; 2022; 16():1055056. PubMed ID: 36704716
[TBL] [Abstract][Full Text] [Related]
4. Colored Traveling Salesman Problem.
Li J; Zhou M; Sun Q; Dai X; Yu X
IEEE Trans Cybern; 2015 Nov; 45(11):2390-401. PubMed ID: 25494521
[TBL] [Abstract][Full Text] [Related]
5. The ordered clustered travelling salesman problem: a hybrid genetic algorithm.
Ahmed ZH
ScientificWorldJournal; 2014; 2014():258207. PubMed ID: 24701148
[TBL] [Abstract][Full Text] [Related]
6. Generating subtour elimination constraints for the TSP from pure integer solutions.
Pferschy U; Staněk R
Cent Eur J Oper Res; 2017; 25(1):231-260. PubMed ID: 28690424
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. 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]
9. 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]
10. Adapting blockchain's proof-of-work mechanism for multiple traveling salesmen problem optimization.
Sabry N; Shabana B; Handosa M; Rashad MZ
Sci Rep; 2023 Sep; 13(1):14676. PubMed ID: 37673897
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. 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]
13. Heuristics for Two Depot Heterogeneous Unmanned Vehicle Path Planning to Minimize Maximum Travel Cost.
Bae J; Chung W
Sensors (Basel); 2019 May; 19(11):. PubMed ID: 31146430
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. AMARL: An Attention-Based Multiagent Reinforcement Learning Approach to the Min-Max Multiple Traveling Salesmen Problem.
Gao H; Zhou X; Xu X; Lan Y; Xiao Y
IEEE Trans Neural Netw Learn Syst; 2023 Feb; PP():. PubMed ID: 37022807
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. 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]
18. Precedence-Constrained Colored Traveling Salesman Problem: An Augmented Variable Neighborhood Search Approach.
Xu X; Li J; Zhou M; Yu X
IEEE Trans Cybern; 2022 Sep; 52(9):9797-9808. PubMed ID: 34033558
[TBL] [Abstract][Full Text] [Related]
19. Heuristics and Learning Models for Dubins MinMax Traveling Salesman Problem.
Nayak A; Rathinam S
Sensors (Basel); 2023 Jul; 23(14):. PubMed ID: 37514725
[TBL] [Abstract][Full Text] [Related]
20. 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]
[Next] [New Search]
