{"id":"W1493303707","doi":"10.1007/978-3-540-85097-7_22","title":"Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Ant colony optimization algorithms; Traffic grooming; Computer science; Metaheuristic; Wavelength-division multiplexing; Routing (electronic design automation); Node (physics); Computer network; Ant colony; Mathematical optimization; Parallel metaheuristic; Distributed computing; Algorithm; Mathematics; Engineering","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004378485,0.0005977426,0.0007179114,0.0004434372,0.0003719045,0.0006505982,0.0009364059,0.00114741,0.001577941],"category_scores_gemma":[0.001050483,0.0003392968,0.0004161072,0.0008110536,0.0004246822,0.0005172367,0.0004900801,0.0009770483,0.0002482552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005579455,"about_ca_system_score_gemma":0.0007370106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003785841,"about_ca_topic_score_gemma":0.003902593,"domain_scores_codex":[0.9998197,0.00007398858,0.00000570862,0.00001763323,0.00005897608,0.00002403018],"domain_scores_gemma":[0.9996676,0.0002156273,0.00002758764,0.00001817456,0.00005283948,0.00001828746],"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.00003617819,0.0000425825,0.00009359126,0.00004937984,0.00002275055,0.00002523478,0.00002007013,0.9486217,0.001084886,0.008746824,0.001569576,0.03968723],"study_design_scores_gemma":[0.000006203712,0.00001103745,0.00002029565,0.00000423911,0.000002851902,0.000005335622,0.000003925385,0.9976354,0.0001628227,0.001681549,0.0004648536,0.000001455104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04171033,0.003119346,0.9349622,0.0004996179,0.0002440503,0.00008895506,0.00007591024,0.0003862002,0.01891337],"genre_scores_gemma":[0.5095634,0.001755852,0.4714032,0.0002908658,0.0001586366,0.0002884663,0.0001278349,0.0002137237,0.01619792],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003785841,"threshold_uncertainty_score":0.007527649,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01277080991833191,"score_gpt":0.2165327735741748,"score_spread":0.2037619636558429,"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."}}