{"id":"W3171468365","doi":"10.5267/j.ijiec.2021.4.002","title":"Solution of capacitated vehicle routing problem with invasive weed and hybrid algorithms","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Algorithm; Vehicle routing problem; Metaheuristic; Mathematical optimization; Set (abstract data type); Genetic algorithm; Computer science; Routing (electronic design automation); Hybrid algorithm (constraint satisfaction); Weed; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002970005,0.0001247962,0.0002214791,0.0002527119,0.00003176878,0.00006255783,0.0001349047,0.00006198555,0.000007971506],"category_scores_gemma":[0.0004061051,0.000128889,0.00005272912,0.0002884116,0.0000298549,0.0002534691,0.00003159891,0.0003152516,5.369075e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001136543,"about_ca_system_score_gemma":0.0001596362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001218818,"about_ca_topic_score_gemma":0.000001908741,"domain_scores_codex":[0.9988934,0.00004620984,0.0005039343,0.00009562783,0.000330224,0.0001306086],"domain_scores_gemma":[0.9983883,0.0003195246,0.00021858,0.00006138304,0.0009345448,0.00007770539],"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.00001357633,0.00002204336,0.000390471,0.00001312983,0.0002727443,0.00004794633,0.0002416243,0.9750863,0.01720464,0.0002005457,0.00006692734,0.006440051],"study_design_scores_gemma":[0.001824358,0.00008017035,0.0006886742,0.0004838313,0.00005372804,0.0005367894,0.000140504,0.9610263,0.03478892,0.00007046838,0.000140275,0.00016597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3666318,0.00009681451,0.6320146,0.0003161691,0.0006988458,0.00008670615,0.00002086289,0.00006214391,0.00007207174],"genre_scores_gemma":[0.8476562,0.00001660897,0.1520283,0.000008104341,0.000240437,0.000002650888,0.00001551506,0.00002489571,0.000007242988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4810245,"threshold_uncertainty_score":0.5255941,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02588579521446102,"score_gpt":0.2501091145931175,"score_spread":0.2242233193786565,"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."}}