search

lutzzdias / travelling-salesman-problem

0 stars 1 forks source link

Add improved lower bound to current folder structure #38

Closed lutzzdias closed 8 months ago

lutzzdias commented 8 months ago

Lower bound was implemented in #30, however, with the folder structure changes git does not recognize the diff for a merge request. This issue is supposed to handle exactly that and, maybe, improve the modularity of our code.

lutzzdias commented 8 months ago

My idea is to implement everything in a single travelling_salesman.py file, following the api_specification.py.

Later we may create some sort of abstraction in order to allow for quick change of algorithm (e.g. different lower bounds). However, the main goal right now is to keep the API intact and make the project work.

lutzzdias commented 8 months ago

I also started changing the local move implementation (within the main file) to simplify it.

lutzzdias commented 8 months ago

My idea is to implement everything in a single travelling_salesman.py file, following the api_specification.py.

Later we may create some sort of abstraction in order to allow for quick change of algorithm (e.g. different lower bounds). However, the main goal right now is to keep the API intact and make the project work.

The idea is to avoid these specific algorithms as much as possible. The api should be agnostic to heuristic. Each heuristic should use the base API as is and use the available methods as needed in order to get to the final solution.