{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005060589,0.00008507576,0.0001148824,0.0001035225,0.000199068,0.0002256069,0.00012332,0.00001656629,0.00001120006],"category_scores_gemma":[0.0004771974,0.00005512369,0.00001425274,0.0001214048,0.0001161927,0.0002546771,0.00006286024,0.00030236,0.000004551415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003364956,"about_ca_system_score_gemma":0.00009650479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002301379,"about_ca_topic_score_gemma":0.000001253549,"domain_scores_codex":[0.9986717,0.0003951192,0.0002322307,0.0001048212,0.0004216095,0.0001745845],"domain_scores_gemma":[0.9982038,0.0007712194,0.00003780011,0.00007840151,0.0007424372,0.0001664119],"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.0005453875,0.00005352969,0.004911725,0.0001047279,0.0002924227,0.00006406249,0.004165442,0.8995574,0.005752583,0.0003775054,0.008710803,0.07546442],"study_design_scores_gemma":[0.003114837,0.000682537,0.007449724,0.0000917513,0.00001958226,0.0003539593,0.0002827639,0.9742057,0.0005488985,0.00008676143,0.01300111,0.0001623817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4769251,0.004272673,0.510889,0.002719614,0.0001198707,0.001025492,0.00003121392,0.00004839282,0.003968616],"genre_scores_gemma":[0.7382421,0.0003578822,0.2602406,0.00006319056,0.0003742385,0.000004961522,0.000004138045,0.00006029055,0.0006525994],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.261317,"threshold_uncertainty_score":0.2247879,"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."}}