{"id":"W2312035630","doi":"","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":"PolyPublie (École Polytechnique de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Pickup; FIFO and LIFO accounting; Benchmark (surveying); Stack (abstract data type); Computer science; Vehicle routing problem; Mathematical optimization; Path (computing); Travelling salesman problem; Position (finance); Shortest path problem; Algorithm; Routing (electronic design automation); Mathematics; Economics; FIFO (computing and electronics); Computer network; Theoretical computer science; Artificial intelligence; Operating system","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.002666314,0.002771979,0.002723388,0.001604371,0.001269981,0.002494187,0.00329386,0.002917016,0.008352445],"category_scores_gemma":[0.004971743,0.001648962,0.002166952,0.002578989,0.001154608,0.003554363,0.001596491,0.003617008,0.001314742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003307169,"about_ca_system_score_gemma":0.003651525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01210049,"about_ca_topic_score_gemma":0.01204585,"domain_scores_codex":[0.9986645,0.0005653934,0.00005745346,0.0002116759,0.0002470219,0.000253888],"domain_scores_gemma":[0.9973946,0.002018801,0.0001907512,0.0001118278,0.0001529187,0.0001311579],"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.00007262782,0.0001112056,0.0002447377,0.0001020513,0.00004831766,0.00003689658,0.0000423507,0.9415516,0.0001811856,0.02545964,0.00234053,0.0298089],"study_design_scores_gemma":[0.0000240706,0.0000259107,0.00003717999,0.00001300066,0.00001126334,0.00001008634,0.00001032799,0.9842135,0.000097277,0.01465182,0.0009000828,0.000005407791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008754941,0.0008998202,0.9846089,0.0003454837,0.0000797969,0.0001650043,0.0001711275,0.0004025266,0.004572413],"genre_scores_gemma":[0.1572717,0.001944329,0.8309434,0.0002068637,0.0001599104,0.0008218599,0.0008400377,0.0003783883,0.007433487],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01210049,"threshold_uncertainty_score":0.02794176,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01511027045565724,"score_gpt":0.2269251546750366,"score_spread":0.2118148842193794,"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."}}