Szukana fraza: [Abstrakt = "This paper contains a formal presentation and description of a method of solving the problem of both determining the set of bus stops and the assignment of students that are authorized to transport to these stops. This issue can be treated as a subproblem of the school bus routing problem \(SBRP\). Although the problems of the SBRP class are one of the earliest logistics problems solved using methods of operations research, they remain valid and are the subject of research, as evidenced by numerous contemporary publications. Unfortunately, in most of the problems of SBRP class described in the literature, the problem of determining the bus stops network and allocation of students to the particular stops is very often ignored. Basing on the assumption that a small number of bus stops, from which the students are taken or to which they are transported, facilitates the school transport process, the paper focuses on the problem of minimizing the number of active bus stops. The main result of this paper is a proposed greedy algorithm to solving the problem of determining the minimum number of school bus stops. To illustrate the functioning of the proposed algorithm, a simple numerical example has been presented."]

Wyników: 0