Algorithm and software development to allocate locomotives for transportation of freight trains

We suggest a mathematical model to allocate locomotives for transportation of freight trains. The aim of the optimization in this model is to minimize the number of locomotives used for the transportation of the trains by choosing routes of the trains and locomotives. It is supposed that the trains can be transported only at defined time intervals (so-called train paths); every locomotive has possible routes called railway hauls. We take into account the necessity of periodic maintenance. We use graph theory and integer optimization to formulate the problem. We suggest mathematical definitions of a railway haul, a train path, a train route, and a locomotive route. An heuristic search algorithm to find an approximate solution of the problem is suggested. The main idea of the algorithm is maximal usage of locomotives that started earlier than other ones. The algorithm contains three stages. A solution of the previous stage is improved at each following stage. We use transfers of the locomotives to improve the current solution. We describe software development to optimize the model. We solve the problem using the historical data of Moscow railway.Russian Science Foundation, RSF: 16-11-00062The work has been supported by Russian Science Foundation (project No 16-11-00062)

ALGORITHM AND SOFTWARE DEVELOPMENT TO ALLOCATE LOCOMOTIVES FOR TRANSPORTATION OF FREIGHT TRAINS

We suggest a mathematical model to allocate locomotives for transportation of freight trains. The aim of the optimization in this model is to minimize the number of locomotives used for the transportation of the trains by choosing routes of the trains and locomotives. It is supposed that the trains can be transported only at defined time intervals (so-called train paths); every locomotive has possible routes called railway hauls. We take into account the necessity of periodic maintenance. We use graph theory and integer optimization to formulate the problem. We suggest mathematical definitions of a railway haul, a train path, a train route, and a locomotive route. An heuristic search algorithm to find an approximate solution of the problem is suggested. The main idea of the algorithm is maximal usage of locomotives that started earlier than other ones. The algorithm contains three stages. A solution of the previous stage is improved at each following stage. We use transfers of the locomotives to improve the current solution. We describe software development to optimize the model. We solve the problem using the historical data of Moscow railway.Russian Science Foundation, RSF: 16-11-00062The work has been supported by Russian Science Foundation (project No 16-11-00062)

Separate the issues of anti-terrorist protection of medical institutions when applying biopathogens

In article the review of infectious diseases, which can be applied with the aim of biological terrorism. Considered 'critical' point of possible application of biopathogens during the act of biological terrorism in a medical facility, reflected the risk factors of their application.В статье проведен обзор инфекционных заболеваний, которые могут быть применены с целью биологического терроризма. Рассмотрены «критические» точки возможного применения биопатогенов в ходе акта биологического терроризма в медицинском учреждении, отражены факторы риска их применения

The list of potentially hazardous biopathogens affecting the functioning of the hospital phase medical evacuation

The article analyzes the biopathogenic, which can be used by medical evacuation hospital stage diversion for terrorist purposes.В статье проведен анализ биопатогенов, которые могут применяться по госпитальному этапу медицинской эвакуации диверсионным методом с террористической целью

Species composition of terrestrial vertebrates in the zone of potential impact of the Nizhneboguchanskaya Hydro Electric Power reservoir

The analysis of the species richness and landscape positioning of terrestrial vertebrate animal communities in the territory of the potential impact of the reservoir of the planned Nizhneboguchanskaya Hydro Electric Power station (HEP) was carried out. The studies were conducted in the main animal habitats according to standard methods, from 2021 to 2022. The vertebrate fauna in the flooding zone and the potential impact of the projected reservoir of the Nizhneboguchanskaya HEP includes 250 species, including 56 species of mammals, 187 species of birds, 3 species of reptiles and 4 species of amphibians. There are eight main types of biotopes was identified: dark coniferous, light coniferous, mixed and small-leaved forests, wetland complexes, meadows and rocky outcrops. A comparative analysis of faunal richness was performed for each biotope type. The study showed that the highest species diversity is observed in forest habitat: from 126 to 155 species. Of these, the highest faunal diversity is inherent in communities of mixed forests, which is post-fire and after cutting long-derivatives of coniferous forests. Also, in different forest biogeocenoses, there is a high similarity in the species composition of terrestrial vertebrates. The most specific fauna compositions have rocky outcrops, wetlands and meadows, when compared with each other and, especially, with forest biocenoses. As a rule, these habitats are critical for the survival of a number of species, some of which are protected. The preservation of these habitats during the construction and operation of the Nizhneboguchanskaya HEP reservoir will require special attention to maintain the natural level of species diversity of terrestrial vertebrates