{"id":"W1971150951","doi":"10.1109/icsmc.2011.6083801","title":"An interactive heuristic approach for the P-forest problem","year":2011,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Heuristics; GRASP; Greedy randomized adaptive search procedure; Computer science; Exploit; Heuristic; Domain (mathematical analysis); Greedy algorithm; Process (computing); Artificial intelligence; Mathematical optimization; Machine learning; Algorithm; Mathematics; Software engineering","routes":{"ca_aff":true,"ca_fund":true,"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.001580433,0.00101231,0.0008541112,0.0009372441,0.0006658756,0.0008758006,0.002242482,0.001450594,0.005145905],"category_scores_gemma":[0.004191636,0.0003610699,0.0009497034,0.0008669251,0.0009474665,0.001390672,0.001200316,0.001185238,0.0006616401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006233013,"about_ca_system_score_gemma":0.001567688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002349427,"about_ca_topic_score_gemma":0.003592706,"domain_scores_codex":[0.9984398,0.0007627381,0.0000495794,0.0001871064,0.0004112261,0.0001494462],"domain_scores_gemma":[0.9979304,0.001548645,0.0001233973,0.0002117524,0.0001252499,0.00006058181],"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.0001930575,0.0002941615,0.0007001478,0.0002965093,0.00008581315,0.000212355,0.0001752728,0.7644686,0.003486519,0.04992354,0.002759764,0.1774044],"study_design_scores_gemma":[0.00007191886,0.0001291651,0.0001312044,0.00002458401,0.0000231317,0.0001437711,0.00005424467,0.9757833,0.00140786,0.01841298,0.003794268,0.00002358015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005938364,0.0001299098,0.9905363,0.00005851943,0.0000145621,0.0001058476,0.00002301892,0.0003278946,0.002865632],"genre_scores_gemma":[0.1769208,0.0002243742,0.8204793,0.0001224125,0.00003236091,0.0004912782,0.0001545286,0.0001445269,0.001430355],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005145905,"threshold_uncertainty_score":0.01721478,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.040203528840614,"score_gpt":0.2757635323971803,"score_spread":0.2355600035565663,"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."}}