A genetic algorithm with tournament selection as a local search method

DOI10.1134/S1990478912030039zbMATH Open1324.68172MaRDI QIDQ5263765FDOQ5263765

Authors: Anton Valentinovich Eremeev 

Publication date: 17 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1617341
• Genetic local search in combinatorial optimization
• Convergence conditions of genetic algorithms
• A new genetic algorithm specifically based on mutation and selection
• A new genetic algorithm

zbMATH Keywords

local searchapproximate solutiongenetic algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (6)

• \(k\)-means genetic algorithms with greedy genetic operators
• Genetic Algorithms with the Crossover-Like Mutation Operator for the k-Means Problem
• Win-win match using a genetic algorithm
• Hitting times of local and global optima in genetic algorithms with very high selection pressure
• Experimental results in applying of fine grained tournament selection
• Title not available (Why is that?)

This page was built for publication: A genetic algorithm with tournament selection as a local search method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263765)