{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006389811,0.0001748257,0.000195516,0.0000668226,0.0002156811,0.00005344006,0.0001776503,0.0001344514,0.0002504619],"category_scores_gemma":[0.0001297088,0.0001351158,0.00005523781,0.0003635683,0.0001307032,0.0001079676,0.00001249581,0.000181672,0.000008649648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003706889,"about_ca_system_score_gemma":0.00004915966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006378984,"about_ca_topic_score_gemma":0.00002221292,"domain_scores_codex":[0.9988366,0.00004300128,0.0002890969,0.0002471429,0.0002154722,0.0003686968],"domain_scores_gemma":[0.9987311,0.0007795403,0.00003236708,0.000218149,0.0001221402,0.0001167375],"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.0004498206,0.0004310532,0.003602835,0.001169977,0.00101157,0.000006960011,0.015291,0.6540123,0.04016351,0.01604217,0.0006937201,0.2671251],"study_design_scores_gemma":[0.001011394,0.0001343792,0.0005434639,0.00003353665,0.00006854929,0.000004161575,0.0002004488,0.9921846,0.0009135117,0.0002471729,0.004462999,0.0001958053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004804423,0.0001681848,0.9920439,0.001273417,0.0002316303,0.0005328049,0.0002820927,0.0003206593,0.0003429335],"genre_scores_gemma":[0.02579228,0.0000669164,0.97302,0.0001806681,0.0004764176,0.00007483775,0.0002060637,0.00005858478,0.0001242577],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3381723,"threshold_uncertainty_score":0.5509864,"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."}}