Balancing and Optimizing of Dispatching Schemes of Weekend Commuting Buses for Resident Students

Abstract

The dispatch of commuter buses with massive transportation volume is different from logistics transportation and distribution. It involves bus dispatch, region partition, path optimize, and travel distance balance etc. To tackle this problem, commuting region block planning is adopted to determine commuting stops, Dijkstra algorithm is used to determine the shortest travel route, the mileage balance constraint conditions is to construct non-linear planning model for peak covering problem, and Lingo system is used to solve it to get optimal travel path of commuter buses. The data demonstrates that the balanced and optimized school commuting dispatch plan can address the school commuting transportation problem.