{"id":"W3007930322","doi":"10.1007/s11590-020-01551-w","title":"Variable neighborhood search based algorithms to solve a rich k-travelling repairmen problem","year":2020,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Variable neighborhood search; Benchmark (surveying); Computational intelligence; Variable (mathematics); Algorithm; Set (abstract data type); Computer science; Mathematical optimization; Database transaction; Local search (optimization); Mathematics; Metaheuristic; Artificial intelligence; Database","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.001212499,0.0006711668,0.001026484,0.0007448796,0.0005295534,0.0006607478,0.001533416,0.001366834,0.002899569],"category_scores_gemma":[0.003309021,0.0005221616,0.0007565067,0.000887892,0.0007444301,0.001022162,0.001021094,0.001132338,0.0003427044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006885194,"about_ca_system_score_gemma":0.0007973915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005721902,"about_ca_topic_score_gemma":0.006142343,"domain_scores_codex":[0.9996891,0.0001534503,0.00001378421,0.00004846588,0.00006267526,0.00003246437],"domain_scores_gemma":[0.9988753,0.000852941,0.00008048132,0.00004584519,0.0001088838,0.00003649685],"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.00004023739,0.00003462569,0.0001846739,0.00005089715,0.00003049418,0.00002416615,0.00003343661,0.9626682,0.0003199885,0.01764668,0.001074475,0.01789219],"study_design_scores_gemma":[0.000005897879,0.00001142692,0.00002751216,0.0000031457,0.00000334625,0.000004509283,0.000005047861,0.9969108,0.00005096501,0.002712238,0.0002629951,0.000002026768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02321796,0.0004680719,0.9703586,0.000184822,0.00008466748,0.00005165589,0.00004704902,0.0001156263,0.005471592],"genre_scores_gemma":[0.4656701,0.0005239177,0.5194028,0.0001557655,0.000087864,0.0003455276,0.0002195618,0.0001797292,0.01341473],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005721902,"threshold_uncertainty_score":0.01137716,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01777942290356581,"score_gpt":0.2336952618307448,"score_spread":0.215915838927179,"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."}}