{"id":"W2170796364","doi":"10.1139/x08-126","title":"Applying ant colony optimization metaheuristic to solve forest transportation planning problems with side constraints","year":2008,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Forest Management and Policy","field":"Environmental Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Ant colony optimization algorithms; Solver; Metaheuristic; Mathematical optimization; Computer science; Heuristic; Integer programming; Computation; Constraint (computer-aided design); Algorithm; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009555502,0.0007844741,0.0007104449,0.0008717548,0.000466225,0.0008818317,0.0007016429,0.0009842236,0.001203884],"category_scores_gemma":[0.002616511,0.000467159,0.0007227802,0.001131772,0.0004680384,0.0005305302,0.0004785784,0.0007119356,0.0001380279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008921704,"about_ca_system_score_gemma":0.0015768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01461271,"about_ca_topic_score_gemma":0.01344293,"domain_scores_codex":[0.9995915,0.0001948021,0.00002230171,0.00004483317,0.000088484,0.00005802336],"domain_scores_gemma":[0.9979542,0.00157984,0.0001669529,0.00006929258,0.0001802387,0.00004951291],"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.00002211436,0.00003201285,0.0003701181,0.00003149701,0.00002467934,0.00004768477,0.00001532355,0.9871258,0.0005438869,0.001614723,0.0002203467,0.009951724],"study_design_scores_gemma":[0.00001080375,0.00001538039,0.00006923822,0.000003154812,0.000007470998,0.00000950084,0.000009672275,0.9985349,0.0002578763,0.0008343814,0.0002454092,0.000002083653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2993896,0.0007545617,0.6805767,0.0005014012,0.00009439539,0.000317032,0.0002014097,0.0004521314,0.01771263],"genre_scores_gemma":[0.559289,0.0003745741,0.4376806,0.0000884605,0.0000260985,0.0002062746,0.0001873936,0.00007467244,0.002072931],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01461271,"threshold_uncertainty_score":0.0290553,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05471526528188149,"score_gpt":0.2919754907132751,"score_spread":0.2372602254313936,"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."}}