For example, LDS has been recently used as a search algorithm to combine Deep Reinforcement Learning and Constraint Programming in order to solve Combinatorial Optimization problems such as the Traveling Salesman Problem with Time Windows (TSPTW), 4-Moments Portfolio Optimization or the 0-1 Knapsack Problem [1]}.
