diff --git a/src/algorithm/Multimodal/Heuristics/MultimodalModularHeuristic.h b/src/algorithm/Multimodal/Heuristics/MultimodalModularHeuristic.h
index 5d09984272961e84be7d867a0b38a5b2138c0cef..324b046505d37fc778a6c33658ccfd1adf39fa7c 100644
--- a/src/algorithm/Multimodal/Heuristics/MultimodalModularHeuristic.h
+++ b/src/algorithm/Multimodal/Heuristics/MultimodalModularHeuristic.h
@@ -29,6 +29,11 @@ private:
     const std::vector<Request>* _requestsVect{nullptr};
     SAEVRoute* _route{nullptr}; //_route is a pointer here to decorrelate the route from the algorithm and facilitate using multiple modules on the same route
 
+    //TODO: Move the diverse components (min/max constraints, get best entries/exits list etc) to their own classes to be used as delegates/decorator-like pattern
+    //      This would have the added benefit of easier customisation. Just have a common "apply()" function, and give useful data in constructor
+    //      => every inheritor just has an apply() method, used here, returning the appropriate data,
+    //         but child class constructor can be free to have all the data we want
+
     /**
      * Vector holding every entry sub request created to prevent refs staleness
      * while letting the requests vector hold only the base requests \n