Genetic algorithm for solving travelling salesman problem with berlin52 dataset By: Hong Hiep Trinh Email: [email protected] Date: 2022-12
Best achieved result is around 7544 after ~20,000-40,000 generations. Best known optimal result so far is 7542.
7544.366=0-21-30-17-2-16-20-41-6-1-29-22-19-49-28-15-45-43-33-34-35-38-39-36-37-47-23-4-14-5-3-24-11-27-26-25-46-12-13-51-10-50-32-42-9-8-7-40-18-44-31-48