{"id":"W2098559645","doi":"10.1142/s0129626403001598","title":"PARALLEL ALGORITHMS FOR VEHICLE ROUTING PROBLEMS","year":2003,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Time complexity; Routing (electronic design automation); Algorithm; Vehicle routing problem; Crew; Parallel algorithm; Routing table; Destination-Sequenced Distance Vector routing; Path (computing); Parallel computing; Computer network; Link-state routing protocol; Routing protocol","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.001892248,0.002085525,0.001686841,0.001106789,0.001506924,0.002473217,0.002304763,0.001497441,0.00890703],"category_scores_gemma":[0.005984606,0.0007774464,0.001344288,0.002514049,0.001221439,0.00315989,0.002213892,0.002557687,0.00250965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002056096,"about_ca_system_score_gemma":0.002143447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004136474,"about_ca_topic_score_gemma":0.004713958,"domain_scores_codex":[0.9980925,0.0005518204,0.0001222154,0.0004058169,0.0004922009,0.0003355125],"domain_scores_gemma":[0.998168,0.001122392,0.0001348691,0.000264876,0.0002313548,0.00007860934],"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.00019792,0.0002233895,0.0005219287,0.0005486643,0.0001236842,0.0001283862,0.0002267662,0.5765955,0.001374409,0.2043236,0.02197283,0.1937629],"study_design_scores_gemma":[0.0001826768,0.00004393993,0.0001048073,0.0000308649,0.00002756393,0.0000657402,0.00007139353,0.7022539,0.0006629582,0.2819721,0.01457087,0.0000132019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008982838,0.001611106,0.9688093,0.0009908733,0.0002088224,0.0002580671,0.0002547613,0.001620259,0.01726383],"genre_scores_gemma":[0.1567888,0.00236959,0.8254983,0.0003428683,0.0004135422,0.000994795,0.00112707,0.000537344,0.01192778],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00890703,"threshold_uncertainty_score":0.02979696,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03144977875051786,"score_gpt":0.2734180421681125,"score_spread":0.2419682634175946,"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."}}