{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002308557,0.0004545612,0.0004594417,0.0002963817,0.001051286,0.001191639,0.0006101289,0.0003065499,0.00001308902],"category_scores_gemma":[0.0002077579,0.000388071,0.0001018101,0.000873304,0.0004544047,0.0001780934,0.00057716,0.001831657,0.00000364568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003422988,"about_ca_system_score_gemma":0.002135081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006560592,"about_ca_topic_score_gemma":0.0000789089,"domain_scores_codex":[0.9963573,0.0004407616,0.0005804494,0.0008783283,0.0007631629,0.000979968],"domain_scores_gemma":[0.996999,0.0008499948,0.00005751875,0.0005522636,0.001177504,0.0003637135],"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.00003841088,0.0000495038,0.00009381459,0.0003341086,0.0001772128,0.000004835682,0.002321047,0.8532131,0.00006323365,0.00357456,0.00007599916,0.1400541],"study_design_scores_gemma":[0.001414092,0.0002638468,0.00002008492,0.0005147494,0.0000628499,0.000008422395,0.0007090569,0.9961991,0.0002088933,0.00007438497,0.0001173788,0.0004071728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008494432,0.000244629,0.989983,0.001818427,0.00008886844,0.006294689,0.0001025656,0.0005409712,0.00007736016],"genre_scores_gemma":[0.4619639,0.00001486234,0.5369961,0.00003750737,0.0001596557,0.0005755762,0.0001435684,0.00009329099,0.00001553241],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4611145,"threshold_uncertainty_score":0.9998571,"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."}}