The Algorithm Animation of Genetic Algorithm of Travelling Salesman Problem

The traveling salesman problem is analyzed with genetic algorithms. The best route map and tendency of optimal grade of 500 cities before the first mutation, best route map after 15 times of mutation and tendency of optimal grade of the final mutation are displayed with algorithm animation. The optimal grade is about 0.0455266 for the best route map before the first mutation, but is raised to about 0.058241 for the 15 times of mutation. It shows that through the improvements of algorithms and coding methods, the efficiency to solve the traveling problem can be raised with genetic algorithms.

Animating Algorithms as a DSP Teaching Tool

This paper introduces the notion of ‘animation’ of digital signal processing algorithms and related concepts. The purpose of the paper is threefold: (i) to introduce the idea of animation of algorithms as an adjunct to teaching DSP; (ii) to discuss some possible approaches to developing such animations, and motivate possible scenarios where algorithm animation would be of benefit in explaining abstract DSP principles; and (iii) to provide details on a method which successfully demonstrates the algorithm animations using a web browser without the need for user-installed software or browser plug-ins.