{"id":"W1848719272","doi":"10.1016/j.ejor.2015.10.046","title":"Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pickup; FIFO and LIFO accounting; Benchmark (surveying); Computer science; Stack (abstract data type); Vehicle routing problem; Mathematical optimization; Travelling salesman problem; Position (finance); Shortest path problem; Path (computing); Algorithm; Routing (electronic design automation); Mathematics; Economics; FIFO (computing and electronics); Theoretical computer science; Artificial intelligence; Operating system","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.004263479,0.002562243,0.004041099,0.002103135,0.001413501,0.002462428,0.003645467,0.00398895,0.008838704],"category_scores_gemma":[0.008075433,0.002490805,0.001958333,0.003465644,0.001434845,0.004285883,0.00235853,0.004789095,0.0009227062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003024922,"about_ca_system_score_gemma":0.003752325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01322281,"about_ca_topic_score_gemma":0.01138145,"domain_scores_codex":[0.9988286,0.0004792031,0.00005761292,0.0001573258,0.0002517927,0.0002253897],"domain_scores_gemma":[0.9940974,0.004927887,0.0002546498,0.0001454262,0.0002776851,0.0002969482],"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.0002772918,0.0002273775,0.000344434,0.0001784497,0.00008371559,0.00004677983,0.00005790558,0.9133927,0.0003599267,0.02011049,0.003019731,0.06190134],"study_design_scores_gemma":[0.00004019931,0.00003837755,0.00005048123,0.0000101707,0.00001677872,0.000007514228,0.000009953815,0.9890442,0.0001159569,0.01028772,0.0003726627,0.00000592408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01812007,0.00151916,0.9752085,0.0005531031,0.0001244556,0.0001670901,0.0001692357,0.0004197162,0.003718641],"genre_scores_gemma":[0.2228156,0.001899175,0.763523,0.0002236909,0.0002414843,0.0006056787,0.0005681912,0.0004610309,0.009662084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01322281,"threshold_uncertainty_score":0.02956843,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08679891004603106,"score_gpt":0.3286413364171116,"score_spread":0.2418424263710805,"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."}}