The combination of these three operators to solve the TSP appears to work well.
These are ScrambleSubtourmutation, VotingRecombinationCrossover and 3-opt-local-search. Would anybody have already used this combination. Would they be prepared, please, to share their results to solve the instances D18512, USA13509, U2152, PCB1173, PR439,RAT575,U724.
It would be a great help.
Many thanks in advances for your help.
Kind regards,
Patricia
The paper "A Novel Diversity-based Evolutionary Algorithm for the Traveling Salesman Problem" will appear in GECCO-2015. It might be useful for the comparisons.
The code is available on demand.
You could be interested in TSP as Sorting! I am trying to solve it by Dynamic Programming and Computational Geometry.
https://www.researchgate.net/project/Travelling-Salesman-Problem-with-Dynamic-Programming-and-Computational-Geometry-Approach
- Badges
- Science topic
- Similar topics
- Social Science
- Media
- Social Media