{"id":"W4307641870","doi":"10.1155/2022/2999162","title":"An Auction-Based Multiagent Simulation for the Matching Problem in Dynamic Vehicle Routing Problem with Occasional Drivers","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Ministry of Science and Technology, Taiwan","keywords":"Common value auction; Computer science; Matching (statistics); Time horizon; Compensation (psychology); Interval (graph theory); Mathematical optimization; Routing (electronic design automation); Simple (philosophy); Vehicle routing problem; Operations research; Simulation; Distributed computing; Real-time computing; Engineering; Microeconomics; Computer network; Economics; Mathematics","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.001051506,0.0004347216,0.0006438356,0.0004199528,0.0005171576,0.0007088684,0.0009915569,0.001067377,0.002145707],"category_scores_gemma":[0.002222928,0.0003601057,0.0006479223,0.00034831,0.0004755129,0.0006736683,0.000617108,0.0008425476,0.0001274099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009137435,"about_ca_system_score_gemma":0.001242842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01415146,"about_ca_topic_score_gemma":0.009363357,"domain_scores_codex":[0.9996705,0.0001900108,0.0000148428,0.00003753328,0.00004503083,0.00004204354],"domain_scores_gemma":[0.9981498,0.001356946,0.0001293913,0.00009020196,0.0001624359,0.0001114083],"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.00002282276,0.0000304786,0.0003071096,0.000009926929,0.000007762314,0.000019191,0.00001203198,0.9965628,0.0001819365,0.001940196,0.00004531919,0.0008604432],"study_design_scores_gemma":[0.000006346065,0.000008890028,0.00003029583,7.717807e-7,0.000001453881,0.000001805134,0.000004120958,0.9995086,0.00005374955,0.0003218726,0.00006099655,0.000001133433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5664128,0.0002804191,0.4140671,0.0005117978,0.0001054722,0.0002568628,0.0003181506,0.000379399,0.01766798],"genre_scores_gemma":[0.9461759,0.00007744587,0.05206593,0.00003128836,0.000008701873,0.0001194794,0.00008238615,0.00001974162,0.001419105],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01415146,"threshold_uncertainty_score":0.02813816,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007588048445034803,"score_gpt":0.2498766193558282,"score_spread":0.2422885709107934,"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."}}