Approximate algorithm to
solution space, we use heuristic

Solution space has restrictions for validity
 -> restriction model
    -> before merging we check if the result will comply to our restrictions



Requirement for algorithm
Options? (NP-hard problem)
-> Short explanation of savings algorithm
-> Runtime?
-> How good is it, benchmarks

Show how it is implemented? (Maybe a pseudo-code side by side comparison)
    - we modelled it as a directed graph due to road networks, pseudo har undirected.
    - restriction model, durationProvider,
    - cost-function (bare total duration)


 - Possibilities of implementing other algorithms (modularity)


Append, prepend - no interior nodes
(start node, end node)



Problems:
Show Bornholm example

(Fixes?)

Future: adaptive solution, that uses machine learning to recognize patterns E.G clustering in order to pick the best fit algorithm






Use machine learning to recognize patterns E.G clustering, utilizing an adaptive solution in regards to choice of algorithm

a

Spring Boot