{"id":"W2965762698","doi":"10.1016/j.ins.2019.08.017","title":"Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"ca_institutions":"Royal Military College of Canada","funders":"Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja; National Natural Science Foundation of China","keywords":"Variable neighborhood search; Heuristics; Mathematical optimization; Benchmark (surveying); Variable (mathematics); Replicate; Computer science; Heuristic; Local search (optimization); Profit (economics); Mathematics; Metaheuristic; Operations research; Statistics; Economics","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.0009257843,0.0007172942,0.001063968,0.0008594807,0.0004381343,0.0008501463,0.001851554,0.001407764,0.00311747],"category_scores_gemma":[0.00258288,0.0004771208,0.0007362465,0.0008171129,0.0006035935,0.001363933,0.001021078,0.0009821375,0.0003396261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006957587,"about_ca_system_score_gemma":0.001130153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004775064,"about_ca_topic_score_gemma":0.003935811,"domain_scores_codex":[0.9995998,0.0001637758,0.00001269545,0.00007592372,0.000105629,0.00004224361],"domain_scores_gemma":[0.9993192,0.0004851098,0.00005589752,0.00003104275,0.00008198425,0.00002685776],"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.0000338937,0.00006870571,0.0002876133,0.00007289626,0.0000345093,0.00005352945,0.00004315843,0.9092252,0.0006451086,0.05010947,0.001705138,0.03772084],"study_design_scores_gemma":[0.000006158605,0.00001411863,0.00002765283,0.000004372622,0.000004663385,0.00001163539,0.000007996663,0.9925165,0.0000853482,0.006866068,0.000453146,0.000002420149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01147011,0.0003409474,0.9822059,0.0002117622,0.00005255458,0.00004580593,0.0000319733,0.00007026031,0.005570672],"genre_scores_gemma":[0.3716773,0.0006847223,0.6155659,0.0001699431,0.0001557523,0.0003056479,0.0001560864,0.0001432845,0.01114126],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004775064,"threshold_uncertainty_score":0.01042897,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01893149197560405,"score_gpt":0.2396039903047542,"score_spread":0.2206724983291501,"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."}}