{"id":"W4284896812","doi":"10.3390/technologies10040081","title":"Distribution Path Optimization by an Improved Genetic Algorithm Combined with a Divide-and-Conquer Strategy","year":2022,"lang":"en","type":"article","venue":"Technologies","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Mathematical optimization; Crossover; Divide and conquer algorithms; Computer science; Path (computing); Genetic algorithm; Metaheuristic; Scheduling (production processes); Operator (biology); Vehicle routing problem; Routing (electronic design automation); Algorithm; Mathematics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"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.0005718194,0.0009874047,0.001038646,0.001161002,0.0004884523,0.0006344682,0.001259338,0.001195742,0.002053042],"category_scores_gemma":[0.001105344,0.0004698905,0.0008096409,0.001110078,0.0006534461,0.0006689752,0.0006120151,0.0008236204,0.0002547809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009854945,"about_ca_system_score_gemma":0.001635365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009367941,"about_ca_topic_score_gemma":0.006885039,"domain_scores_codex":[0.999632,0.00009395634,0.00001413249,0.00007826425,0.0001239059,0.00005762243],"domain_scores_gemma":[0.999727,0.0001314491,0.0000328472,0.00001974667,0.00007375165,0.00001512428],"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.00004687759,0.00007080081,0.0003515937,0.00003818718,0.00003667203,0.00007171503,0.00005130635,0.9150642,0.00363047,0.007083502,0.0009581941,0.07259651],"study_design_scores_gemma":[0.0000189811,0.00002536967,0.00003957236,0.000002475929,0.000008382154,0.00001588657,0.000004892201,0.9981391,0.000413988,0.0007932712,0.0005349799,0.000002954169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02136833,0.0002203232,0.9737602,0.0001708327,0.00005241362,0.00008918476,0.00002482005,0.0005045072,0.003809455],"genre_scores_gemma":[0.2801158,0.0002631179,0.7146277,0.0001358126,0.0000534025,0.0003761345,0.0001112622,0.0001086775,0.004207948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009367941,"threshold_uncertainty_score":0.01862681,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007743080449083273,"score_gpt":0.2171983023533931,"score_spread":0.2094552219043098,"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."}}