Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
611 14 |
Ultima descărcare din IBN: 2022-01-19 23:52 |
Căutarea după subiecte similare conform CZU |
004.023+004.8+519.85 (1) |
Информационные технологии. Вычислительная техника. Обработка данных (4184) |
Искусственный интеллект (307) |
Исследование операций (169) |
SM ISO690:2012 HUSSAIN, Abid, CHEEMA, Salman A.. A new multi-offspring crossover operator for genetic algorithm to facilitate the traveling salesman problem. In: Computer Science Journal of Moldova, 2019, nr. 3(81), pp. 318-354. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 3(81) / 2019 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 004.023+004.8+519.85 | ||||||
Pag. 318-354 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
This research work provides a detailed working principle and official analysis of a multi-offspring crossover operator. The proposed operator explains the true theory of survival-of-fittest using the foundation of evolutionary theories of biology and ecological theories of mathematics. We found a considerable improvement because the proposed operator enhances the opportunity of having better offspring, which results in highly competitive population. Simulation results of this operator with other competitor crossover operators for one of the combinatorial optimization problems, i.e. traveling salesman problem, are obviously showing its pros at better accuracy level. Moreover, the t-test and performance index (PI) establishes the improved significance and accuracy levels of the proposed operator. Preferable results of this operator not only confirm its advantages over the others, but also show long run survival of a generation having a number of offspring more than the number of parents with the help of mathematical ecology theory. |
||||||
Cuvinte-cheie Traveling Salesman Problem, genetic algorithms, crossover operators, multi-offspring, performance index |
||||||
|