Implementation of a genetic algorithm for two-dimensional arrays using the numpy library for python

The paper implements a genetic algorithm for optimizing two-dimensional arrays using the NumPy library for Python. The main stages of the genetic algorithm, including selection, crossover, and mutation, are analyzed. The influence of various algorithm parameters on its efficiency and convergence rate is studied. It is revealed that the use of NumPy significantly accelerates computational processes due to the vectorization of operations. It is determined that the optimal settings of the algorithm parameters provide the best results when testing on various tasks. It is established that the developed algorithm demonstrates high performance and flexibility in application. The code structure is formed, allowing easy modification of the algorithm for various tasks. Recommendations for further improvement of the algorithm and its adaptation to more complex scenarios are proposed.

Authors

Institutions

Publication Details

Published
2025-05-16
DOI
https://doi.org/10.1117/12.3060436
Primary Topic
Evolutionary Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Implementation of a genetic algorithm for two-dimensional arrays using the numpy library for python

S N Masaev, Andrey Ilgov
Evolutionary Algorithms and Applications
article

Implementation of a genetic algorithm for two-dimensional arrays using the numpy library for python

S N Masaev, Andrey Ilgov
article en

Abstract

The paper implements a genetic algorithm for optimizing two-dimensional arrays using the NumPy library for Python. The main stages of the genetic algorithm, including selection, crossover, and mutation, are analyzed. The influence of various algorithm parameters on its efficiency and convergence rate is studied. It is revealed that the use of NumPy significantly accelerates computational processes due to the vectorization of operations. It is determined that the optimal settings of the algorithm parameters provide the best results when testing on various tasks. It is established that the developed algorithm demonstrates high performance and flexibility in application. The code structure is formed, allowing easy modification of the algorithm for various tasks. Recommendations for further improvement of the algorithm and its adaptation to more complex scenarios are proposed.

Siberian State Aerospace University (RU)
Openalex Percentile: Top 95%
Evolutionary Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Implementation of a genetic algorithm for two-dimensional arrays using the numpy library for python — S N Masaev, Andrey Ilgov · (2025) | TGRS Research Map | TGRS