{"id":"W2587219052","doi":"10.1111/itor.12378","title":"Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem","year":2017,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematical optimization; Metaheuristic; Multi-objective optimization; Context (archaeology); Variable neighborhood search; Path (computing); Computer science; Node (physics); Pareto principle; Mathematics","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002692979,0.0001247235,0.0001257032,0.0002289553,0.001431726,0.0006288578,0.0009789356,0.0000945841,0.0001523279],"category_scores_gemma":[0.001183598,0.0001128018,0.00007282812,0.0001470899,0.0002524722,0.0005549738,0.000043476,0.0005996769,0.00001417982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004605945,"about_ca_system_score_gemma":0.0001040262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001300212,"about_ca_topic_score_gemma":0.0004040422,"domain_scores_codex":[0.9983721,0.0001978358,0.0003582405,0.0002161136,0.0005925239,0.000263198],"domain_scores_gemma":[0.9968836,0.001545345,0.0000499817,0.0005285398,0.0009457122,0.00004676942],"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.00003445914,0.0001434843,0.0003469176,0.0000208602,0.00008796431,8.713505e-7,0.0007809929,0.9727941,0.001970946,0.005819519,0.000261379,0.01773848],"study_design_scores_gemma":[0.0005174532,0.00002097485,0.002625755,0.00005206219,0.000007546315,0.000004848409,0.0001732237,0.9871706,0.002538656,0.002488683,0.004278426,0.0001217676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003936738,0.00008233214,0.9808087,0.004526913,0.0005429864,0.0008218631,0.0001773154,0.00008194894,0.009021145],"genre_scores_gemma":[0.7736868,0.0001106312,0.2250642,0.00002436316,0.0001143961,0.0004381093,0.00005551418,0.00002882431,0.0004771482],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7697501,"threshold_uncertainty_score":0.9998683,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1391586918877306,"score_gpt":0.4219845777396247,"score_spread":0.2828258858518941,"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."}}