Solving travelling salesman problem based on nearest neighbor strategy

doi:10.3778/j.issn.1002-8331.2009.28.019

Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (28): 67-68.DOI: 10.3778/j.issn.1002-8331.2009.28.019

• 研究、探讨 • Previous Articles Next Articles

Solving travelling salesman problem based on nearest neighbor strategy

WANG Tong，LI Yun-qiang

Department of Applied Mathematics，Electronic Technique Institute，PLA Information Engineering University，Zhengzhou 450004，China

Received:2008-05-26 Revised:2008-09-15 Online:2009-10-01 Published:2009-10-01
Contact: WANG Tong

基于近邻策略的旅行商问题求解

汪彤，李云强

解放军信息工程大学电子技术学院应用数学系，郑州 450004

通讯作者: 汪彤

Abstract

Abstract: According to the specific properties of TSP and the spirit of neighborhood search，the paper presents a new genetic algorithm based on the nearest neighbor strategy to solve TSP.First，calculate the nearest neighbor schemas according to the TSP and use the schemas to generate the initial population.Then introduce one of the schemas randomly into every generation.Simulation tests show that the new algorithm increases the convergence speed heavily and has better effect on the process of GAs.As the city number increases，its superiority appears more obviously.

Key words: nearest neighbor strategy, Genetic Algorithm（GA）, Travelling Salesman Problem（TSP）

摘要： 根据TSP问题的特征信息并借鉴邻域搜索算法的有关思想，提出了一种基于近邻策略的TSP问题求解算法，该算法首先依据TSP问题的特殊性求出相应的近邻模式，再将近邻模式用于初始种群的生成，而后在进化过程中随机引入这类模式。该算法可以大大缩短遗传进程，提高进化效率。通过仿真实验，验证了该算法的有效性，并且随着城市数目的增加其优越性更为明显。

关键词: 近邻策略, 遗传算法, 旅行商问题

CLC Number:

TP301.6

WANG Tong，LI Yun-qiang. Solving travelling salesman problem based on nearest neighbor strategy[J]. Computer Engineering and Applications, 2009, 45(28): 67-68.

汪彤，李云强. 基于近邻策略的旅行商问题求解[J]. 计算机工程与应用, 2009, 45(28): 67-68.

[1]	WU Congcong, HE Yichao, ZHAO Jianli. New Genetic Algorithm for Discounted {0-1} Knapsack Problem [J]. Computer Engineering and Applications, 2020, 56(7): 57-66.
[2]	QIN Qin, LIANG Chengji. Optimization of Equipment Coordination Scheduling with Considering Buffer Space in Automated Container Terminal [J]. Computer Engineering and Applications, 2020, 56(6): 262-270.
[3]	LIANG Chengji, YU Jian. Research on Dispatching of Container Terminals Quay Crane Scheduling with Interference Constraints [J]. Computer Engineering and Applications, 2020, 56(10): 273-278.
[4]	DONG Hao1, ZHANG Haiping2, LI Zhongjin1, LIU Hui1. Computation Offloading for Service Workflow in Mobile Edge Computing [J]. Computer Engineering and Applications, 2019, 55(2): 36-43.
[5]	XUE Meng, JIANG Shujuan, WANG Rongcun. Systematic review of test data generation based on intelligent optimization algorithm [J]. Computer Engineering and Applications, 2018, 54(17): 16-23.
[6]	LOU Gaoxiang, CAI Zongyan, LIU Qingtao. Application of new hybrid algorithm in mixed model assembly scheduling [J]. Computer Engineering and Applications, 2018, 54(16): 254-259.
[7]	WANG Xinyue, GUO Jianquan. Subsidy strategy model of multi-period closed-loop hybrid system under carbon tax [J]. Computer Engineering and Applications, 2018, 54(14): 236-240.
[8]	LUO Xianglong1，2, ZHANG Shengrui1, NIU Liyao2. Short-term traffic flow prediction based on detector optimal selection [J]. Computer Engineering and Applications, 2017, 53(8): 199-202.
[9]	LIANG Chengji, WU Yu. Simultaneous berth and quay crane scheduling under uncertainty environments in container terminals [J]. Computer Engineering and Applications, 2017, 53(7): 212-219.
[10]	CAO Xiaoning, XUE Han, WANG Yongming. Optimization for control strategy of serial production system with machine breakdowns [J]. Computer Engineering and Applications, 2017, 53(16): 199-204.
[11]	CUI Yongfeng, ZHOU Dingding. Analysis of optimal scheduling model in variable speed environment at night [J]. Computer Engineering and Applications, 2016, 52(9): 239-242.
[12]	XU Xian1，2, LU Xianling1，2, WANG Hongbin1，2. Accelerometer data feature selection for activity recognition based on GA optimization [J]. Computer Engineering and Applications, 2016, 52(6): 139-143.
[13]	LU Yan1, HUI Qiaojuan2. Improved framework for 3D face feature points extraction method based on statistic deformable model [J]. Computer Engineering and Applications, 2016, 52(24): 166-170.
[14]	YAN Han, LIU Juan, ZHOU Xuanyu. Optimal proportion of training data for Chinese coreference resolution [J]. Computer Engineering and Applications, 2016, 52(17): 140-145.
[15]	WANG Lucai, CAO Pengxia, JIANG Xiaolong. Improved method for speech endpoint detection with noise [J]. Computer Engineering and Applications, 2016, 52(15): 162-167.

Solving travelling salesman problem based on nearest neighbor strategy

基于近邻策略的旅行商问题求解

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics