Parameter Optimization in GA for Large-scale Traveling Salesman Problem

被引：0

作者：

Tian, Xingke ^{[1
]}

Yang, Shuo ^{[1
]}

机构：

[1] China North Vehicle Res Inst, Beijing, Peoples R China

来源：

2ND INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING, INFORMATION SCIENCE AND INTERNET TECHNOLOGY, CII 2017 | 2017年

关键词：

Genetic algorithm; experimental design method; agent model; optimization;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Traveling Salesman Problems (TSP) is a typical problem in computer science and it is also the most concerned problem for researchers in combinatorial optimization. Therefore, how to solve the optimal loop of TSP problem is a hot topic in researchers. At present, the genetic algorithm has been mature in solving the TSP problem, but the research on the optimization of genetic algorithm parameters is still relatively less. Therefore, in this paper, we analyzed the relevant parameters of the genetic algorithm, optimized the parameters in the application of TSP problem, strengthened its optimization ability, and gave a calculation framework: Firstly, we sampled and analyzed the parameters by using the experimental design method and found the most influential parameters. Secondly, we established and optimized the proxy model and obtained the optimal parameters. Finally, we verified the results with examples. The experiment proved that this method improved the efficiency of solving TSP problem greatly.

引用

页码：217 / 224

页数：8

共 50 条

[31] An efficient improved African vultures optimization algorithm with dimension learning hunting for traveling salesman and large-scale optimization applications
Singh, Narinder
Houssein, Essam H.
Mirjalili, Seyedali
Cao, Yankai
Selvachandran, Ganeshsree
INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2022, 37 (12) : 12367 - 12421
[32] An effective parallel hybrid GA for Traveling Salesman Problem
Liu, Yanbin
Huang, Jun
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE INFORMATION COMPUTING AND AUTOMATION, VOLS 1-3, 2008, : 695 - 698
[33] Dynamic graph Conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem
Wang, Yang
Chen, Zhibin
MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2022, 19 (10) : 9730 - 9748
[34] EXPERIMENTAL COMPARISON OF 2 HEURISTIC ALGORITHMS FOR ONE GENERALIZATION OF THE LARGE-SCALE PLANAR TRAVELING-SALESMAN PROBLEM
GERSHUNI, DS
SHERSTYUK, AV
PROGRAMMING AND COMPUTER SOFTWARE, 1990, 16 (04) : 171 - 173
[35] A k-level data structure for large-scale traveling salesman problems
Osterman, Colin
Rego, Cesar
ANNALS OF OPERATIONS RESEARCH, 2016, 244 (02) : 583 - 601
[36] GA Based Traveling Salesman Problem Solution and its Application to Transport Routes Optimization
Hacizade, U.
Kaya, I.
IFAC PAPERSONLINE, 2018, 51 (30): : 620 - 625
[37] An approach to solve large scale multiple traveling salesman problem with balanced assignment
Wang Dazhi
Wang Dingwei
GLOBALIZATION CHALLENGE AND MANAGEMENT TRANSFORMATION, VOLS I - III, 2007, : 43 - 45
[38] A novel genetic algorithm for large scale colored balanced traveling salesman problem
Dong, Xueshi
Cai, Yongle
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2019, 95 : 727 - 742
[39] Large scale traveling salesman problem via neural network divide and conquer
Mulder, S
Wunsch, DC
ICONIP'02: PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON NEURAL INFORMATION PROCESSING: COMPUTATIONAL INTELLIGENCE FOR THE E-AGE, 2002, : 533 - 536
[40] A k-level data structure for large-scale traveling salesman problems
Colin Osterman
César Rego
Annals of Operations Research, 2016, 244 : 583 - 601

← 1 2 3 4 5 →