Biologically inspired parent selection in genetic algorithms
From MaRDI portal
Publication:2178305
DOI10.1007/S10479-019-03343-7zbMATH Open1442.90203OpenAlexW2963239290MaRDI QIDQ2178305FDOQ2178305
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
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
- TSPLIB—A Traveling Salesman Problem Library
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introduction to evolutionary computing
- A projection method for \(l_ p\) norm location-allocation problems
- The quadratic assignment problem. Theory and algorithms
- Handbook of applied optimization
- Assignment Problems and the Location of Economic Activities
- Location-Allocation Problems
- Heuristic Methods for Location-Allocation Problems
- Decomposition strategies for large-scale continuous location–allocation problems
- On the Complexity of Some Common Geometric Location Problems
- Solving large \(p\)-median problems with a radius formulation
- Phenotypic plasticity, the Baldwin effect, and the speeding up of evolution: the computational roots of an illusion
- Introduction to Genetic Algorithms
- Heuristic methods for large centroid clustering problems
- New heuristic algorithms for solving the planar \(p\)-median problem
- Enhancing the performance of hybrid genetic algorithms by differential improvement
- An Efficient Method for the Multi-Depot Location-Allocation Problem
- New local searches for solving the multi-source Weber problem
- Anisogamy, Expenditure of Reproductive Effort, and the Optimality of Having Two Sexes
- Gender-Specific Genetic Algorithms*
- Title not available (Why is that?)
- Genetic algorithm learning and evolutionary games
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- Compounded genetic algorithms for the quadratic assignment problem
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
- Testing of hybrid genetic algorithms for structured quadratic assignment problems
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
Uses Software
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)
