Bio-inspired Computing Practice on Traveling Salesman Problem

Wei-jun SU

Abstract


Nature always inspires people to find something, people has inspired to proposed many new methods to solution complex optimization problem by various natural phenomenon or process of biosphere, people called the calculation method as Bio-inspired calculation, such as ant colony algorithm, in this paper has analysis the steps of ant colony algorithm and advantages, then given an advise on parameter evaluation, and as a practice example, traveling salesman problem of China 144 city has calculated, show bio-inspired computing calculation is validation and efficient.

Keywords


Bio-inspired computing, Traveling salesman problem, Ant colony algorithm, Time complexity, Convergence


DOI
10.12783/dtcse/ammso2019/30111

Refbacks

  • There are currently no refbacks.