English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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. Introduction Transportation plays dominant role in industrial & agriculture production and daily life. The optimized dispatch of transportation has been studied by many researchers. For example, Wang et al. applied ant colony algorithm based data envelopment analysis (DEA) to simulation of rapid path planning problem for logistics transportation [1]. Jia et al. adopted grey correlation and improved Floyd algorithm to optimize cold-chain logistics dispatch path [2]; Wang used optimization method to tackle total transportation cost based garbage truck dispatch problem [3]. However, there are few reports on commuting dispatch problem in transportation. Moreover, massive transportation volume commuting is different from logistics transportation and distribution. On one aspect, passengers spread over a large area, and distribution sites and locations are stable. On the other aspect, as for massive transportation volume commute, many buses may pass passenger overridden area, so the buses may either stop for boarding or dropping people, or just bypass. Thus, the massive transportation volume dispatch problem involves bus dispatch, region partition, path optimize, and travel distance balance etc. In a high school, senior 2 students come to school in new campus located in urban north. They reside in this campus from Monday to Thursday. At 16:30, Friday, transportation companies send commuters to take students to the commuter stations nearby their houses respectively, and then they come back home by themselves. On Sunday, the students need to board commuters at the commuter stations nearby their houses and return to the campus. There are 426 students spreading over the third ring road area enclosed by G1 and G1501 beltways as shown in Fig. 1. This paper studied the above dispatch problem. To ensure that the students that can arrive at home before 6 PM, a method was presented to plan reasonable transportation plans and achieve minimum transportation cost. The Determination of Commuting Stations’ Locations The maximum speed of commuter is 60 kilometers per hour in city. From Google map, it needs to drive 50.3 kilometers from the new campus to the far end P0, and the straight line distance is 35.3 kilometers. If partition the third ring road area into quadrates whose edge is 3.5 kilometers long, and let every commuter station locates at the center of the quadrate, then the distance from every spot

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