Optimal recombination in genetic algorithms for combinatorial optimization problems. I

DOI10.2298/YJOR130731040EzbMATH Open1458.90003MaRDI QIDQ2975423FDOQ2975423

Authors: Anton Valentinovich Eremeev, Julia Viktorovna Kovalenko 

Publication date: 11 April 2017

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Recommendations

• Optimal recombination in genetic algorithms for combinatorial optimization problems. II
• On complexity of optimal recombination for flowshop scheduling problems
• The complexity of the optimal recombination for the traveling salesman problem
• On complexity of optimal recombination for one scheduling problem with setup times
• Genetic local search in combinatorial optimization

zbMATH Keywords

crossovercomplexitygenetic algorithmboolean linear programmingoptimal recombination problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10)

Cited In (16)

• The complexity of the optimal recombination for the traveling salesman problem
• Optimal recombination in genetic algorithms for combinatorial optimization problems. II
• VNS-based heuristic with an exponential neighborhood for the server load balancing problem
• Genetic algorithms for optimized re-triangulation in the context of reverse engineering.
• Hybridizations of evolutionary algorithms with large neighborhood search
• Analysis of recombinative algorithms on a non-separable building-block problem
• Optimal recombination algorithms for generalized chains
• Artificial Evolution
• On complexity of optimal recombination for one scheduling problem with setup times
• Foundations of Genetic Algorithms
• On complexity of optimal recombination for flowshop scheduling problems
• Quasi-optimal recombination operator
• Foundations of Genetic Algorithms
• Title not available (Why is that?)
• Hitting times of local and global optima in genetic algorithms with very high selection pressure
• An efficient genetic algorithm for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem

This page was built for publication: Optimal recombination in genetic algorithms for combinatorial optimization problems. I

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