Time-Sensitive Route Planning on Bus Networks

This paper addresses a practical and challenging problem: finding optimal routes on bus networks considering time-dependent factors like bus schedules and waiting times. The authors propose a modified graph structure and two algorithms (brute-force and EA-Star) to solve this problem. The EA-Star algorithm, combining A* search with a focus on promising POI visit sequences, is a key contribution for improving efficiency. The use of real-world New York bus data validates the approach.

• •Addresses the time-sensitive multiple POIs route planning problem on bus networks.
• •Proposes a modified graph structure to represent the bus network.
• •Introduces the EA-Star algorithm, combining A* search with a focus on promising POI visit sequences, for improved efficiency.
• •Validated using New York bus network datasets.