2018
DOI: 10.15388/informatica.2018.178
|View full text |Cite
|
Sign up to set email alerts
|

Some Further Experiments with Crossover Operators for Genetic Algorithms

Abstract: Crossover operators play a very important role by creation of genetic algorithms (GAs) which are applied in various areas of computer science, including combinatorial optimization. In this paper, fifteen genetic crossover procedures are designed and implemented using a modern C# programming language. The computational experiments have been conducted with these operators by solving the famous combinatorial optimization problem-the quadratic assignment problem (QAP). The results of the conducted experiments on t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…Several crossover operators were implemented and examined. Short descriptions of the crossover procedures are provided below (see also [ 124 , 125 ]).…”
Section: Hybrid Genetic-hierarchical Algorithm For the Quadratic Amentioning
confidence: 99%
See 1 more Smart Citation
“…Several crossover operators were implemented and examined. Short descriptions of the crossover procedures are provided below (see also [ 124 , 125 ]).…”
Section: Hybrid Genetic-hierarchical Algorithm For the Quadratic Amentioning
confidence: 99%
“…The universal crossover (UNIVX) [ 124 ] distinguishes for its versatility and the possibility of flexible usage depending on the specific needs of the user. It is somewhat similar to what is known as a simulated binary crossover [ 126 ].…”
Section: Hybrid Genetic-hierarchical Algorithm For the Quadratic Amentioning
confidence: 99%
“…The most frequently used algorithms in the literature are genetic algorithm, simulated annealing, variable neighbourhood search, tabu search, etc. (see Gomes et al, 2014;Reisi-Nafchi and Moslehi, 2015;Kurdi, 2015;Zhang and Wong, 2016;Martin et al, 2016;Akbari and Rashidi, 2016;Niroomand et al, 2016;Quintana et al, 2017;Hsieh, 2017;Hu et al, 2016;Ghadiri Nejad and Banar, 2018;Misevičius et al, 2018;Vizvári et al, 2018;Dugonik et al, 2019;Ullah et al, 2020;Hassanpour, 2020;Aliya et al, 2020;Fernández et al, 2020;Hussain and Khan, 2020).…”
Section: Introductionmentioning
confidence: 99%
“…It is a method to find the optimal solution or approximate optimal solution to a complex problem by simulating the natural evolution process. It has been used in neural networks 22 , combinatorial optimization 23 , artificial intelligence 24 , 25 , genetic programming 26 , data mining 27 and other fields. The optimization principle is shown in Fig.…”
Section: Introductionmentioning
confidence: 99%