Name
Abstract | ||
|---|---|---|
In this paper we suggest a new rule for parent selection in genetic algorithms inspired by natural evolutionary processes. The new rule is simple to implement in any genetic or hybrid genetic algorithm. We also review some biological principles that inspire genetic algorithms and their extensions. The new rule is tested on the planar p-median problem, also termed the location–allocation problem or the multi-source Weber problem, and the quadratic assignment problem. The genetic algorithm incorporating the new rule provided better results without increasing the computing time including five new best known solutions to well researched problem instances. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s10479-019-03343-7 | Annals of Operations Research |
Keywords | Field | DocType |
Genetic algorithms, Hybrid genetic algorithms, Quadratic assignment, Planar p-median | Mathematical optimization,Quadratic assignment problem,Theoretical computer science,Hybrid genetic algorithms,Genetic algorithm,Weber problem,Mathematics | Journal |
Volume | Issue | ISSN |
287 | 1 | 0254-5330 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zvi Drezner | 1 | 1195 | 140.69 |
| taly dawn drezner | 2 | 0 | 0.68 |