{"id":"W2622363162","doi":"","title":"Solving the maximally diverse grouping problem by skewed general variable neighborhood search","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Disjoint sets; Variable neighborhood search; Partition (number theory); Mathematics; Heuristic; Variable (mathematics); Set (abstract data type); Local search (optimization); Mathematical optimization; Computer science; Metaheuristic; Combinatorics","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.001153041,0.000227443,0.0002088037,0.00008701654,0.0003393248,0.000185995,0.0003799966,0.0001790617,0.00005156064],"category_scores_gemma":[0.0001329904,0.0001987923,0.00005952451,0.0004542306,0.000105516,0.0002530867,0.00009441801,0.0005321419,0.00003046797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003016159,"about_ca_system_score_gemma":0.00006067901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000126665,"about_ca_topic_score_gemma":0.00000347431,"domain_scores_codex":[0.9983577,0.0002259787,0.0002767285,0.0002623512,0.0003457129,0.0005315689],"domain_scores_gemma":[0.9991733,0.000142159,0.00004543428,0.0003314596,0.0001188996,0.0001887355],"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.00002995245,0.00005577296,0.003981587,0.0001177894,0.0002180015,0.00002555996,0.01012943,0.8715085,0.01305583,0.06772505,0.01815518,0.01499731],"study_design_scores_gemma":[0.001118209,0.0000495033,0.0003161912,0.00003751613,0.00004809388,0.00003507212,0.0009661216,0.9834276,0.001366453,0.00336899,0.008747912,0.0005183317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07946615,0.0004716558,0.9005148,0.0004419081,0.0004794912,0.0003521857,0.00001613982,0.0007093012,0.01754833],"genre_scores_gemma":[0.3461444,0.0001123427,0.6514556,0.0003863128,0.0004436796,0.00004162499,0.00004463536,0.0001346379,0.00123674],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2666783,"threshold_uncertainty_score":0.8106517,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01683419893696322,"score_gpt":0.2255101421717027,"score_spread":0.2086759432347395,"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."}}