Solving Travelling Salesman Problem in a Simulation of Genetic Algorithms with DNA

In this paper it is explained how to solve a fully connected N-City travelling salesman problem (TSP) using a genetic algorithm. A crossover operator to use in the simulation of a genetic algorithm (GA) with DNA is presented. The aim of the paper is to follow the path of creating a new computational model based on DNA molecules and genetic operations. This paper solves the problem of exponentially size algorithms in DNA computing by using biological methods and techniques. After individual encoding and fitness evaluation, a protocol of the next step in a GA, crossover, is needed. This paper also shows how to make the GA faster via different populations of possible solutions.

Research of the Acoustic Characteristics of the Bell "Mazepa" of the Sofia Cathedral (Kiev) and their Comparison with Characteristics of Bulgarian Bells

Experimental researches of one of the eldest bells («Mazepa»-see Appendix1) in Ukraine, are considered in the article. The spectra and spectra- time analysis of bell ringing is embodied, main frequencies of oscillation and musical intervals of sounding are determined. Comparative description of bell sounding with the known bells of Russia and Bulgaria is given.