{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000246178,0.00008003414,0.00007075503,0.00002602777,0.00005469618,0.00002439599,0.0001600452,0.00003358377,0.00005844731],"category_scores_gemma":[0.00003605984,0.00005397062,0.00002758677,0.00008057062,0.00001866793,0.0001131682,0.00001176759,0.00008060956,0.000005648865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001786055,"about_ca_system_score_gemma":0.000005216596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001784274,"about_ca_topic_score_gemma":0.000004719944,"domain_scores_codex":[0.9995751,0.00002688451,0.0001142516,0.0001026881,0.00004535372,0.0001356775],"domain_scores_gemma":[0.9995876,0.000121586,0.00001728862,0.0001974928,0.00004153401,0.00003452559],"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.00001996662,0.00005928641,0.001178221,0.00005167355,0.00006002122,2.885439e-7,0.002563746,0.975874,0.0001776235,0.007216281,0.0006674737,0.01213139],"study_design_scores_gemma":[0.0001185603,0.00003018046,0.00141462,0.000002477865,0.00001439176,0.000002522851,0.0002550529,0.9967274,0.0007115403,0.0003763687,0.0002620764,0.00008480441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001137868,0.00001615313,0.9599875,0.000006723893,0.00008259307,0.0003288508,0.00000236214,0.000337602,0.03810041],"genre_scores_gemma":[0.4720371,0.000002104877,0.5276861,0.00001890045,0.00003153608,0.00007063939,0.000004200101,0.00002074544,0.0001286381],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4708993,"threshold_uncertainty_score":0.2200858,"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."}}