{"id":"W2054669984","doi":"10.1057/palgrave.jors.2601420","title":"Some applications of the clustered travelling salesman problem","year":2002,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":88,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Computer science; Vehicle routing problem; Purchasing; Operations research; Scheduling (production processes); Traveling purchaser problem; Lin–Kernighan heuristic; Routing (electronic design automation); Mathematical optimization; Bottleneck traveling salesman problem; Engineering; Operations management; Algorithm; Computer network; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001392025,0.0009808798,0.0009428747,0.001137077,0.00125387,0.001179151,0.002603496,0.002189478,0.009470618],"category_scores_gemma":[0.004935294,0.0006009887,0.001902372,0.003769116,0.0009929532,0.00162754,0.001357091,0.002078758,0.000805294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001707515,"about_ca_system_score_gemma":0.001099385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00682809,"about_ca_topic_score_gemma":0.006093501,"domain_scores_codex":[0.9989042,0.0004246531,0.00005168047,0.0002172035,0.0002711649,0.0001310967],"domain_scores_gemma":[0.9982443,0.00111258,0.0001456438,0.0001088151,0.000292747,0.00009592972],"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.0001172116,0.0001926349,0.000543079,0.0002310901,0.0001322865,0.0003465969,0.0002258217,0.5747966,0.0009009304,0.3587146,0.01186507,0.05193409],"study_design_scores_gemma":[0.00004226606,0.00007072598,0.0003201634,0.0000280328,0.00002529101,0.0001591012,0.000118385,0.7795323,0.0004177203,0.2061057,0.01315062,0.00002980623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04179447,0.002295739,0.9155936,0.001091627,0.0003042478,0.0001305553,0.0002880538,0.0002014777,0.03830026],"genre_scores_gemma":[0.4529505,0.004462334,0.5032436,0.0007295659,0.0007909241,0.0003717579,0.001008623,0.0004057618,0.03603689],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009470618,"threshold_uncertainty_score":0.03168237,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07207568656996226,"score_gpt":0.3404258200623843,"score_spread":0.268350133492422,"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."}}