154 related articles for article (PubMed ID: 24723834)
1. Efficient constraint handling in electromagnetism-like algorithm for traveling salesman problem with time windows.
Yurtkuran A; Emel E
ScientificWorldJournal; 2014; 2014():871242. PubMed ID: 24723834
[TBL] [Abstract][Full Text] [Related]
2. Solving optimization problems simultaneously: the variants of the traveling salesman problem with time windows using multifactorial evolutionary algorithm.
Ban HB; Pham DH
PeerJ Comput Sci; 2023; 9():e1192. PubMed ID: 37346673
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. 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]
5. 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]
6. 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]
7. 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]
8. 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]
9. Dynamic sub-route-based self-adaptive beam search Q-learning algorithm for traveling salesman problem.
Zhang J; Liu Q; Han X
PLoS One; 2023; 18(3):e0283207. PubMed ID: 36943840
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling Salesman Problem.
Odili JB; Noraziah A; Zarina M
Comput Intell Neurosci; 2021; 2021():6625438. PubMed ID: 33986793
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. 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]
14. 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]
15. 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]
16. 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]
17. A New Approach Based on Collective Intelligence to Solve Traveling Salesman Problems.
Kiran MS; Beskirli M
Biomimetics (Basel); 2024 Feb; 9(2):. PubMed ID: 38392165
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. 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]
20. 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]
[Next] [New Search]
