{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005800577,0.0006846684,0.0005239699,0.0008988685,0.0003046409,0.0005996207,0.0009047528,0.0006506178,0.001247935],"category_scores_gemma":[0.001090133,0.000269229,0.0006184876,0.0009795816,0.000367572,0.0006973639,0.0005587714,0.0004507416,0.0001164562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005551467,"about_ca_system_score_gemma":0.0009097605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00459553,"about_ca_topic_score_gemma":0.003913331,"domain_scores_codex":[0.9997274,0.0000897703,0.00001082099,0.00004697995,0.00007640696,0.00004858756],"domain_scores_gemma":[0.9996291,0.000229876,0.00004746908,0.00002604489,0.00004833936,0.00001910961],"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.00005240885,0.00006549495,0.0006070134,0.00004524703,0.00003030419,0.00004974721,0.00004203125,0.9570883,0.001763308,0.005980155,0.0005399447,0.0337361],"study_design_scores_gemma":[0.000008232824,0.00003278484,0.0001059047,0.000002909348,0.000005394241,0.00001174895,0.00001559988,0.9977689,0.0003603109,0.001432435,0.0002532523,0.000002569769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.242933,0.0004599921,0.7428264,0.0002673564,0.00004642658,0.0001205493,0.000115566,0.0004093473,0.01282126],"genre_scores_gemma":[0.7598627,0.0002018152,0.2364746,0.00006597318,0.0000225188,0.0001868723,0.0001796984,0.00005940772,0.002946367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00459553,"threshold_uncertainty_score":0.009137511,"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."}}