Improved Algorithms for Trip-Vehicle Assignment in Ride-Sharing

Authors

  • Jingyang Zhao University of Electronic Science and Technology of China Kyung Hee University, Yongin-si, South Korea
  • Mingyu Xiao University of Electronic Science and Technology of China
  • Yonghang Su University of Electronic Science and Technology of China

DOI:

https://doi.org/10.1609/aaai.v40i43.40978

Abstract

The Ride-Sharing Assignment Problem (AAAI 2018) is a fundamental problem in intelligent transportation systems, urban mobility, and algorithmic decision-making. Given a set of m vehicles with initial locations and n requests (n≤mk), each with a specified origin and destination, the goal is to assign at most k requests to each vehicle and compute corresponding routes that minimize the total travel distance. The algorithmic approach depends on whether n=mk or n
AAAI-26 / IAAI-26 / EAAI-26 Proceedings Cover

Downloads

Published

2026-03-14

How to Cite

Zhao, J., Xiao, M., & Su, Y. (2026). Improved Algorithms for Trip-Vehicle Assignment in Ride-Sharing. Proceedings of the AAAI Conference on Artificial Intelligence, 40(43), 36556–36563. https://doi.org/10.1609/aaai.v40i43.40978

Issue

Vol. 40 No. 43: AAAI-26 Technical Tracks 43

Section

AAAI Technical Track on Planning, Routing, and Scheduling