{"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/estimating-multi-year-247-origin-destination","title":"Estimating multi-year 24/7 origin-destination demand using high-granular multi-source traffic data","arxiv_id":"1901.09266","date":"2019-01-26","proceeding":null,"authors":["Wei Ma","Zhen","Qian"],"abstract":"Dynamic origin-destination (OD) demand is central to transportation system\nmodeling and analysis. The dynamic OD demand estimation problem (DODE) has been\nstudied for decades, most of which solve the DODE problem on a typical day or\nseveral typical hours. There is a lack of methods that estimate high-resolution\ndynamic OD demand for a sequence of many consecutive days over several years\n(referred to as 24/7 OD in this research). Having multi-year 24/7 OD demand\nwould allow a better understanding of characteristics of dynamic OD demands and\ntheir evolution/trends over the past few years, a critical input for modeling\ntransportation system evolution and reliability. This paper presents a\ndata-driven framework that estimates day-to-day dynamic OD using high-granular\ntraffic counts and speed data collected over many years. The proposed framework\nstatistically clusters daily traffic data into typical traffic patterns using\nt-Distributed Stochastic Neighbor Embedding (t-SNE) and k-means methods. A\nGPU-based stochastic projected gradient descent method is proposed to\nefficiently solve the multi-year 24/7 DODE problem. It is demonstrated that the\nnew method efficiently estimates the 5-minute dynamic OD demand for every\nsingle day from 2014 to 2016 on I-5 and SR-99 in the Sacramento region. The\nresultant multi-year 24/7 dynamic OD demand reveals the daily, weekly, monthly,\nseasonal and yearly change in travel demand in a region, implying intriguing\ndemand characteristics over the years.","url_abs":"http://arxiv.org/abs/1901.09266v1","url_pdf":"http://arxiv.org/pdf/1901.09266v1.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":"estimating-multi-year-247-origin-destination","repo_url":"https://github.com/Lemma1/DPFE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":null,"task_name":"GPU"},{"task_slug":"traffic-prediction","task_name":"Traffic Prediction"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"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":"Lemma1/DPFE","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":"eb44f61ca291c68683a1436a2c814ac73f4549ae907c2b41caea7ad795163da4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}