TL;DR
This paper introduces a novel optimization method inspired by chase and escape dynamics, applied to combinatorial problems like the Traveling Salesman Problem, showing promising preliminary results.
Contribution
It presents a new chase and escape-based algorithm for combinatorial optimization, integrating mathematical chase and escape mechanisms into search strategies.
Findings
Preliminary tests suggest effectiveness of the chase and escape approach.
The method is applied successfully to the Traveling Salesman Problem.
Potential for further development in combinatorial optimization.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.