Chases and escapes, and optimization problems

Toru Ohira, Tadaaki Hosaka, Tomoaki Nogawa

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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.

Original languageEnglish
Pages (from-to)257-261
Number of pages5
JournalArtificial Life and Robotics
Issue number3
Publication statusPublished - 3 Oct 2015


  • Combinatorial optimization
  • Problem of chases and escapes
  • Traveling salesman problem

Cite this