{"id":"W2604557004","doi":"10.5430/air.v6n2p27","title":"Combining ant colony optimization with 1-opt local search method for solving constrained forest transportation planning problems","year":2017,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Forest Biomass Utilization and Management","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Ant colony optimization algorithms; Computer science; Robustness (evolution); Scale (ratio); Constraint (computer-aided design); Process (computing); Local search (optimization); Operations research; Engineering; Mathematics; Geography","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.0008971803,0.0007476648,0.0008667657,0.0008867799,0.0003210889,0.000562774,0.0008801377,0.0007409627,0.001246329],"category_scores_gemma":[0.001614121,0.000419792,0.0006345136,0.0008624298,0.000376862,0.0005537017,0.0007003019,0.00058306,0.0002595608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004488495,"about_ca_system_score_gemma":0.001348952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006898597,"about_ca_topic_score_gemma":0.007780113,"domain_scores_codex":[0.9995995,0.0001587928,0.00002221615,0.00005270196,0.0001296771,0.00003721306],"domain_scores_gemma":[0.9994274,0.0003474681,0.00005830041,0.00002861613,0.0001105467,0.00002767188],"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.00002435799,0.00004185337,0.0003122647,0.00007193952,0.00002595681,0.00005727463,0.00002944244,0.9586009,0.001694303,0.002164564,0.0004989711,0.03647814],"study_design_scores_gemma":[0.000008376144,0.00002054512,0.00003697261,0.000002860778,0.000004454339,0.000008330449,0.000004019726,0.9988989,0.0002040007,0.0005110777,0.0002978156,0.000002731596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02545106,0.0002613333,0.9689652,0.0001237305,0.00004103106,0.0001327891,0.00003910749,0.0004257177,0.00455991],"genre_scores_gemma":[0.2680307,0.0002267759,0.7285006,0.0001270383,0.00003677299,0.0003609148,0.0001060337,0.000116126,0.002494981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006898597,"threshold_uncertainty_score":0.01371688,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1574298578786694,"score_gpt":0.4047587758549444,"score_spread":0.247328917976275,"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."}}