Показать сокращенную информацию
dc.date.accessioned | 2019-01-22T20:52:28Z | |
dc.date.available | 2019-01-22T20:52:28Z | |
dc.date.issued | 2018 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/149203 | |
dc.description.abstract | © 2018, Institute of Advanced Scientific Research, Inc. All rights reserved. -Nowadays in Russia there is a problem of transport provision of students. In Russia transportation of students on buses with a driver is poorly developed. School buses are usually bought in rural sparsely populated areas. In many cases the school does not have necessary means to invest in the bulk purchase of school buses. If there is a need for transportation of children one must resort to renting a bus with a driver. In Naberezhnye Chelny city there is no specialized transport for schoolchildren. A large number of students live too far from the schools. This situation leads to the fact that schoolchildren are late for their lessons, therefore, the quality of educational services is deteriorating. There is a need to create a transport system for schools. To ensure the transportation of students, the school transport system must be integrated into the public transport system. In this paper, we considered methods of modeling transport routes, such as the traveling salesman problem, the knapsack problem, the problem of school transport routing. A new model has been constructed to describe the routing of school transport. It is based on the previously listed problems. The constructed objective function minimizes the time that schoolchildren spend on their way from home to school. The objective function will tend to a minimum with the appropriate restrictions: the total number of schoolchildren who board the bus at the bus stops should not exceed the capacity of the bus; the bus must complete its route near the school; all schoolchildren must necessarily get on the right bus and get to school. | |
dc.subject | Building the function | |
dc.subject | Finding the optimal route | |
dc.subject | Mathematical modeling | |
dc.subject | Minimizing the cost of the route | |
dc.subject | School transport | |
dc.subject | The knapsack problem | |
dc.subject | The problem of transportation of schoolchildren | |
dc.subject | The school bus routing problem | |
dc.subject | The traveling salesman problem | |
dc.subject | Transport infrastructure | |
dc.title | Mathematical formulation of the problem of the routing of school transport | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 13 Special Issue | |
dc.relation.ispartofseries-volume | 10 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 531 | |
dc.source.id | SCOPUS-2018-10-13-SID85059532271 |