{"id":"W2954633348","doi":"10.1016/j.ejor.2019.06.032","title":"A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"ca_institutions":"École de Technologie Supérieure; Transport Canada","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Université de Montréal; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Pickup; Benchmark (surveying); Vehicle routing problem; Computer science; Column generation; Branch and cut; Operations research; Service (business); Routing (electronic design automation); Mathematical optimization; Algorithm; Integer programming; Business; Mathematics; Computer network; Marketing","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.001968909,0.001878637,0.004296509,0.001826828,0.001410751,0.002269437,0.003797424,0.004285072,0.01508254],"category_scores_gemma":[0.00352044,0.001791623,0.00177645,0.002894651,0.0009181424,0.003062472,0.002346269,0.003266515,0.001803332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002059825,"about_ca_system_score_gemma":0.004871452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01577755,"about_ca_topic_score_gemma":0.01415706,"domain_scores_codex":[0.9988807,0.0002868389,0.00006086546,0.0002394321,0.0002562331,0.0002759402],"domain_scores_gemma":[0.9978458,0.00142258,0.0001124504,0.0001067384,0.0002294685,0.0002830813],"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.0006444168,0.0008903334,0.0006847522,0.0002799967,0.0001189271,0.0001778778,0.000111252,0.7534457,0.002359386,0.01017662,0.01292524,0.2181856],"study_design_scores_gemma":[0.000173077,0.0001103743,0.0001220997,0.000008704797,0.00002072677,0.00002656324,0.00002450385,0.9945939,0.0002873986,0.003864652,0.0007566601,0.00001127964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02932003,0.0006520794,0.9595754,0.0007602217,0.0002341954,0.0005034846,0.0004052986,0.001620708,0.00692864],"genre_scores_gemma":[0.1475643,0.0003691224,0.8421627,0.0002744034,0.0001613291,0.0006224861,0.001101655,0.0003619677,0.007382102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01577755,"threshold_uncertainty_score":0.05045611,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05003301532035377,"score_gpt":0.2597200634692248,"score_spread":0.209687048148871,"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."}}