{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004233277,0.002854127,0.002072385,0.001970807,0.001469116,0.004826132,0.002661325,0.002212091,0.01387167],"category_scores_gemma":[0.02506388,0.0007883414,0.002440155,0.003184655,0.003275115,0.007518562,0.002813299,0.005977544,0.0008941104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00425386,"about_ca_system_score_gemma":0.004369508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01025277,"about_ca_topic_score_gemma":0.01113502,"domain_scores_codex":[0.995997,0.00172583,0.0001424416,0.0008618101,0.0005822319,0.0006906955],"domain_scores_gemma":[0.9495455,0.04697958,0.001117043,0.001118947,0.0006979968,0.0005409488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005705347,0.0005522482,0.003070629,0.0009696501,0.0002013793,0.0001989567,0.0003153654,0.816372,0.001510332,0.1198834,0.0124707,0.04388484],"study_design_scores_gemma":[0.00009194843,0.00006574618,0.0006579874,0.00006163954,0.00005685361,0.00006699759,0.0001167515,0.8640616,0.0006085812,0.1323132,0.001878485,0.00002038536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.243641,0.01056385,0.6381433,0.01409859,0.00071354,0.0008215677,0.003986459,0.001191142,0.08684056],"genre_scores_gemma":[0.7483603,0.006085013,0.2257812,0.001419799,0.0008399171,0.0009949609,0.003796516,0.0007365671,0.01198579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01387167,"threshold_uncertainty_score":0.04640538,"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."}}