{"id":"W4232360642","doi":"10.1109/lcomm.2005.1431160","title":"A tabu search heuristic for the routing and wavelength assignment problem in optical networks","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Routing and wavelength assignment; Heuristic; Computer science; Routing (electronic design automation); Guided Local Search; Mathematical optimization; Blocking (statistics); Set (abstract data type); Local search (optimization); Wavelength-division multiplexing; Algorithm; Wavelength; Mathematics; Computer network","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.001751885,0.0009362614,0.001262319,0.001567827,0.001350515,0.001405898,0.001521114,0.001764875,0.003943054],"category_scores_gemma":[0.004482804,0.0006552481,0.0007465087,0.002447435,0.001289474,0.001323673,0.0006300113,0.0009169102,0.0008467678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001401147,"about_ca_system_score_gemma":0.002265545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008421164,"about_ca_topic_score_gemma":0.007850068,"domain_scores_codex":[0.9988586,0.0007342289,0.00003119885,0.0000809039,0.0001762544,0.000118884],"domain_scores_gemma":[0.9985006,0.001110759,0.0001055408,0.0000786572,0.0001611823,0.00004328443],"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.000131943,0.0001239568,0.000545709,0.0001575443,0.00008073332,0.00006363355,0.0001314524,0.8687779,0.0008189652,0.01451331,0.005804036,0.1088507],"study_design_scores_gemma":[0.00008664862,0.0001102822,0.0001650723,0.00004044793,0.0000281386,0.00005224915,0.00006309823,0.9842042,0.0006788288,0.01046337,0.004087314,0.00002030981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0398422,0.002820163,0.9449045,0.0005368022,0.0002117544,0.0003649115,0.0003129477,0.001435642,0.009571122],"genre_scores_gemma":[0.2407796,0.001144205,0.7522801,0.0004634015,0.00009040239,0.0006809781,0.0005624508,0.0002952727,0.003703631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008421164,"threshold_uncertainty_score":0.01674426,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02457716806984574,"score_gpt":0.2628061420187564,"score_spread":0.2382289739489107,"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."}}