Intellectual algorithms for the digital platform of “smart” transport

Abstract

In conformity with the concept of a “smart” city, resources of all municipal services are to be used in an optimum manner thereby ensuring maximum comfort for all city dwellers. It particularly concerns city passenger transport, the basic part of a “smart” city, for which development of an intellectual digital platform allowing operational management of transport processes as well as reaction to events in real time is essential at present. Development of proposals and recommendations in improving and developing the existing intellectual digital solutions is essential for the municipality of Samara, as available software products use simplified optimization models and do not take into account the existing restrictions, therefore leading to results which do not meet the demands of city dwellers in the full extent. This research is devoted to the development of the digital transport platform allowing city dwellers to obtain up-to-date information about city transport and about the possibility of optimizing their routes. In this research analysis of various models suitable for the solution of the mentioned aim is conducted, models suitable for the formulated tasks under the conditions of the most significant restrictions are chosen for the purpose of optimization of passenger flows and creating an intellectual system. Passenger flow processes based on dynamic modeling which are analyzed in this research envisage using models based on the concept of metaheurustic, the latter being the particle swarm method, the ant colony algorithm, iteration technique, the combinatorial method, etc. An algorithm of using these methods with a variant of modified transport infrastructure worked out with due regard to the changing requirements to passenger traffic is also proposed. The intellectual system created on the basis of the chosen models and algorithms will allow obtaining the necessary predictive information for city dwellers using public transport.