Biologically inspired parent selection in genetic algorithms

DOI10.1007/S10479-019-03343-7MaRDI QIDQ2178305zbMATH OpenOpenAlexFDO

Authors Zvi Drezner, Taly Dawn Drezner

Publication date 11 May 2020

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-019-03343-7

zbMATH Keywords

genetic algorithmsquadratic assignmenthybrid genetic algorithmsplanar p-median

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 709517
• A new genetic algorithm
• A population ecology inspired parent selection strategy for numerical constrained optimization problems
• A new approach for the genetic algorithm
• Improving the genetic algorithm through new composing of migration and parent centric selection

Cites work

• scientific article; zbMATH DE number 1803759 (Why is no real title available?)
• scientific article; zbMATH DE number 1803767 (Why is no real title available?)
• scientific article; zbMATH DE number 4199950 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 714537 (Why is no real title available?)
• A projection method for \(l_ p\) norm location-allocation problems
• An Efficient Method for the Multi-Depot Location-Allocation Problem
• Anisogamy, Expenditure of Reproductive Effort, and the Optimality of Having Two Sexes
• Assignment Problems and the Location of Economic Activities
• Compounded genetic algorithms for the quadratic assignment problem
• Decomposition strategies for large-scale continuous location–allocation problems
• Enhancing the performance of hybrid genetic algorithms by differential improvement
• Experimental analysis of crossover and mutation operators on the quadratic assignment problem
• Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
• Gender-Specific Genetic Algorithms^*
• Genetic algorithm learning and evolutionary games
• Handbook of applied optimization
• Heuristic Methods for Location-Allocation Problems
• Heuristic methods for large centroid clustering problems
• Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
• Introduction to Genetic Algorithms
• Introduction to evolutionary computing
• Location-Allocation Problems
• New heuristic algorithms for solving the planar p-median problem
• New local searches for solving the multi-source Weber problem
• On the Complexity of Some Common Geometric Location Problems
• Phenotypic plasticity, the Baldwin effect, and the speeding up of evolution: the computational roots of an illusion
• Solving large \(p\)-median problems with a radius formulation
• TSPLIB—A Traveling Salesman Problem Library
• Testing of hybrid genetic algorithms for structured quadratic assignment problems
• The quadratic assignment problem. Theory and algorithms

Cited in

(5)

• The obnoxious facilities planar \(p\)-median problem
• A population ecology inspired parent selection strategy for numerical constrained optimization problems
• Biologically inspired methods for control of evolutionary algorithms
• Improved starting solutions for the planar \(p\)-median problem
• A trajectory based heuristic for the planar \(p\)-median problem

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Biologically inspired parent selection in genetic algorithms

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