Extended Data Table 1 Real-time computation run times in milliseconds

From: Addressing the minimum fleet problem in on-demand urban mobility

  1. Considering the day with the highest number of trips in the year, which is day 43 for the year 2011 with around 505,000 trips, we compute the breakdown of the run times for building a bipartite trip–vehicle graph, tg, and finding the optimum trip-to-vehicle assignment, ttva, by receiving the trip requests in the next minute, on the basis of the proposed online network-based batching model. The total run time tg + ttva per batch remains under 100 ms for x = 1.2 and under 200 ms for x = 2.0. This shows the practicality of the proposed method from the computational point of view. We have also varied the maximum delay, Δt between 2 min and 6 min. The average is computed for all the minutes in the day, while the maximum times correspond to the batch computation with the maximum run time. The results are based on ten separate runs for the entire day, each time reinitializing the fleet deployment warm-up phase, as described in Methods. The experiments were performed on a Linux workstation equipped with an Intel Core i7-3930K central processing unit (CPU) running at 3.20 GHz and 32 GB of random access memory (RAM). For maximum fairness, the running times are based on the actual times spent running the program, not on the CPU clocks assigned to the process.