Last-Mile School Shuttle Planning With Crowdsensed Student Trajectories

By processing a large dataset composed of daily trajectories of thousands of students in Singapore, the authors find that, instead of simply picking up students from their homes, an optimal school shuttle planning system needs to learn the real transportation usage and plan across all potential pickup locations for every student to generate need-satisfying routes. It is challenging, however, to perform route planning over a large number of students each having multiple potential pickup locations. The authors develop a graph-based data structure that embeds potential pickup locations of all students with the awareness of real-world constraints and existing public transits. Based on the graph structure, they prove that the optimal last-mile school shuttle planning problem is NP-hard and thereafter design a Tabu-based expansion algorithm to solve the problem, which strikes at a proper balance between the savings of students’ commute time and the total cost of operating the shuttle buses. Extensive experiments with large-scale real-world crowdsensed trajectory data demonstrate that the authors' last-mile school shuttles can save the traveling time for most students by over 20% and the savings can be up to 65% for 10% of the students.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01766316
  • Record Type: Publication
  • Files: TLIB, TRIS
  • Created Date: Jan 5 2021 2:01PM