{"id":"W4393236743","doi":"10.1016/j.cor.2024.106632","title":"Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"Ministerio de Ciencia e Innovación; European Regional Development Fund; Ministerio de Ciencia, Innovación y Universidades","keywords":"Travelling salesman problem; Computer science; Service (business); Traveling purchaser problem; Operations research; Mathematical optimization; Bottleneck traveling salesman problem; Mathematics; Algorithm; Business; Marketing","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.001746935,0.0007267485,0.000911633,0.0006173683,0.0006309755,0.001281057,0.001997869,0.001229521,0.004680765],"category_scores_gemma":[0.005965427,0.000775996,0.001123524,0.001162009,0.0009691659,0.002183399,0.0007952948,0.001504179,0.0003184328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002339733,"about_ca_system_score_gemma":0.002024221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01104868,"about_ca_topic_score_gemma":0.008700763,"domain_scores_codex":[0.9992614,0.0002333531,0.00003140179,0.0001283144,0.0001443575,0.0002010816],"domain_scores_gemma":[0.996361,0.002691416,0.0004956706,0.00009738343,0.0001621779,0.0001924276],"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.0001082182,0.00007484324,0.001482934,0.00007645226,0.00003143288,0.0002837243,0.00008423298,0.9453948,0.0008230138,0.04471367,0.001006752,0.005919803],"study_design_scores_gemma":[0.00001185507,0.00003321928,0.0006931219,0.000008218617,0.00001538447,0.00006543045,0.00004811554,0.9845113,0.0003501225,0.01371453,0.0005388272,0.000009949896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5285387,0.0008214042,0.4483061,0.001791357,0.00007826364,0.0001974853,0.0007228715,0.000192893,0.01935094],"genre_scores_gemma":[0.9598981,0.0005437222,0.03366408,0.0001226785,0.00006359306,0.0001343661,0.0003115947,0.00009457915,0.00516726],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01104868,"threshold_uncertainty_score":0.02196872,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07149047988899913,"score_gpt":0.347697424587011,"score_spread":0.2762069446980118,"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."}}