Small Variations of Basic Solution Method for Non-numerical Optimization

The universal method for the solution of problems of non-numerical optimization is considered. Concepts of basic element, small and elementary variations were defined. Definitions of norm and metric distance on the code's space of non-numerical elements were introduced. A genetic algorithm on the basis of small variations for basic solution was presented. Examples of solutions of travelling salesman problem and synthesis of control were presented.