Author(s)

Zihan Yang, Guanhua Zhang, Chang Qu

Corresponding Author

Zihan Yang

ABSTRACT

In recent years, many universities across the country have expanded rapidly and established many new campuses. The use of school bus transportation between campuses has become a major trend. The aim of this paper is to optimize the space-time allocation scheme of school buses by establishing a mathematical model to reduce the number of empty returns of school buses between campuses, thus reducing the waste of administrative resources of universities and ensuring the normal development of teaching work. This paper uses a 0 and 1 assignment model, i.e. buses that have never been sent out are assigned a value of 0; buses that are sent to and temporarily stay at the old campus are assigned a value of 1, and buses that are sent to and temporarily stay at the new campus are assigned a value of -1. Using the enumeration iteration method, a specific one-latitude time axis is established, i.e. the first time point is assigned a value of 0, and so on, each time point is i (the value of i is 0-20). By constantly changing the initial setting value and optimizing the basic algorithm, the data is analyzed to obtain the minimum number of empty return vehicles under different conditions and the allocation ratio of school buses between the old and new campuses, thus greatly improving the efficiency of school bus transportation between different campuses. Using the 0 1 allocation model established in this paper, the probability of empty school bus returns can be effectively reduced, which is of practical significance to major universities with multiple campuses.

KEYWORDS

School bus empty return problem, multi-objective optimization model, dynamic change, iterative algorithm, optimal parameters