MEATSP: A Membrane Evolutionary Algorithm for Solving TSP
In recent years, heuristic intelligent algorithms have achieved rapid development in solving combinatorial optimization problems. Travelling salesman problem(TSP) is one of the classical NP-hard problems in combinatorial optimization, and it needs for more accurate and faster algorithms. Combining h...
Main Authors: | Ping Guo, Mengliang Hou, Lian Ye |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9245472/ |
Similar Items
-
MEAMCP: A Membrane Evolutionary Algorithm for Solving Maximum Clique Problem
by: Ping Guo, et al.
Published: (2019-01-01) -
MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem
by: Ping Guo, et al.
Published: (2019-01-01) -
Solving the TSP by the AALHNN algorithm
by: Yun Hu, et al.
Published: (2022-01-01) -
Comparing the Robustness of Evolutionary Algorithms on the Basis of Benchmark Functions
by: DENIZ ULKER, E., et al.
Published: (2013-05-01) -
A modified algorithm of Hopfield network to solve TSP(Hopfield网络解TSP的改进算法)
by: JIANGGuo-jun(姜国均)
Published: (2001-03-01)