Evolutionary-and-Heuristic-Algorithms/proj_3.py at master · PUT-II/Evolutionary-and-Heuristic-Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
import shutil

import tsplib95
from tsplib95.models import StandardProblem

from common.experiments import run_experiment_local_search, run_experiment_constructive
from solvers.local_search import EdgeSwapSteepSearch
from solvers.local_search_improved import CandidateSteepSearch
from solvers.problem_solvers import GreedyCycleProblemSolver

_EXPERIMENT_COUNT: int = 100


def main():
    problem_a: StandardProblem = tsplib95.load('data/kroa200.tsp')
    problem_b: StandardProblem = tsplib95.load('data/krob200.tsp')

    shutil.rmtree("./graphs/", ignore_errors=True)

    run_experiment_local_search(problem_a, CandidateSteepSearch(), "kroa200_css", _EXPERIMENT_COUNT)
    run_experiment_local_search(problem_b, CandidateSteepSearch(), "krob200_css", _EXPERIMENT_COUNT)
    # This algorithm is implemented using wrong method
    # run_experiment_local_search(problem_a, ScoreSteepSearch(), "kroa200_sss", _EXPERIMENT_COUNT)
    # run_experiment_local_search(problem_b, ScoreSteepSearch(), "krob200_sss", _EXPERIMENT_COUNT)
    run_experiment_local_search(problem_a, EdgeSwapSteepSearch(), "kroa200_ess", _EXPERIMENT_COUNT)
    run_experiment_local_search(problem_b, EdgeSwapSteepSearch(), "krob200_ess", _EXPERIMENT_COUNT)
    run_experiment_constructive(problem_a, GreedyCycleProblemSolver(), "kroa200_gc", _EXPERIMENT_COUNT)
    run_experiment_constructive(problem_b, GreedyCycleProblemSolver(), "krob200_gc", _EXPERIMENT_COUNT)


if __name__ == '__main__':
    main()