{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001563661,0.0001581612,0.0001525413,0.00006601912,0.0001873759,0.00005568318,0.0001857824,0.00009120648,0.00001495328],"category_scores_gemma":[0.00003248078,0.0001537509,0.00001331263,0.0003542897,0.00007977394,0.0001341299,0.0001128735,0.0002419963,5.129175e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009579828,"about_ca_system_score_gemma":0.00001427799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001389259,"about_ca_topic_score_gemma":9.333442e-7,"domain_scores_codex":[0.9991949,0.00005234334,0.0001724264,0.0002280899,0.0001290555,0.0002231945],"domain_scores_gemma":[0.9995885,0.00002792501,0.00005168092,0.0002686633,0.00003677496,0.00002641068],"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.000009269592,0.00002662024,0.0002520699,0.00001123911,0.0000189615,0.000002495956,0.00003694318,0.9172038,0.0009958034,0.00009681777,0.0003171386,0.08102879],"study_design_scores_gemma":[0.000429169,0.00044193,0.0002592876,0.000003983743,0.00001719146,0.00001445373,0.0004963308,0.9951862,0.002543876,0.000210816,0.0001834538,0.0002133521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04972441,0.0003430346,0.9429206,0.0001102203,0.000044383,0.0002717662,0.0001342601,0.00641917,0.00003214459],"genre_scores_gemma":[0.77256,0.00008625233,0.2268616,0.000008400391,0.000004979398,0.0001559178,0.0002739032,0.00003452022,0.00001440239],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7228356,"threshold_uncertainty_score":0.626978,"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."}}