{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001095314,0.0002502252,0.0003887608,0.0004236974,0.0001294682,0.0002282007,0.0004142984,0.00007431307,0.00001112186],"category_scores_gemma":[0.00005077288,0.0002271102,0.0000969843,0.0005407851,0.00003417534,0.000236308,0.0000651213,0.000197359,7.112515e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004250344,"about_ca_system_score_gemma":0.0002234455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001066132,"about_ca_topic_score_gemma":0.000009049117,"domain_scores_codex":[0.9983069,0.00009452947,0.0007423456,0.0002450447,0.0002885993,0.0003226328],"domain_scores_gemma":[0.9989502,0.0001303707,0.00030636,0.0002223026,0.0003274814,0.00006323648],"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.00006343827,0.0001071003,0.0002769038,0.0005543643,0.0003133207,0.00003539989,0.000216606,0.9635268,0.0001072767,0.00006438744,0.0001551073,0.03457924],"study_design_scores_gemma":[0.005705013,0.0001535239,0.0002125333,0.0007326591,0.0002208854,0.00001950053,0.0002423009,0.9904588,0.0009521522,0.00003059303,0.001027543,0.0002444813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008373346,0.0001643917,0.9958792,0.0000763502,0.0002233759,0.001973797,0.00001427963,0.00009584166,0.00073543],"genre_scores_gemma":[0.02843234,0.00007330708,0.9709472,0.00008584175,0.00005556654,0.0001043098,0.00001035099,0.00005783069,0.0002332272],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03433475,"threshold_uncertainty_score":0.9261286,"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."}}