An efficient new method for traveling salesman problem using discrete evolutionary algorithm with special encoding and novel optimization strategy | Synapse
March 3, 2026
An efficient new method for traveling salesman problem using discrete evolutionary algorithm with special encoding and novel optimization strategy
Key Points
The new method significantly reduces computational time for solving the traveling salesman problem.
Results showed an improvement in efficiency by 30% compared to traditional approaches.
Analysis employs a discrete evolutionary algorithm with a unique encoding approach.
This innovative strategy highlights the potential for enhanced performance in complex combinatorial problems.