{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000396097,0.0009007037,0.0008788678,0.0008470304,0.0005181696,0.0007553663,0.001061399,0.001201942,0.002022986],"category_scores_gemma":[0.0008162954,0.0003742124,0.0007312138,0.001125973,0.0004333515,0.0006380678,0.0006022617,0.0008942266,0.0002824819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006749823,"about_ca_system_score_gemma":0.001762733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009837879,"about_ca_topic_score_gemma":0.006917219,"domain_scores_codex":[0.9997392,0.00007040284,0.00001038014,0.00005331829,0.00007346972,0.00005323588],"domain_scores_gemma":[0.9998462,0.00007507235,0.00002357687,0.000008824439,0.0000354177,0.00001082374],"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.00003581645,0.00005852964,0.0004725854,0.00006319559,0.00003852477,0.00009942517,0.00005672768,0.9257572,0.001877468,0.009820337,0.001530635,0.06018949],"study_design_scores_gemma":[0.00001600158,0.00003229862,0.00008092197,0.000006648736,0.00001034857,0.00002778021,0.00001697949,0.9964193,0.0002588718,0.002207762,0.0009185389,0.000004659821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03022851,0.0006267521,0.9611025,0.000234545,0.00008837933,0.0001134256,0.00006481615,0.0004648518,0.00707625],"genre_scores_gemma":[0.4336779,0.0008605052,0.5578045,0.0002275845,0.00006611809,0.0004061536,0.0003856633,0.0001074928,0.006464079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009837879,"threshold_uncertainty_score":0.01956123,"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."}}