{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003194255,0.0001084493,0.0001254673,0.0001712647,0.0002223681,0.00001609093,0.00009775484,0.00002510323,0.00002039107],"category_scores_gemma":[0.000003455366,0.00009263517,0.00006470535,0.0003664437,0.00001685875,0.0004584006,4.898561e-7,0.000262932,1.341084e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001878768,"about_ca_system_score_gemma":0.00007671594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001068509,"about_ca_topic_score_gemma":0.0003998981,"domain_scores_codex":[0.9988777,0.00002140696,0.00056206,0.0001107695,0.0002900353,0.0001380112],"domain_scores_gemma":[0.9993486,0.0001400768,0.0002240859,0.00008228358,0.0001696309,0.0000352664],"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.0002358239,0.0000890634,0.002774536,0.00004379615,0.00002610022,0.000003782539,0.003907184,0.9821422,0.006704295,0.0001937722,0.000001069011,0.003878416],"study_design_scores_gemma":[0.003697795,0.0002456814,0.2611206,0.00005564101,0.00006220535,0.000002743745,0.004982823,0.7286837,0.0002786797,0.0003812783,0.0003325098,0.0001563242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6304401,0.00001685962,0.3687488,0.0001429898,0.0001127107,0.0004641018,0.00003513117,0.00003707521,0.000002260049],"genre_scores_gemma":[0.9660345,0.000004448486,0.03360511,0.00004126671,0.00001856003,0.0001042861,0.0001639828,0.00002462114,0.000003275217],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3355944,"threshold_uncertainty_score":0.3777553,"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."}}