INTELLECTUAL DATA PROCESSING METHODS: ANT ALGORITHMS

On example, the traveling salesman problem is considered as a discrete algorithm of solution optimization problems introduced components self-organization ant colony: accidental, multiple interaction, negative and positive components of communication. Compared to the exact methods of combinatorial optimization ant algorithms find positive salesman routes more quickly, the effectiveness of ant algorithms increases with increasing dimension optimization problems.