Snapshot Optimal Ridesharing

This thesis deals with optimising one-to-one matching in dynamic peer ride-sharing systems. It introduces SnapPair, an algorithm that efficiently finds optimal matches between drivers and passengers, even with complex travel constraints. The thesis also explores shared taxi services with capacity set at two passengers, extending the matching problem to include vehicle allocation. By combining advanced algorithms and real-world data, the research provides valuable insights and practical solutions for improving ride-sharing efficiency and reducing travel times.