Searchtraveling salesman problemreturned 12 results

---

1

Improved genetic algorithm incorporating profit-loss picking strategy for solving TTP

融合盈亏拿取策略的改进遗传算法求解TTP问题

Jiang Xiaoju

Tan Dailun

Feng Shiqiang

traveling salesman problem

knapsack problem

travel thief problem

improved genetic algorithm

profit-loss picking strategy

Accepted Paper No. 7, 2025 : doi:10.19734/j.issn.1001-3695.2024.12.0489

2

Improved adaptive large neighborhood search algorithm and its application to traveling salesman problem

改进自适应大邻域搜索算法及其在旅行商问题中的应用

Ao Hongrui

Zhang Jihui

Chen Shengzong

improved adaptive large neighborhood search algorithm

neighbor operator

rrt acceptance criteria

traveling salesman problem

Accepted Paper No. 6, 2025 : doi:10.19734/j.issn.1001-3695.2024.11.0445

3

Deep reinforcement learning approach for solving takeout delivery problem

求解外卖配送问题的深度强化学习算法

Zhang Xuyang

Liu Yong

Ma Liang

takeout delivery

minimum ratio traveling salesman problem

deep reinforcement learning

multi-feature embedding

attention mechanism

No. 1, 2025 : 205-213 doi:10.19734/j.issn.1001-3695.2024.05.0179

4

Artificial bee colony algorithm with unlinear population size reduction based on cluster individual rank

基于分区个体排名的非线性种群缩减的人工蜂群算法

Zhao Ming

Liu Shanzhi

Song Xiaoyu

Shen Xiaopeng

unlinear population size reduction

artificial bee colony algorithm

clustering

rank

traveling salesman problem

No. 10, 2024 : 3021-3031 doi:10.19734/j.issn.1001-3695.2024.02.0045

5

Ant colony optimization algorithm based on Lévy flight transfer rule for solving traveling salesman problem

一种应用于旅行商问题的莱维飞行转移规则蚁群优化算法

Ding Zengliang

Chen Jue

Qiu Xihe

ant colony optimization

traveling salesman problem(TSP)

Lévy flight

3-opt

No. 5, 2024 : 1420-1427 doi:10.19734/j.issn.1001-3695.2023.09.0450

6

Novel genetic algorithm based on genes pool for traveling salesman problem

基于基因库求解旅行商问题的遗传算法

Wang Yong

Lyu Zhiwei

traveling salesman problem

genetic algorithm

gene pool

local optimization strategy

No. 11, 2023 : 3262-3268 doi:10.19734/j.issn.1001-3695.2023.03.0103

7

Dual-ant colony optimization algorithm with dynamic differentiation and neighborhood induction mechanism

引入动态分化和邻域诱导机制的双蚁群优化算法

Yu Bowen

You Xiaoming

Liu Sheng

traveling salesman problem

ant colony optimization

dynamic differentiation strategy

chaos random

induction strategy

No. 10, 2023 : 3000-3006 doi:10.19734/j.issn.1001-3695.2023.02.0060

8

Partheno-genetic algorithm based on explore-develop-jump strategy for solving traveling salesman problem

求解旅行商问题的探索—开发—跳跃策略单亲遗传算法

Chen Jiajun

Tan Dailun

traveling salesman problem(TSP)

partheno-genetic algorithm

logistic chaotic mapping

improved circle operation

nearest neighbor mutation

No. 5, 2023 : 1375-1380 doi:10.19734/j.issn.1001-3695.2022.10.0483

9

Improved beetle antennae search algorithm with mutation crossover in TSP and engineering application

融入变异交叉的改进天牛须算法求解TSP及工程应用

Lyu Yucheng

Mo Yuanbin

beetle antennae search optimization algorithm

traveling salesman problem

mutation crossover mechanism

adaptive step

accuracy of the algorithm

No. 12, 2021 : 3662-3666 doi:10.19734/j.issn.1001-3695.2021.05.0162

10

Imperialist competitive algorithm based on adaptive inheritance strategy to solve traveling salesman problem

基于自适应继承策略的帝国竞争算法求解旅行商问题

Xu Weihua

Zhang Genrui

Wei Chuanxiang

Liao Shichao

imperialist competitive algorithm

traveling salesman problem

crossover operator

adaptive

local optimization

No. 11, 2021 : 3349-3353 doi:10.19734/j.issn.1001-3695.2021.04.0109

11

Discrete fireworks algorithm with fixed radius nearest-neighbor search 3-opt for travelling salesman problem

带固定半径近邻搜索3-opt的离散烟花算法求解旅行商问题

Qi Yuanhang

Cai Yanguang

Huang Gewen

Lin Zhuosheng

Wang Fujie

discrete fireworks algorithm

traveling salesman problem(TSP)

fixed radius nearest-neighbor search

3-opt

No. 6, 2021 : 1642-1647 doi:10.19734/j.issn.1001-3695.2020.09.0241

12

Improved wolf group algorithm for solving traveling salesman problem

改进狼群算法求解旅行商问题

Huang Haisong

Ren Zhupeng

Wei Jian'an

IWPA

discrete domain

second search

path planning

No. 12, 2019 : 3644-3646,3656 doi:10.19734/j.issn.1001-3695.2018.07.0370