{"id":"W1979700544","doi":"10.1023/b:anor.0000032576.73681.29","title":"Solving VRPTWs with Constraint Programming Based Column Generation","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Column generation; Constraint programming; Theory of computation; Mathematical optimization; Computer science; Scheduling (production processes); Concurrent constraint logic programming; Constraint logic programming; Constraint satisfaction; Constraint (computer-aided design); Directed graph; Directed acyclic graph; Mathematics; Stochastic programming; Algorithm; Artificial intelligence","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.001561726,0.0001002971,0.0001370393,0.0002790676,0.0002974042,0.0001765568,0.0001419748,0.00006926497,0.00007120646],"category_scores_gemma":[0.0003063041,0.00009834172,0.00003210812,0.000752272,0.0001659862,0.0002341493,0.00002056145,0.0002571791,0.00001204319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005207212,"about_ca_system_score_gemma":0.0002894362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000109012,"about_ca_topic_score_gemma":0.000268199,"domain_scores_codex":[0.9985859,0.0001554774,0.0002774254,0.0001770341,0.0004545984,0.0003495979],"domain_scores_gemma":[0.9985893,0.00008448736,0.00001357812,0.0002611583,0.000956889,0.00009463444],"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.000004267457,0.00004753126,0.0001030932,0.00003279759,0.0000201442,0.000003226264,0.000279761,0.9723473,0.01806441,0.001892106,0.0001241046,0.00708131],"study_design_scores_gemma":[0.0004311729,0.0001675187,0.0001712873,0.00007829342,0.000003741139,0.000004969437,0.0001957926,0.8699803,0.1282862,0.00002406838,0.0005169489,0.0001396162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3163082,0.0001322712,0.6797941,0.001316057,0.00004732997,0.0006200702,0.00001107252,0.0001712315,0.001599657],"genre_scores_gemma":[0.7111902,0.00002304367,0.2885327,0.0000337927,0.00005325663,0.00007373083,0.00002825917,0.00002469821,0.000040281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.394882,"threshold_uncertainty_score":0.4010259,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2097232830225987,"score_gpt":0.4249395268656753,"score_spread":0.2152162438430766,"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."}}