{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002192785,0.0001065984,0.0001016405,0.0001042155,0.000268337,0.0003834797,0.0003464908,0.00004445585,0.00003118519],"category_scores_gemma":[0.00004014091,0.00006670948,0.00001838088,0.001084678,0.00007535088,0.002007192,0.00003941653,0.0001707752,0.00004546436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003847844,"about_ca_system_score_gemma":0.0001028969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001741851,"about_ca_topic_score_gemma":4.446094e-7,"domain_scores_codex":[0.9987943,0.00003111871,0.0002944914,0.0001156715,0.0004822838,0.0002821229],"domain_scores_gemma":[0.9994777,0.0000954775,0.00006998032,0.0001925932,0.0001245677,0.00003967111],"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.00000207201,0.000004926238,0.001228042,0.00007145344,0.000007626294,1.765187e-8,0.003591148,0.9869565,0.0002657671,0.00537911,0.00002784035,0.002465443],"study_design_scores_gemma":[0.0002048719,0.00003395898,0.0004412012,0.00003747248,0.000003800304,0.0000141212,0.002295888,0.9957338,0.0003491463,0.00003560815,0.0007312025,0.0001189088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01923205,0.00001319062,0.8349025,0.00007745767,0.00008627233,0.0004815233,0.000002540517,0.0002895018,0.144915],"genre_scores_gemma":[0.590046,0.000002512805,0.4097274,0.00009413881,0.00002151752,0.00002560754,0.000004885592,0.000007664607,0.0000702816],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5708139,"threshold_uncertainty_score":0.3697903,"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."}}