{"id":"W1993924585","doi":"10.1002/net.20448","title":"Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Pickup; Travelling salesman problem; Benchmark (surveying); Stack (abstract data type); Constraint (computer-aided design); Computer science; Mathematical optimization; Vehicle routing problem; Algorithm; Mathematics; Routing (electronic design automation); Artificial intelligence; Computer network","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.001197147,0.0006498137,0.001560052,0.0007917639,0.0006128735,0.0007414413,0.00102861,0.001003353,0.002384834],"category_scores_gemma":[0.003022522,0.0005580473,0.0006177265,0.0008468554,0.0004590928,0.001236473,0.0006758554,0.0006658076,0.0002367652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009148699,"about_ca_system_score_gemma":0.0007251591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005856001,"about_ca_topic_score_gemma":0.004771795,"domain_scores_codex":[0.9995,0.0002880497,0.00001694498,0.00007375854,0.00007370095,0.00004749474],"domain_scores_gemma":[0.9984981,0.001244712,0.0001037347,0.00002701801,0.00006304171,0.00006340305],"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.00008419151,0.00007951753,0.0003522677,0.00005428906,0.00003773981,0.00006328141,0.00002586349,0.9792987,0.0002559487,0.006528934,0.0009214941,0.01229784],"study_design_scores_gemma":[0.00001500072,0.00003022153,0.00005800456,0.000003512333,0.000005287354,0.00000912629,0.00001026636,0.9972845,0.00006514908,0.002310686,0.0002058139,0.000002483819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2945811,0.003084448,0.6913794,0.0009199819,0.0001273917,0.000186113,0.0002626685,0.0003082326,0.009150792],"genre_scores_gemma":[0.7703307,0.0007751132,0.2220067,0.0001037851,0.00008999353,0.0002570684,0.0003510995,0.00007736663,0.006008155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005856001,"threshold_uncertainty_score":0.01164383,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01459087504712119,"score_gpt":0.2115262765057453,"score_spread":0.1969354014586241,"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."}}