{"id":"W2100711246","doi":"10.1287/ijoc.1060.0202","title":"Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":139,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Pickup; FIFO and LIFO accounting; Variable (mathematics); Mathematical optimization; Variable neighborhood search; Heuristic; 2-opt; Traveling purchaser problem; Heuristics; Computer science; Mathematics; FIFO (computing and electronics); Metaheuristic; 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.0009294031,0.0004027911,0.0007677323,0.0005664334,0.0004498449,0.0005790297,0.000870795,0.0006147842,0.001878139],"category_scores_gemma":[0.002237791,0.000241534,0.0003099171,0.0007162089,0.0004654262,0.0009907556,0.0005118198,0.0005421403,0.0002031756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006796408,"about_ca_system_score_gemma":0.0007222937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00574484,"about_ca_topic_score_gemma":0.006432203,"domain_scores_codex":[0.9996575,0.0001611922,0.00001097297,0.00005028232,0.00006898283,0.00005101428],"domain_scores_gemma":[0.9993783,0.0004470228,0.00006898619,0.00003078177,0.00003931326,0.00003556107],"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.0001846579,0.0001395419,0.0009901189,0.000046771,0.00001999965,0.00006155059,0.00006232527,0.9471568,0.0008603702,0.007620466,0.0009960148,0.04186127],"study_design_scores_gemma":[0.00003030736,0.00006377478,0.000137493,0.000003818645,0.000005924369,0.000013167,0.00002156554,0.9964926,0.0003204836,0.002521647,0.0003853276,0.000003849689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3541658,0.0008524737,0.635896,0.0003452941,0.00004693177,0.0001498599,0.000173071,0.0007728917,0.007597732],"genre_scores_gemma":[0.7590913,0.0001970311,0.2373635,0.00005139825,0.00002041983,0.0001702988,0.0002558497,0.0001008221,0.002749414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00574484,"threshold_uncertainty_score":0.01142281,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01899676715682416,"score_gpt":0.2579686718548559,"score_spread":0.2389719046980317,"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."}}