Abstract
The concept of the Euclidean combinatorial configuration as the mapping of an abstract set into an arithmetic Euclidean space is introduced. The problem of optimization on the set of Euclidean combinatorial configurations is formulated. The peculiarities of the application of genetic algorithms for solving this class of problems are considered. Principles of formation of the initial population, selection mechanisms, choice of crossover operators and mutation are described. The proposed approach is illustrated on the problem of combinatorial optimization on the set of permutations. Examples of the construction of various crossover operators for Euclidean permutation configurations are given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
