{"id":"W4386773800","doi":"10.5267/j.ijiec.2023.7.002","title":"An improved genetic algorithm for multi-AGV dispatching problem with unloading setup time in a matrix manufacturing workshop","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; Liaocheng University; National Natural Science Foundation of China","keywords":"Crossover; Mathematical optimization; Genetic algorithm; Process (computing); Computer science; Heuristic; Matrix (chemical analysis); Integer programming; Algorithm; Engineering; Mathematics; Artificial intelligence","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.0002059089,0.0001859517,0.0002150311,0.0006641786,0.00004647253,0.0001209037,0.0002725484,0.0001020862,0.000004184152],"category_scores_gemma":[0.00007288575,0.000185173,0.00006195469,0.0002207395,0.0000124973,0.0003327646,0.00002271808,0.0003636699,0.000002867832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00021495,"about_ca_system_score_gemma":0.0000455454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008183179,"about_ca_topic_score_gemma":0.000003959384,"domain_scores_codex":[0.9988731,0.00001423326,0.0005056208,0.0001441448,0.0002158134,0.0002471411],"domain_scores_gemma":[0.9993174,0.0002219262,0.0001412119,0.00008050091,0.0001440451,0.00009493739],"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.00001976255,0.00002620017,0.00002987253,0.00001176052,0.0000876901,0.00002898605,0.0002147526,0.9716385,0.0003873459,0.0000139133,0.00002943202,0.02751178],"study_design_scores_gemma":[0.001768429,0.00006906546,0.0003166684,0.0001945984,0.00002172628,0.0000463277,0.000064844,0.9960952,0.001003935,0.00009584899,0.0001221303,0.0002011786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05889039,0.00002077454,0.9397821,0.0000599575,0.0007548743,0.000234177,0.00003964447,0.0002141893,0.000003856821],"genre_scores_gemma":[0.5237623,0.00001397601,0.4755298,0.000004625934,0.0005074238,0.00002215047,0.00007733166,0.00005841448,0.00002390427],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4648719,"threshold_uncertainty_score":0.7551137,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02112768677214432,"score_gpt":0.2790975892681749,"score_spread":0.2579699024960305,"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."}}