.png){kind=icon}
.png){kind=icon}
Return
An efficient new method for traveling salesman problem using discrete evolutionary algorithm with special encoding and novel optimization strategy
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2026.102306.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• A new method for representing TSP solution using special integer vector is proposed. • The problem of constructing evolution equations for TSP using basic mathematical operations is solved. • A new optimization method for improving the local structure of TSP solution is proposed. • An efficient new method for solving TSP based on improved GTOA is proposed.
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W
View more organizations