{"id":"W1545291929","doi":"10.5555/1402821.1402931","title":"Optimized algorithms for multi-agent routing","year":2008,"lang":"en","type":"article","venue":"","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Bidding; Computer science; Routing (electronic design automation); Mathematical optimization; Robot; Computation; Vehicle routing problem; Domain (mathematical analysis); Algorithm; Artificial intelligence; Mathematics; Computer network","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001589535,0.001219228,0.001096408,0.001035568,0.0006542011,0.001717684,0.001683402,0.001304371,0.005187857],"category_scores_gemma":[0.005488949,0.0006337031,0.0006175693,0.001493681,0.0007072152,0.002027336,0.001188753,0.001348853,0.00114066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001765528,"about_ca_system_score_gemma":0.001555828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002729655,"about_ca_topic_score_gemma":0.003002719,"domain_scores_codex":[0.9988291,0.000434563,0.00007434645,0.0001714335,0.0003605651,0.0001301251],"domain_scores_gemma":[0.9982857,0.0009293254,0.0001797975,0.0002417479,0.0003073411,0.00005595662],"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.00006681885,0.00004111301,0.0002323079,0.0001169626,0.00004131524,0.00002522257,0.00003732022,0.8468336,0.0006744833,0.06554087,0.004501129,0.08188885],"study_design_scores_gemma":[0.0000249247,0.00001454245,0.00006808547,0.00001150436,0.000007033223,0.00001379479,0.000009684009,0.962397,0.0003294253,0.0340744,0.003043477,0.00000618224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003956778,0.000858514,0.9903042,0.0001886381,0.00007790737,0.00005384559,0.00005871768,0.0003821742,0.004119255],"genre_scores_gemma":[0.2249499,0.001415581,0.7649195,0.0001699529,0.0001215609,0.0004209757,0.0003376144,0.0003311507,0.007333792],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005187857,"threshold_uncertainty_score":0.01735514,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3847822534337136,"score_gpt":0.4565785468484889,"score_spread":0.07179629341477523,"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."}}