{"id":"W2965363856","doi":"10.24963/ijcai.2019/782","title":"On Computational Complexity of Pickup-and-Delivery Problems with Precedence Constraints or Time Windows","year":2019,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Computer science; Vehicle routing problem; Solver; Pickup; Set (abstract data type); Mathematical optimization; Computational complexity theory; Metaheuristic; Theoretical computer science; Routing (electronic design automation); Algorithm; Mathematics; Artificial intelligence","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001653348,0.0001043654,0.0001725298,0.00005190164,0.00002085135,0.00001461889,0.00007141766,0.00004030184,0.00115442],"category_scores_gemma":[0.00002088576,0.00007983545,0.00001466002,0.0001186709,0.0001483197,0.00007999276,0.00001895951,0.0000869069,0.00006568658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002160857,"about_ca_system_score_gemma":0.00003166507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006454299,"about_ca_topic_score_gemma":0.000003128548,"domain_scores_codex":[0.9993624,0.00003839234,0.0001788631,0.0001379204,0.0001647935,0.0001176188],"domain_scores_gemma":[0.9994714,0.0002628598,0.00004103359,0.0001102134,0.00007074124,0.00004380653],"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.00003100417,0.00001817305,0.001913817,0.00008161218,0.00002959858,4.651786e-7,0.0001270839,0.9932482,0.0006872311,0.002672098,0.00006289392,0.001127856],"study_design_scores_gemma":[0.0007003825,0.0001669466,0.005595489,0.0001091018,0.000006995535,0.00001602982,0.00002457197,0.9918839,0.0008507869,0.0004932598,0.00001352564,0.000138978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6842114,0.000009025994,0.291575,0.00004832576,0.00005288161,0.0005204907,0.00002118867,0.0002854032,0.02327633],"genre_scores_gemma":[0.7819001,0.000001581894,0.2176793,0.00003240274,0.000005007631,0.000003214171,0.000007711974,0.00001479367,0.0003559049],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09768874,"threshold_uncertainty_score":0.9997587,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02812422643871574,"score_gpt":0.2472558387060989,"score_spread":0.2191316122673832,"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."}}