{"id":"W2981178732","doi":"","title":"A general variable neighborhood search for the travelling salesman problem with draft limits","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Travelling salesman problem; Traveling purchaser problem; Variable neighborhood search; Mathematical optimization; Limit (mathematics); Hull; 2-opt; Set (abstract data type); Variable (mathematics); Computer science; Context (archaeology); Bottleneck traveling salesman problem; Mathematics; Metaheuristic; Engineering; Geography","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005449422,0.0003980068,0.0003766577,0.0001443643,0.0004426533,0.0006705462,0.0012166,0.0003117179,0.00008872095],"category_scores_gemma":[0.0002872587,0.0003349247,0.0001355519,0.00042827,0.000136549,0.0001309329,0.0003657977,0.0008633548,0.00001656107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001337598,"about_ca_system_score_gemma":0.0002546535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003297632,"about_ca_topic_score_gemma":0.0001392733,"domain_scores_codex":[0.9960154,0.001954512,0.0005142961,0.000602502,0.0003776916,0.0005355492],"domain_scores_gemma":[0.9937707,0.002365436,0.0001981825,0.001709517,0.001794986,0.0001612306],"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.00001187216,0.0001503499,0.0005989928,0.0006119501,0.0003061848,9.635623e-7,0.007447592,0.8704033,0.002520861,0.08449604,0.0006220929,0.03282975],"study_design_scores_gemma":[0.000476199,5.697974e-7,0.0003791722,0.0008710438,0.00008107129,0.000006841626,0.00006090016,0.9770824,0.01621341,0.001546612,0.002869082,0.0004127175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009211467,0.0006540144,0.9625177,0.002166365,0.0001685667,0.001424394,0.0000484969,0.0005497854,0.02325925],"genre_scores_gemma":[0.1713274,0.0004161441,0.8218828,0.00005057278,0.00007352349,0.0005058339,0.0002819237,0.0001674813,0.00529435],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1621159,"threshold_uncertainty_score":0.9999103,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01985339305981963,"score_gpt":0.2370067501492878,"score_spread":0.2171533570894682,"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."}}