{"id":"W6959748340","doi":"10.1155/atr/9941645","title":"Efficient Algorithm for the Nonadditive Traffic Assignment Problem With Link Capacity Constraints","year":2025,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Plant Taxonomy and Phylogenetics","field":"Agricultural and Biological Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Convergence (economics); Stability (learning theory); Variational inequality; Augmented Lagrangian method; Lagrangian relaxation; Cartesian product; Decomposition; Traffic flow (computer networking)","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009189415,0.001154406,0.001111485,0.0008099519,0.0007552505,0.00127529,0.001823332,0.001390329,0.007595008],"category_scores_gemma":[0.002706127,0.0005590178,0.0008522625,0.001173021,0.0006249785,0.001284012,0.001626871,0.002339606,0.001916006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001123469,"about_ca_system_score_gemma":0.003155033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005260767,"about_ca_topic_score_gemma":0.007021759,"domain_scores_codex":[0.9994487,0.0001349049,0.0000271251,0.0001454805,0.0001481236,0.00009559596],"domain_scores_gemma":[0.999254,0.0004235086,0.00006935068,0.00006951583,0.0001477052,0.00003586814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004667793,0.0001087995,0.0003853788,0.0001828136,0.00003283401,0.00008365019,0.0001036417,0.8038028,0.001897231,0.07188482,0.004881439,0.1165899],"study_design_scores_gemma":[0.00001884125,0.00001709378,0.00004358298,0.000009193697,0.000004324098,0.00002466269,0.00001855601,0.9824576,0.000309193,0.01519511,0.001897127,0.000004740415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001969305,0.00007943683,0.9950196,0.00008680808,0.00003172539,0.00006154588,0.00003536345,0.0001677395,0.002548419],"genre_scores_gemma":[0.09506436,0.0002206555,0.8995466,0.0001026247,0.00005362797,0.0004999234,0.000324513,0.0001583415,0.004029339],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007595008,"threshold_uncertainty_score":0.02540779,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01254312419035141,"score_gpt":0.2077066390359486,"score_spread":0.1951635148455972,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}