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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Safely serving the school transportation demand with the minimum number ofbuses is one of the highest financial goals of school transportation directors.To achieve that objective, a good and efficient way to solve the routing andscheduling problem is required. Due to the growth of the computing power, thespotlight has been shed on solving the combined problem of the school busrouting and scheduling problem. We show that an integrated multi-school busrouting and scheduling can be formulated with the help of trip compatibility. Anovel decomposition algorithm is proposed to solve the integrated model. Themerit of this integrated model and the decomposition method is that with theconsideration of the trip compatibility, the interrelationship between therouting and scheduling sub-problems will not be lost in the process ofdecomposition. Results show the proposed decomposed problem could provide thesolutions using the same number of buses as the integrated model in muchshorter time (as little as 0.6%) and that the proposed method can save up to26% number of buses from existing research.

SCDA: School Compatibility Decomposition Algorithm for Solving the Multi-School Bus Routing and Scheduling Problem