English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The work is devoted to the study of genetic algorithms on the example of the search for the best ways to support“Transit challenge” or “Subway Challenge” system. Based on the rules of “Transit challenge” and the tasks of thesalesman, the problem of stations was formulated - the search for the best way to visit all subway stations in the shortestpossible time. Based on the graph theory, a mathematical model of the metrophone system was developed. To solve thestation problem, a genetic algorithm has been developed: the method of genome representation, population mutationand genome crossing rules have been chosen. On the basis of the experimental study of the genetic algorithm the mosteffective parameters were selected and recommendations on the solution of the station problem for “Transit challenge”of different dimensions were developed.

RESEARCH OF GENETIC ALGORITHMS FOR SEARCHING OPTIMAL WAYS IN THE SYSTEM OF CONDUCTING METROMARATHONS