{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/scaling-laws-of-dynamic-high-capacity-ride","title":"Scaling Laws of Dynamic High-Capacity Ride-Sharing","arxiv_id":"2305.07236","date":"2023-05-12","proceeding":null,"authors":["Wang Chen","Jintao Ke","Linchuan Yang"],"abstract":"Dynamic ride-sharing services, including ride-pooling offered by ride-hailing platforms and demand-responsive buses, have become an essential part of urban mobility systems. These services cater to personalized and on-demand mobility requirements while simultaneously improving efficiency and sustainability by accommodating several trip requests within a single ride. However, quantifying the advantages and disadvantages of dynamic ride-sharing, particularly high-capacity ride-sharing, remains a challenge due to the complex dynamics that depend on several factors, including matching algorithms, vehicle capacity, transportation network topology, and spatiotemporal demand and supply distribution. In this study, we conduct extensive experiments on an agent-based simulation platform calibrated by real-world mobility data from Chengdu, Hong Kong, and Manhattan. Our findings reveal a few scaling laws that can effectively measure how key performance metrics such as passenger service rate and vehicle occupancy rate change with a dimensionless system loading factor that reflects the relative magnitude of demand versus supply. Moreover, our results indicate that these scaling laws are universal for different network topologies and supply-demand situations. As a result, these scaling laws offer a means for urban planners, city managers, and ride-hailing platforms to quantify the potential benefits and drawbacks of dynamic ride-sharing under different circumstances and to design better operational and regulatory strategies.","url_abs":"https://arxiv.org/abs/2305.07236v1","url_pdf":"https://arxiv.org/pdf/2305.07236v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"scaling-laws-of-dynamic-high-capacity-ride","repo_url":"https://github.com/hku-smart-mobility-lab/ride-sharing-simulator","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"}],"methods":[{"method_slug":null,"method_name":null}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"hku-smart-mobility-lab/ride-sharing-simulator","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"8997a36fb84f44a49b0eae18abd2de9b5a59993b3b600b8d6dd4ee81a2a4eb18","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}