Real-time city-scale ridesharing via linear assignment problems
نویسندگان
چکیده
منابع مشابه
Dynamic Matching for Real-Time Ridesharing
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...
متن کاملGPU-Based Heuristic Solver for Linear Sum Assignment Problems Under Real-time Constraints
In this paper we modify a fast heuristic solver for the Linear Sum Assignment Problem (LSAP) for use on Graphical Processing Units (GPUs). The motivating scenario is an industrial application for P2P live streaming that is moderated by a central node which is periodically solving LSAP instances for assigning peers to one another. The central node needs to handle LSAP instances involving thousan...
متن کاملLarge Scale Real-time Ridesharing with Service Guarantee on Road Networks
Urban traffic gridlock is a familiar scene. At the same time, the mean occupancy rate of personal vehicle trips in the United States is only 1.6 persons per vehicle mile. Ridesharing has the potential to solve many environmental, congestion, pollution, and energy problems. In this paper, we introduce the problem of large scale real-time ridesharing with service guarantee on road networks. Trip ...
متن کاملEigenvalue Assignment Of Discrete-Time Linear Systems With State And Input Time-Delays
Time-delays are important components of many dynamical systems that describe coupling or interconnection between dynamics, propagation or transport phenomena, and heredity and competition in population dynamics. The stabilization with time delay in observation or control represents difficult mathematical challenges in the control of distributed parameter systems. It is well-known that the stabi...
متن کاملOn Very Large Scale Assignment Problems
In this paper we present computational testing results on very large scale random assignment problems. We consider a fully dense assignment problem with 2n nodes. Some conjectured or derived properties regarding fully dense assignment problems including the convergence of the optimal objective function value and the portion of nodes assigned with their kth best arc have been verified for networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part C: Emerging Technologies
سال: 2019
ISSN: 0968-090X
DOI: 10.1016/j.trc.2019.01.019