{"id":"W3195263183","doi":"10.1109/access.2021.3104794","title":"A Novel Genetic Algorithm-Based Methodology for Large-Scale Fixed Charge Plus Routing Network Design Problem With Efficient Operators","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Integer programming; Routing (electronic design automation); Genetic algorithm; Mathematical optimization; Network topology; Algorithm; Set (abstract data type); Network planning and design; Linear programming; Scale (ratio); Integer (computer science); Topology (electrical circuits); Mathematics; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.000777129,0.000867515,0.000602792,0.0007019292,0.0004429676,0.0006516144,0.001203611,0.001088709,0.002256714],"category_scores_gemma":[0.001113562,0.0003321797,0.0007594643,0.0007192526,0.0006115163,0.0006314423,0.0006569849,0.0009179548,0.0002768824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007728232,"about_ca_system_score_gemma":0.001564019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003197057,"about_ca_topic_score_gemma":0.002968912,"domain_scores_codex":[0.999684,0.0001028822,0.000009636202,0.00005276642,0.0001171629,0.0000336173],"domain_scores_gemma":[0.9997323,0.0001483062,0.00003019685,0.00002327538,0.00005154746,0.00001433006],"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.00001522423,0.00003891066,0.0001930849,0.00004444249,0.00002170783,0.00005184604,0.00002818704,0.9400936,0.002087265,0.01993342,0.0007996782,0.0366926],"study_design_scores_gemma":[0.000009756372,0.00002240684,0.00002995329,0.000005093751,0.000005705089,0.00002285036,0.000006350579,0.9943362,0.000336534,0.004175032,0.001047215,0.000002831513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00480367,0.00008717817,0.9923121,0.00007942985,0.00002362405,0.00005964627,0.00001730437,0.0001152919,0.002501736],"genre_scores_gemma":[0.1720139,0.0001896529,0.8246358,0.000117176,0.00002594267,0.0003452669,0.00009065656,0.00007108776,0.002510452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003197057,"threshold_uncertainty_score":0.007549465,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05129549908148345,"score_gpt":0.2939355013430463,"score_spread":0.2426400022615628,"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."}}