{"id":"W2982586778","doi":"10.1016/j.cor.2020.105085","title":"A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints","year":2020,"lang":"en","type":"preprint","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Vehicle routing problem; Constraint programming; Mathematical optimization; Linear programming; Computer science; Constraint (computer-aided design); Synchronization (alternating current); Constraint satisfaction; Goal programming; Routing (electronic design automation); Mathematics; Stochastic programming; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001318428,0.0009512429,0.001269825,0.0007051484,0.0005288424,0.001543434,0.002864973,0.00211184,0.005314151],"category_scores_gemma":[0.003864224,0.0007968901,0.00114914,0.001565026,0.0009275908,0.002362855,0.001801682,0.0028094,0.0006588154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00110974,"about_ca_system_score_gemma":0.001783908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009232475,"about_ca_topic_score_gemma":0.00834161,"domain_scores_codex":[0.9991381,0.0003583859,0.00003242213,0.0001550467,0.0002639361,0.00005207291],"domain_scores_gemma":[0.998984,0.0006248423,0.00009282339,0.00006184827,0.0001847486,0.00005172843],"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.00002665927,0.00004461166,0.0001015605,0.00005736851,0.00002412722,0.00005706996,0.00002625835,0.927412,0.0008593676,0.05913608,0.001886223,0.01036878],"study_design_scores_gemma":[0.00000350328,0.000005937344,0.000008225579,0.000001971157,0.000001572922,0.000003742405,0.000001748708,0.9970107,0.00004402296,0.00262155,0.0002946288,0.000002333539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001652263,0.0001019927,0.9960211,0.0001779094,0.00004363261,0.00003086777,0.00004240992,0.00003341207,0.001896419],"genre_scores_gemma":[0.2264968,0.0007655672,0.7570873,0.0004222103,0.0002653885,0.000862345,0.0004341766,0.0002677542,0.01339842],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009232475,"threshold_uncertainty_score":0.01835746,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07258725483866049,"score_gpt":0.3449305154285057,"score_spread":0.2723432605898451,"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."}}