{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003145489,0.000180289,0.0001859918,0.0001387273,0.0006159695,0.0003053269,0.0001916071,0.00007731019,0.0000054603],"category_scores_gemma":[0.00005898685,0.0001191314,0.00004435887,0.0003015609,0.00003170311,0.0002531056,0.00003941976,0.0006296749,0.000002148698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001104068,"about_ca_system_score_gemma":0.00005689162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003777122,"about_ca_topic_score_gemma":0.000001426306,"domain_scores_codex":[0.9986171,0.00001963669,0.0004697736,0.0001198765,0.000261228,0.0005124528],"domain_scores_gemma":[0.9983653,0.001084668,0.0001148737,0.0001213655,0.0001730581,0.0001407122],"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.00004082872,0.000006168942,0.002158817,0.0000552814,0.0000740258,0.000005285873,0.0009151085,0.8868762,0.000240013,0.0015756,0.00002074709,0.1080319],"study_design_scores_gemma":[0.0009107132,0.0001595014,0.001463305,0.000318881,0.00002675556,0.0003587965,0.0005191457,0.9940493,0.001179408,0.000164543,0.0006352821,0.0002143443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1178458,0.0001359413,0.8790553,0.00004899726,0.0001944385,0.0002257935,9.444656e-7,0.0001192041,0.002373588],"genre_scores_gemma":[0.6617444,0.00002390639,0.3377279,0.000120733,0.0003277687,0.000001049286,9.52772e-7,0.00003735954,0.00001594525],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5438986,"threshold_uncertainty_score":0.4858038,"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."}}