{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00124475,0.001143605,0.0008568186,0.001649285,0.0004223786,0.0009404791,0.001068356,0.001394814,0.001217635],"category_scores_gemma":[0.001877859,0.0004227595,0.0009271681,0.001349429,0.0005860701,0.0005688895,0.0007215257,0.0009919268,0.000166268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001262823,"about_ca_system_score_gemma":0.001451524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005484723,"about_ca_topic_score_gemma":0.004308471,"domain_scores_codex":[0.9996107,0.0001903431,0.00001926824,0.00004228567,0.00008852934,0.00004883407],"domain_scores_gemma":[0.99924,0.0005273219,0.00009313389,0.00002796888,0.00007897359,0.00003250169],"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.00002039069,0.00003515385,0.000180493,0.00003475109,0.00002765316,0.00001903916,0.00001531836,0.9840507,0.0003268515,0.004556384,0.0002538557,0.01047946],"study_design_scores_gemma":[0.00000816453,0.00002172359,0.00004415211,0.000009343272,0.000006322914,0.00000509553,0.000009329631,0.9978055,0.0001355022,0.001689546,0.0002631099,0.000002048182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05616325,0.001351613,0.9351772,0.0003948098,0.00007826255,0.0001620909,0.00010872,0.0002264507,0.006337559],"genre_scores_gemma":[0.5579872,0.0008769311,0.4369129,0.0001909582,0.00006823873,0.0005361859,0.0002024589,0.00007317393,0.003151987],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005484723,"threshold_uncertainty_score":0.01090562,"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."}}