{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002590876,0.0001124611,0.00009474437,0.00001914123,0.0001595553,0.0000546927,0.00007090186,0.00007580817,0.00001920908],"category_scores_gemma":[0.000002994846,0.00007802997,0.00002207838,0.0001011984,0.00002056876,0.0001154996,0.00001881357,0.0001812022,0.000002640102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001439497,"about_ca_system_score_gemma":0.000007290995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004738752,"about_ca_topic_score_gemma":0.00004388416,"domain_scores_codex":[0.999308,0.00001526305,0.0001084183,0.000094877,0.00007892417,0.0003944486],"domain_scores_gemma":[0.9995618,0.0001838506,0.0000153499,0.0001232883,0.00003695404,0.00007879168],"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.00002054259,0.0000177866,0.03918775,0.00005261856,0.00005410043,2.120729e-7,0.001343339,0.9512854,0.000009979227,0.0008193396,0.0006715589,0.006537429],"study_design_scores_gemma":[0.000691598,0.00003021621,0.002771108,0.00003724306,0.00002381696,0.000003847524,0.000179404,0.9890074,0.00003679503,0.000009904175,0.007073642,0.0001349875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01842105,0.002898898,0.9760957,0.00005938453,0.0002168137,0.0005721453,0.00001116437,0.0001872197,0.001537565],"genre_scores_gemma":[0.9947367,0.0003336261,0.004370584,0.00007774628,0.0002856326,0.00004534694,0.00002335165,0.0000432766,0.00008376279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9763156,"threshold_uncertainty_score":0.318197,"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."}}