# Proposed modified computational model for the amoeba-inspired combinatorial optimization machine

arXiv: https://arxiv.org/abs/2404.06828 · HTML: https://mlsanity.com/paper/2404.06828/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 30 references that are in the map.
- First posted on arXiv 10 Apr 2024.

## Builds on (most cited first, 1 of 1)

- [Ising formulations of many NP problems](https://mlsanity.com/paper/1302.5843/) (2013)

## Abstract (arXiv)

A single-celled amoeba can solve the traveling salesman problem through its shape-changing dynamics. In this paper, we examine roles of several elements in a previously proposed computational model of the solution-search process of amoeba and three modifications towards enhancing the solution-search preformance. We find that appropriate modifications can indeed significantly improve the quality of solutions. It is also found that a condition associated with the volume conservation can also be modified in contrast to the naive belief that it is indispensable for the solution-search ability of amoeba. A proposed modified model shows much better performance.