{"id":"W4245527820","doi":"10.1002/net.20063","title":"Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Pickup; Probabilistic logic; Computation; Computer science; Mathematical optimization; Traveling purchaser problem; Mathematics; Bottleneck traveling salesman problem; Algorithm; Artificial intelligence","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.0006074476,0.0001250222,0.0001185952,0.00003172392,0.0001662161,0.00006178251,0.0001192704,0.00008724927,0.00001091468],"category_scores_gemma":[0.00001752152,0.0001001448,0.00003729768,0.000154726,0.00004238764,0.00002439815,0.00002638001,0.0002144256,0.000002771001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005204701,"about_ca_system_score_gemma":0.00001359362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002034637,"about_ca_topic_score_gemma":0.000006257997,"domain_scores_codex":[0.9991667,0.0000435017,0.0001972963,0.000171345,0.0001036891,0.0003175207],"domain_scores_gemma":[0.9991509,0.0005441377,0.0000200773,0.0001705264,0.0000531045,0.00006128941],"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.000007649162,0.000009567872,0.0001501025,0.00003619668,0.00001826732,1.954896e-7,0.0002887082,0.927133,0.00002268672,0.0007655149,0.00009111339,0.07147696],"study_design_scores_gemma":[0.0002784376,0.00002276266,0.0003660476,0.00003055975,0.00002726304,0.000004132477,0.00003146975,0.9984654,0.00004769225,0.00004148077,0.0005654216,0.0001193649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03151119,0.001323255,0.9653414,0.0001542552,0.0001251205,0.0006295686,0.000002170843,0.0002018366,0.0007111469],"genre_scores_gemma":[0.9101647,0.0001032341,0.08912108,0.00005108839,0.0004065869,0.00005780402,0.000004065819,0.00004304571,0.00004844797],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8786535,"threshold_uncertainty_score":0.4083788,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01835366463530712,"score_gpt":0.2428194336468257,"score_spread":0.2244657690115186,"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."}}