搜索旅行商问题共有 13 个结果
1
Improved genetic algorithm incorporating profit-loss picking strategy for solving TTP
优先出版
2025年第7期 :
doi:10.19734/j.issn.1001-3695.2024.12.0489
2
Research on TSP problem of urban modeling based on pheromone matrix optimization ant colony algorithm
优先出版
2025年第6期 :
doi:10.19734/j.issn.1001-3695.2024.11.0444
3
Improved adaptive large neighborhood search algorithm and its application to traveling salesman problem
优先出版
2025年第6期 :
doi:10.19734/j.issn.1001-3695.2024.11.0445
4
Deep reinforcement learning approach for solving takeout delivery problem
2025年第1期 : 205-213
doi:10.19734/j.issn.1001-3695.2024.05.0179
5
Artificial bee colony algorithm with unlinear population size reduction based on cluster individual rank
2024年第10期 : 3021-3031
doi:10.19734/j.issn.1001-3695.2024.02.0045
6
Ant colony optimization algorithm based on Lévy flight transfer rule for solving traveling salesman problem
2024年第5期 : 1420-1427
doi:10.19734/j.issn.1001-3695.2023.09.0450
7
Novel genetic algorithm based on genes pool for traveling salesman problem
2023年第11期 : 3262-3268
doi:10.19734/j.issn.1001-3695.2023.03.0103
8
Dual-ant colony optimization algorithm with dynamic differentiation and neighborhood induction mechanism
2023年第10期 : 3000-3006
doi:10.19734/j.issn.1001-3695.2023.02.0060
9
Partheno-genetic algorithm based on explore-develop-jump strategy for solving traveling salesman problem
2023年第5期 : 1375-1380
doi:10.19734/j.issn.1001-3695.2022.10.0483
10
Improved beetle antennae search algorithm with mutation crossover in TSP and engineering application
2021年第12期 : 3662-3666
doi:10.19734/j.issn.1001-3695.2021.05.0162
11
Imperialist competitive algorithm based on adaptive inheritance strategy to solve traveling salesman problem
2021年第11期 : 3349-3353
doi:10.19734/j.issn.1001-3695.2021.04.0109
12
Discrete fireworks algorithm with fixed radius nearest-neighbor search 3-opt for travelling salesman problem
2021年第6期 : 1642-1647
doi:10.19734/j.issn.1001-3695.2020.09.0241
13
Improved wolf group algorithm for solving traveling salesman problem
2019年第12期 : 3644-3646,3656
doi:10.19734/j.issn.1001-3695.2018.07.0370