{"id":"W2890582430","doi":"10.1016/j.ifacol.2018.08.478","title":"A Fix-and-Optimize Variable Neighborhood Search for the Biomedical Sample Transportation Problem","year":2018,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; HEC Montréal; Université du Québec à Montréal; Transport Canada","funders":"","keywords":"Computer science; Vehicle routing problem; Variable neighborhood search; Sample (material); Decomposition; Cluster analysis; Medical diagnosis; Variable (mathematics); Linear programming; Closing (real estate); Mathematical optimization; Duration (music); Quality (philosophy); Routing (electronic design automation); Operations research; Metaheuristic; Mathematics; Machine learning; Artificial intelligence; Algorithm; Medicine","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.001952766,0.001431226,0.001515978,0.0009163848,0.0006090797,0.000904577,0.001528448,0.001657779,0.003526847],"category_scores_gemma":[0.005831752,0.0007128637,0.001182275,0.0009957863,0.0009048782,0.00121786,0.001284812,0.00188496,0.0003444157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001161097,"about_ca_system_score_gemma":0.001966458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01023364,"about_ca_topic_score_gemma":0.007994516,"domain_scores_codex":[0.9992644,0.0003915103,0.00002885135,0.0001523541,0.00008664347,0.00007624087],"domain_scores_gemma":[0.9978185,0.001721316,0.0001412026,0.00005817991,0.0001676661,0.0000931109],"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.00004417481,0.00005245148,0.0003870225,0.00006436124,0.00003185314,0.00004241716,0.00002674778,0.9799696,0.0002729773,0.006001698,0.001147547,0.0119593],"study_design_scores_gemma":[0.00001030753,0.00001949444,0.00004828603,0.000006014444,0.000004648497,0.000006274212,0.00001166754,0.9974461,0.00006098276,0.002087093,0.0002967159,0.000002535944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01906417,0.0006396642,0.9761203,0.0004720382,0.00008121018,0.0001236046,0.0001242925,0.0001708784,0.003203838],"genre_scores_gemma":[0.254395,0.0006029902,0.7384579,0.0003175575,0.0001269866,0.0006528932,0.0005871605,0.0001955812,0.004663973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01023364,"threshold_uncertainty_score":0.02034813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01934175269911011,"score_gpt":0.2759947513919118,"score_spread":0.2566529986928017,"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."}}