{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006885387,0.0001514473,0.000236557,0.00009861797,0.0001345722,0.0001053036,0.00020572,0.00005475991,0.00008809378],"category_scores_gemma":[0.0002228011,0.0001051615,0.00005630541,0.0003226629,0.00005218148,0.00008972627,0.00001830937,0.0003532529,0.00001715231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001071227,"about_ca_system_score_gemma":0.00005099099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001568838,"about_ca_topic_score_gemma":5.570242e-7,"domain_scores_codex":[0.9988167,0.00007051881,0.0004775232,0.00008516777,0.0002937492,0.0002563719],"domain_scores_gemma":[0.9990652,0.0002217616,0.0001647933,0.0001604708,0.0002530677,0.0001347708],"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.000008523463,0.00001952596,0.0007235043,0.00001553376,0.00004027759,0.00003486081,0.0003184587,0.9930303,0.003686102,0.0000487629,0.0005937984,0.001480317],"study_design_scores_gemma":[0.0004937506,0.0001100938,0.00009621133,0.0001410873,0.00006053914,0.0001500235,0.00009209427,0.9955916,0.002456726,0.00001056581,0.000642714,0.0001545393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1536065,0.0001038376,0.8443575,0.0003705089,0.0001731634,0.0001955833,0.000006926968,0.00007387778,0.00111205],"genre_scores_gemma":[0.5533728,0.000003134825,0.4462563,0.0001614147,0.0001459172,7.379143e-7,2.535009e-7,0.00003925694,0.00002020152],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3997662,"threshold_uncertainty_score":0.4288361,"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."}}