Chases and Escapes, and Optimization Problems
This work addresses combinatorial optimization for researchers, but it appears incremental as it builds on existing methods like steepest descent.
The authors tackled combinatorial optimization problems by introducing a chase and escape game mechanism into the search process, applied to the Traveling Salesman Problem, with preliminary tests suggesting potential fruitfulness.
We propose a new approach for solving combinatorial optimization problem by utilizing the mechanism of chases and escapes, which has a long history in mathematics. In addition to the well-used steepest descent and neighboring search, we perform a chase and escape game on the "landscape" of the cost function. We have created a concrete algorithm for the Traveling Salesman Problem. Our preliminary test indicates a possibility that this new fusion of chases and escapes problem into combinatorial optimization search is fruitful.