{"id":"W7114775904","doi":"10.5267/j.jpm.2025.11.003","title":"Route optimization for open-close multiple travelling salesman problem with load-balancing constraint: A multi-chromosome based genetic algorithm","year":2025,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Travelling salesman problem; Crossover; 2-opt; Genetic algorithm; Benchmark (surveying); Bottleneck traveling salesman problem; Combinatorial optimization; Nearest neighbour algorithm; Lin–Kernighan heuristic","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.0005893987,0.000890038,0.0009237618,0.000894026,0.0004544064,0.001072959,0.001452281,0.00141257,0.002979202],"category_scores_gemma":[0.001256844,0.0003748476,0.0008434694,0.0009976038,0.000453341,0.000714627,0.0008048119,0.0009548909,0.0003600854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007979323,"about_ca_system_score_gemma":0.001657506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008211045,"about_ca_topic_score_gemma":0.00589404,"domain_scores_codex":[0.9996793,0.00009520919,0.00001149191,0.00008210018,0.00007183039,0.0000600801],"domain_scores_gemma":[0.9996954,0.0001480808,0.00005105379,0.00001692668,0.00005689501,0.00003168901],"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.00004332861,0.00007035177,0.0007498983,0.00006823299,0.00003941753,0.0001003181,0.00005995674,0.9415194,0.001067873,0.006805165,0.001689064,0.04778709],"study_design_scores_gemma":[0.00001513184,0.00003526248,0.0001210497,0.00001014394,0.00001208297,0.00003161165,0.00002500449,0.9966738,0.000185823,0.002071555,0.0008138264,0.000004765518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05714374,0.0009188153,0.9317484,0.000467794,0.0001052832,0.0001596758,0.0001304136,0.000514361,0.008811559],"genre_scores_gemma":[0.5054086,0.0007862482,0.4851207,0.000253496,0.00006862505,0.0003756479,0.0004771106,0.0001439222,0.007365645],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008211045,"threshold_uncertainty_score":0.01632649,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01920267751821153,"score_gpt":0.2831940797123326,"score_spread":0.263991402194121,"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."}}