{"id":"W2116691041","doi":"10.1109/hipc.1997.634485","title":"Parallel algorithms for vehicle routing problems","year":2002,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Time complexity; Routing (electronic design automation); Vehicle routing problem; Crew; Algorithm; Routing table; Destination-Sequenced Distance Vector routing; Static routing; Parallel algorithm; Computer network; Link-state routing protocol; Routing protocol; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002521011,0.0001162584,0.000126233,0.00004318588,0.000077502,0.00004407864,0.0001093341,0.00006930072,0.0002596434],"category_scores_gemma":[0.00005947248,0.0001165696,0.00005337245,0.0001595688,0.00001159827,0.0001138407,0.00001588506,0.00008299074,0.0000675212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003482304,"about_ca_system_score_gemma":0.000001947815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003731999,"about_ca_topic_score_gemma":0.000001367827,"domain_scores_codex":[0.9992263,0.00001868492,0.0002186882,0.0001483289,0.00009128377,0.0002966994],"domain_scores_gemma":[0.9996107,0.0001025847,0.00002137864,0.0001611469,0.00004077715,0.00006343471],"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":[7.164044e-7,0.00001577451,0.0002446015,0.00004023689,0.00002083264,6.745584e-7,0.0002997805,0.9520826,0.0008189066,0.001296115,0.002952773,0.04222694],"study_design_scores_gemma":[0.0004294129,0.00001681482,0.000063769,0.00001011542,0.000006446534,0.000003273993,0.00002691378,0.9930954,0.0006856591,0.0001546719,0.00534389,0.0001636381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001954896,0.0002075344,0.9816366,0.0001611806,0.0001852123,0.0002957557,0.000003078029,0.001022365,0.0145334],"genre_scores_gemma":[0.1929499,0.00003012553,0.8029913,0.0000683377,0.0001333643,0.00007218027,0.000004207792,0.00006158437,0.003688999],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.190995,"threshold_uncertainty_score":0.4753571,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0487229125440266,"score_gpt":0.2695773464828055,"score_spread":0.2208544339387789,"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."}}