This project is supported by USC CSCI561 teaching team.
TSP is defined as given a list of cities/locations, the person has to go to all the locations exactly once, return back to the starting point, and cover the minimum distance as a whole.
A location is represented as a combination of 3D coordinate points, x, y, and z. For example: (10, 0, 30) represents a city with x= 10, y = 0, z= 30.- Initial Population
- Parent Selection: Roulette wheel based
- Crossover: HGA Based
- CSCI 561- Fall 2022-Homework 1.pdf
- Solution of TSP problem based on hybrid genetic simulated annealing algorithm.pdf
- 旅行商问题(TSP)的改进遗传算法.pdf
- 遗传算法及其在 TSP 问题求解中的应用.pdf