{"id":"W1588856286","doi":"10.1023/a:1013661617536","title":"Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows","year":2002,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":162,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Pruning; Mathematical optimization; Computer science; Reduction (mathematics); Descent (aeronautics); Constraint programming; Variable neighborhood search; Constraint (computer-aided design); Mathematics; Metaheuristic; Stochastic programming","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001533683,0.0009574604,0.0008322761,0.0006560083,0.0004975816,0.001010989,0.001306091,0.0008460629,0.002599214],"category_scores_gemma":[0.003912565,0.000467269,0.000764237,0.001522559,0.0005623751,0.001545145,0.0008311594,0.001685779,0.0002644755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005932901,"about_ca_system_score_gemma":0.001808799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008087788,"about_ca_topic_score_gemma":0.005157164,"domain_scores_codex":[0.9994124,0.0002368519,0.00003617926,0.00006348144,0.0001610522,0.00008993993],"domain_scores_gemma":[0.9982457,0.001324027,0.000112288,0.0000676988,0.0001898379,0.00006039118],"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.0002767959,0.0001607629,0.000378031,0.0001654673,0.00007548081,0.0001538558,0.0001102018,0.8262054,0.004387077,0.06856456,0.003113459,0.09640899],"study_design_scores_gemma":[0.00003669258,0.00003891404,0.00003439804,0.000008556674,0.00001296098,0.00001859559,0.00001314624,0.9861423,0.0008278803,0.01193793,0.0009209997,0.000007528243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01638762,0.0001858339,0.980387,0.0001079015,0.00005841119,0.00007679931,0.00005794977,0.0001421991,0.002596254],"genre_scores_gemma":[0.1995234,0.0003580401,0.7976357,0.000110828,0.00005160571,0.0002366054,0.0001558948,0.0001448518,0.001783064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008087788,"threshold_uncertainty_score":0.01608139,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0272116258951607,"score_gpt":0.2542900346914363,"score_spread":0.2270784087962756,"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."}}