{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008519209,0.0002881688,0.0002941362,0.0001439948,0.0001999473,0.000199377,0.0001695961,0.0001735108,0.000003367821],"category_scores_gemma":[0.0001512106,0.0002257889,0.00003436883,0.0002343666,0.0001171658,0.0002899121,0.000116201,0.0002542782,0.000001591965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001183657,"about_ca_system_score_gemma":0.00006738848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007209572,"about_ca_topic_score_gemma":0.0003078966,"domain_scores_codex":[0.9986894,0.0000728746,0.0002752629,0.0003161844,0.0001923354,0.0004540011],"domain_scores_gemma":[0.9987206,0.0004409614,0.00008084192,0.0003502867,0.0001267593,0.000280494],"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.000447315,0.0001185051,0.066833,0.0003577357,0.0004404128,0.00002155083,0.003400048,0.6891474,0.006800551,0.001556642,0.004484914,0.226392],"study_design_scores_gemma":[0.001342465,0.0001433434,0.004631742,0.00004140214,0.00005732057,0.0001039265,0.0001020438,0.9884651,0.002239335,0.0004180213,0.002133351,0.0003219031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08179253,0.0030129,0.9121479,0.0008035498,0.00004011273,0.001320749,0.00004411746,0.0006808113,0.0001573619],"genre_scores_gemma":[0.3611757,0.000360402,0.6372537,0.0003463236,0.00009373817,0.0003449966,0.0000125454,0.0001120268,0.0003005546],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2993178,"threshold_uncertainty_score":0.9207406,"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."}}