185 related articles for article (PubMed ID: 33834093)
1. A novel approach for solving travelling thief problem using enhanced simulated annealing.
Ali H; Zaid Rafique M; Shahzad Sarfraz M; Malik MSA; Alqahtani MA; Alqurni JS
PeerJ Comput Sci; 2021; 7():e377. PubMed ID: 33834093
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. 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]
4. 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]
5. 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]
6. Travelling Santa Problem: Optimization of a Million-Households Tour Within One Hour.
Strutz T
Front Robot AI; 2021; 8():652417. PubMed ID: 33912597
[TBL] [Abstract][Full Text] [Related]
7. Characterization of the probabilistic traveling salesman problem.
Bowler NE; Fink TM; Ball RC
Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Sep; 68(3 Pt 2):036703. PubMed ID: 14524922
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. Chemical reaction optimization for solving shortest common supersequence problem.
Khaled Saifullah CM; Rafiqul Islam M
Comput Biol Chem; 2016 Oct; 64():82-93. PubMed ID: 27299980
[TBL] [Abstract][Full Text] [Related]
10. List-Based Simulated Annealing Algorithm for Traveling Salesman Problem.
Zhan SH; Lin J; Zhang ZJ; Zhong YW
Comput Intell Neurosci; 2016; 2016():1712630. PubMed ID: 27034650
[TBL] [Abstract][Full Text] [Related]
11. 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]
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. Hybrid Classical-Quantum Branch-and-Bound Algorithm for Solving Integer Linear Problems.
Sanavio C; Tignone E; Ercolessi E
Entropy (Basel); 2024 Apr; 26(4):. PubMed ID: 38667899
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. 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]
16. An efficient optimizer for the 0/1 knapsack problem using group counseling.
Ghadi YY; AlShloul T; Nezami ZI; Ali H; Asif M; Aljuaid H; Ahmad S
PeerJ Comput Sci; 2023; 9():e1315. PubMed ID: 37346609
[TBL] [Abstract][Full Text] [Related]
17. The ordered clustered travelling salesman problem: a hybrid genetic algorithm.
Ahmed ZH
ScientificWorldJournal; 2014; 2014():258207. PubMed ID: 24701148
[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. Decomposition Algorithms for a Multi-Hard Problem.
Przybylek MR; Wierzbicki A; Michalewicz Z
Evol Comput; 2018; 26(3):507-533. PubMed ID: 28632397
[TBL] [Abstract][Full Text] [Related]
20. An efficient approach to the travelling salesman problem using self-organizing maps.
Vieira FC; Dória Neto AD; Costa JA
Int J Neural Syst; 2003 Apr; 13(2):59-66. PubMed ID: 12923918
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
