{"id":"W4405402617","doi":"10.1002/net.22250","title":"The workforce scheduling and routing problem with park‐and‐loop","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"HEC Montréal; Institut de Valorisation des Données","keywords":"Vehicle routing problem; Loop (graph theory); Workforce; Scheduling (production processes); Mathematical optimization; Operations research; Computer science; Job shop scheduling; Routing (electronic design automation); Mathematics; Economics; Computer network; Combinatorics; Economic growth","routes":{"ca_aff":true,"ca_fund":true,"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.0005123989,0.0001109089,0.00008792355,0.00002030887,0.0001779882,0.0002977615,0.00005607384,0.00006744548,0.000002157818],"category_scores_gemma":[0.00001821641,0.00007583771,0.00001254328,0.0002322075,0.00004285991,0.00008449634,0.00003353302,0.000299457,0.000001291153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001702301,"about_ca_system_score_gemma":0.000007824912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001675195,"about_ca_topic_score_gemma":0.000003952757,"domain_scores_codex":[0.9993657,0.00003525752,0.0001319573,0.0001503747,0.00007356733,0.0002431545],"domain_scores_gemma":[0.9994892,0.0003220424,0.00001370867,0.0001082263,0.00001530049,0.0000515548],"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.000002514841,5.090601e-7,0.0008967274,0.00002319529,0.00002188789,0.000002551768,0.0001457547,0.8566838,0.000008185025,0.00198302,0.00005171473,0.1401802],"study_design_scores_gemma":[0.0000767302,0.000009510293,0.000164658,0.0002476304,0.00001728488,0.00001888963,0.00006272513,0.9972842,0.00001308627,0.00009863703,0.001900548,0.0001061122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03389039,0.01307008,0.9481543,0.0002089373,0.0002379576,0.0001655738,2.942677e-7,0.0007127986,0.003559699],"genre_scores_gemma":[0.8957331,0.0009083773,0.1027727,0.00002877928,0.0002359174,0.0000167017,0.000001367128,0.00005407437,0.0002490005],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8618428,"threshold_uncertainty_score":0.3092572,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01000077137588815,"score_gpt":0.2354369356713332,"score_spread":0.2254361642954451,"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."}}