{"url":"/task/equilibrium-traffic-assignment","name":"Equilibrium traffic assignment","slug":"equilibrium-traffic-assignment","description_markdown":"training surrogate models to approximate user equilibrium network traffic assignment, which is a convex optimization problem.","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":6,"papers_with_code":1,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/equilibrium-traffic-assignment-on-equilibrium","slug":"equilibrium-traffic-assignment-on-equilibrium","dataset":"Equilibrium-Traffic-Networks/Eastern Massachusetts","dataset_url":null,"rows_in_archive":1,"metrics":["MAPE (%)"],"first_row_in_archive_order":{"model":"GIN-GA","paper_title":"A hybrid deep-learning-metaheuristic framework for bi-level network design problems","paper_url":"/paper/a-hybrid-deep-learning-metaheuristic","paper_date":"2023-03-10","arxiv_id":"2303.06024","code_links":[{"title":"bahmanmdd/HDLMF_GIN-GA","url":"https://github.com/bahmanmdd/HDLMF_GIN-GA"}],"syntology":null}}],"datasets":[{"url":"/dataset/equilibrium-traffic-networks","name":"Equilibrium-Traffic-Networks","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/model-optimization","name":"Model Optimization"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":1,"of":1,"tagged_in_all":6,"items":[{"url":"/paper/a-hybrid-deep-learning-metaheuristic","title":"A hybrid deep-learning-metaheuristic framework for bi-level network design problems","date":"2023-03-10","arxiv_id":"2303.06024","repositories_listed":1,"syntology":null}],"syntology_records":0,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}