{"id":"W2992897731","doi":"10.1093/forestscience/49.1.1","title":"An Indirect Search Algorithm for Harvest-Scheduling Under Adjacency Constraints","year":2003,"lang":"en","type":"article","venue":"Forest Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Adjacency list; Simulated annealing; Mathematical optimization; Best-first search; Hill climbing; Search algorithm; Algorithm; Guided Local Search; Computer science; Greedy algorithm; Scheduling (production processes); Integer programming; Beam search; Mathematics","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.001880551,0.0001224038,0.0001220939,0.0001697545,0.000281851,0.0001576594,0.0003364359,0.00005799072,0.0000479428],"category_scores_gemma":[0.0002711946,0.0001271465,0.00003129496,0.000781585,0.0004148028,0.0005148523,0.00001679602,0.0001322412,0.0000156749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009396208,"about_ca_system_score_gemma":0.0001990713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003371222,"about_ca_topic_score_gemma":0.000004729101,"domain_scores_codex":[0.998666,0.00005317209,0.0001777324,0.0003005206,0.0002986097,0.0005039443],"domain_scores_gemma":[0.9992579,0.0001165099,0.00002301964,0.0002643939,0.0001386535,0.000199534],"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":[4.393981e-7,0.00001379532,0.001030146,0.000009073407,0.000003320015,7.980083e-7,0.0001698139,0.9613118,0.003202483,0.01167836,0.000006062356,0.02257387],"study_design_scores_gemma":[0.000213112,0.0000371079,0.002326836,0.00001590719,0.000004016366,0.00001146341,0.0001381502,0.9834641,0.01209033,0.001454203,0.00006930297,0.0001754551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1168837,0.00003140217,0.8811337,0.0000104162,0.0003450664,0.0002129199,0.000009296257,0.0002295726,0.00114391],"genre_scores_gemma":[0.4970404,0.00000326695,0.5028539,0.00002041151,0.00002418267,0.00001129772,0.00000231858,0.00001636593,0.00002786515],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3801567,"threshold_uncertainty_score":0.5184882,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03399996158010347,"score_gpt":0.3140991011701756,"score_spread":0.2800991395900721,"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."}}