{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00109334,0.0003880258,0.001095743,0.0006810572,0.0005132938,0.0006818924,0.00111711,0.0007492975,0.001950088],"category_scores_gemma":[0.00327999,0.0003974252,0.0006106616,0.0008264517,0.0004958341,0.001167877,0.0009618721,0.0007046108,0.0002761221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008138217,"about_ca_system_score_gemma":0.0009909407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004012366,"about_ca_topic_score_gemma":0.002772787,"domain_scores_codex":[0.9994185,0.0002594478,0.00001758662,0.00008234094,0.0001688167,0.00005328081],"domain_scores_gemma":[0.9991727,0.0005937862,0.00008423912,0.00003714769,0.00008100007,0.00003112033],"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.00007334808,0.00004478824,0.0003412433,0.00006354004,0.00002801708,0.00005095104,0.00004745872,0.9071597,0.0007948659,0.05100022,0.001355028,0.03904084],"study_design_scores_gemma":[0.000006905626,0.00001173493,0.00003477714,0.000002371797,0.000002669034,0.00001054078,0.000006483023,0.9898739,0.0001087315,0.009587029,0.0003525606,0.000002293956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02684224,0.0003406491,0.9699116,0.0001606909,0.00001916115,0.00006269677,0.00004912877,0.0001108351,0.002502997],"genre_scores_gemma":[0.5420506,0.0006398527,0.4506961,0.0000664074,0.00006635814,0.0003407112,0.0003102708,0.000116495,0.005713219],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004012366,"threshold_uncertainty_score":0.007978022,"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."}}