{"id":"W2154025454","doi":"10.1016/j.cor.2011.12.016","title":"The Canadian minimum duration truck driver scheduling problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Truck; Duration (music); Integer programming; Schedule; Operations research; Scheduling (production processes); Computer science; Dynamic programming; Service (business); Transport engineering; Linear programming; Operations management; Automotive engineering; Business; Engineering; Marketing; Algorithm; Operating system","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001024379,0.000960719,0.0008401129,0.001238945,0.003267699,0.002718203,0.002745399,0.001600176,0.01280194],"category_scores_gemma":[0.003018619,0.0005907157,0.0006614005,0.002441877,0.001123152,0.001216967,0.000885934,0.001485407,0.0005234128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.02760034,"about_ca_system_score_gemma":0.03949015,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.9203824,"about_ca_topic_score_gemma":0.9320883,"domain_scores_codex":[0.9992102,0.0001277751,0.00001688845,0.0001478273,0.0002204397,0.0002767031],"domain_scores_gemma":[0.9993079,0.0002098024,0.00003857152,0.00003290813,0.0002269882,0.0001838494],"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.0007235736,0.0002135161,0.00313123,0.0003224668,0.000069635,0.0003278861,0.0003801564,0.5900533,0.001454728,0.2249611,0.09956662,0.07879595],"study_design_scores_gemma":[0.0002604171,0.00009445734,0.005631427,0.00008339211,0.00007757862,0.00014996,0.001024221,0.8030855,0.001099596,0.0849858,0.1033819,0.0001257043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2994614,0.005378003,0.2464288,0.01897346,0.001339346,0.0007260076,0.01403733,0.0007158591,0.4129397],"genre_scores_gemma":[0.8492143,0.002398432,0.0647278,0.000566368,0.000216625,0.0001941066,0.003753233,0.0002266189,0.07870255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.07961762,"threshold_uncertainty_score":0.2002555,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05594305595633055,"score_gpt":0.3457641357038667,"score_spread":0.2898210797475362,"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."}}