{"id":"W1915173029","doi":"10.1139/x2012-063","title":"Route selection for best distances in road databases based on drivers’ and customers’ preferences","year":2012,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Selection (genetic algorithm); Payment; Shortest path problem; Path (computing); Quality (philosophy); Integer programming; Computer science; Database; Operations research; Mathematics; Algorithm; World Wide Web; Artificial intelligence; Graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"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.002347009,0.0007695851,0.001429287,0.003197698,0.0007155457,0.002286681,0.001685912,0.0009342346,0.003380726],"category_scores_gemma":[0.006331015,0.0006869134,0.0007692973,0.003504681,0.0003061114,0.002809926,0.001003084,0.0006478541,0.0007431095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001205731,"about_ca_system_score_gemma":0.001302773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006868353,"about_ca_topic_score_gemma":0.01063321,"domain_scores_codex":[0.9986172,0.0004695936,0.00009589932,0.0003243044,0.0003094546,0.0001835169],"domain_scores_gemma":[0.9972759,0.001527299,0.00025707,0.000206786,0.0005557135,0.0001773166],"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.001261672,0.0007098151,0.02319721,0.0004333308,0.0002511314,0.0003034633,0.0007246621,0.6084698,0.007029459,0.01229952,0.008871365,0.3364485],"study_design_scores_gemma":[0.00006760653,0.0001398664,0.00422914,0.00002947495,0.00006378987,0.0001371602,0.0005596358,0.9808929,0.003176732,0.008151889,0.002508966,0.00004276442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5584232,0.0008110805,0.4285726,0.0005521668,0.00003506647,0.0004110583,0.00162835,0.0008089597,0.008757598],"genre_scores_gemma":[0.7640459,0.0002884631,0.2307019,0.00006637511,0.00001729435,0.0002119226,0.002190818,0.0001448119,0.002332492],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006868353,"threshold_uncertainty_score":0.0136568,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1068229686329544,"score_gpt":0.3481430955516873,"score_spread":0.2413201269187328,"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."}}