{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009794431,0.0008379502,0.001469098,0.001192129,0.0007966119,0.0009600807,0.001540253,0.001468487,0.006468443],"category_scores_gemma":[0.002542192,0.0007651884,0.0007919929,0.001405491,0.0007195755,0.00134158,0.001371078,0.001464512,0.0007344563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001024212,"about_ca_system_score_gemma":0.002225661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005552684,"about_ca_topic_score_gemma":0.01035614,"domain_scores_codex":[0.9997144,0.00009587322,0.00001235431,0.00005504029,0.00007819691,0.00004407697],"domain_scores_gemma":[0.9990421,0.000670701,0.00006459816,0.00005905876,0.0001050798,0.00005851367],"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.0001910983,0.0001766712,0.0006068564,0.0001078554,0.00006021123,0.00005301429,0.0001146091,0.8325682,0.001453827,0.02514015,0.003463128,0.1360645],"study_design_scores_gemma":[0.00005193525,0.00003733709,0.00009581358,0.000008687449,0.00001427453,0.00001207129,0.00001369605,0.9911059,0.0001949535,0.007599426,0.0008599685,0.00000590624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01991082,0.0002037644,0.9719652,0.0001772564,0.00007169774,0.0001068299,0.0001071939,0.0005658384,0.006891394],"genre_scores_gemma":[0.222819,0.0001875125,0.7681898,0.0001462568,0.00006973858,0.0005504098,0.0003740126,0.0002555906,0.007407778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006468443,"threshold_uncertainty_score":0.02163911,"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."}}