{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001401598,0.0001020328,0.0001011025,0.0002269207,0.0002542195,0.0006575556,0.00016572,0.00005895003,0.000005602385],"category_scores_gemma":[0.00005685398,0.00008652448,0.00001204758,0.0008786722,0.00005749582,0.0002212619,0.00008483104,0.0004601402,0.00001680732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007864873,"about_ca_system_score_gemma":0.00004908525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004821915,"about_ca_topic_score_gemma":0.0001990815,"domain_scores_codex":[0.9987679,0.0003589589,0.0001663827,0.0002370399,0.0002200094,0.0002497576],"domain_scores_gemma":[0.9992039,0.0004794317,0.000002979598,0.0001321985,0.0001326038,0.00004889165],"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.000002811637,0.00002650051,0.0001395632,0.0001488698,0.00003148673,0.00001714953,0.01784619,0.9436957,0.01297467,0.0005685204,0.0001948479,0.02435371],"study_design_scores_gemma":[0.0001472639,0.00002886711,0.001127265,0.00009830446,0.000004096788,0.00003695059,0.0003855423,0.9973922,0.0005029876,0.00005523688,0.0001273194,0.00009395729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3920681,0.001278247,0.603115,0.001840243,0.00008603877,0.0007462346,0.000007262247,0.0002732487,0.0005856325],"genre_scores_gemma":[0.7510397,0.00005992627,0.2486216,0.00005520198,0.0000648272,0.00003892155,0.000009678348,0.00002813631,0.00008196021],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3589716,"threshold_uncertainty_score":0.6340824,"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."}}