- Exact algorithms
- Branch and Bound (Least cost)
- Brute Force
- Metaheuristic algorithms:
- Simulated Annealing
- parameters: starting and final temperature, temperature reduction coefficient, stop condition (time in seconds)
- Genetic algorithm
- parameters: population size, crossover and mutation coefficient, crossover method (one point or two point), mutation method (one pair or two pair swap), stop condition (time in seconds)
- Simulated Annealing
- File with a number of cities and a matrix of distances.
4
0 1 1 1
1 0 1 1
1 1 0 1
1 1 1 0
- Path
- Path length
- Execution time
- Apache Commons Collections 4.4 (for brute force)