{"id":"W3191258758","doi":"10.5267/j.dsl.2021.5.003","title":"An efficient genetic algorithm for solving open multiple travelling salesman problem with load balancing constraint","year":2021,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Travelling salesman problem; Mathematical optimization; Computer science; Genetic algorithm; Constraint (computer-aided design); Tree traversal; 2-opt; Integer programming; Algorithm; 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.001947985,0.0001871826,0.0002317898,0.0001505957,0.0004075244,0.0007172506,0.0007434284,0.00004628237,0.00001556109],"category_scores_gemma":[0.0002336777,0.000172616,0.00004143193,0.0009338669,0.0002071699,0.0003267064,0.0001067453,0.0001451831,0.000005737085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002335538,"about_ca_system_score_gemma":0.0002148472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007417595,"about_ca_topic_score_gemma":0.000008103002,"domain_scores_codex":[0.9977539,0.00003881871,0.0003778629,0.0006279242,0.0006657226,0.0005357436],"domain_scores_gemma":[0.9985543,0.000439247,0.00007050335,0.000463797,0.0002713959,0.0002006879],"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.000003481729,0.00001366105,0.0002965158,0.000007344589,0.000004211145,0.00001690627,0.0004382352,0.7617692,0.103432,0.00001129236,0.00002177197,0.1339854],"study_design_scores_gemma":[0.0007208026,0.00002933635,0.001364271,0.0001219596,0.000008831455,0.0000588214,0.0002610113,0.9639032,0.03313792,0.00002550148,0.0001107928,0.0002575276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.286814,0.00002029101,0.7123448,0.0000937318,0.0001874042,0.0003618085,0.000006545861,0.0001043556,0.00006708437],"genre_scores_gemma":[0.3243265,0.000002317794,0.6752782,0.0003010131,0.00003455905,0.00002427568,0.000002881946,0.00002732016,0.000002885856],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.202134,"threshold_uncertainty_score":0.7039075,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0199359579697247,"score_gpt":0.2902609772048175,"score_spread":0.2703250192350928,"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."}}