SAC Model Based Improved Genetic Algorithm for Solving TSP
Genetic algorithm (GA) has strong global searching ability and is easy to operate, but its disadvantages such as poor convergence speed, unstable and easy to fall into local optimal value restrict its application. In order to overcome these disadvantages, an improved genetic algorithm based on the d...
Main Author: | CHEN Bin, LIU Weiguo |
---|---|
Format: | Article |
Language: | zho |
Published: |
Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press
2021-09-01
|
Series: | Jisuanji kexue yu tansuo |
Subjects: | |
Online Access: | http://fcst.ceaj.org/CN/abstract/abstract2881.shtml |
Similar Items
-
Converting MST to TSP Path by Branch Elimination
by: Pasi Fränti, et al.
Published: (2021-12-01) -
On Applying Methods for Graph-TSP to Metric TSP
by: Desjardins, Nicholas
Published: (2016) -
Implementasi Algoritma Cheapest Insertion Heuristic (CIH) dalam Penyelesaian Travelling Salesman Problem (TSP)
by: Rio Guntur Utomo, et al.
Published: (2018-06-01) -
Solving Traveling Salesman Problem With a non-complete Graph
by: Emami Taba, Mahsa Sadat
Published: (2010) -
Solving Traveling Salesman Problem With a non-complete Graph
by: Emami Taba, Mahsa Sadat
Published: (2010)