{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001690132,0.002122749,0.001772694,0.0010298,0.001647907,0.002563141,0.00248855,0.001536847,0.009040775],"category_scores_gemma":[0.0058804,0.0008116188,0.001419877,0.002547914,0.001231723,0.002948591,0.002140041,0.00270959,0.002608084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002195692,"about_ca_system_score_gemma":0.00213952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004318055,"about_ca_topic_score_gemma":0.004748888,"domain_scores_codex":[0.9979694,0.000580931,0.000127404,0.0004676727,0.0005150294,0.0003394754],"domain_scores_gemma":[0.9981617,0.001085832,0.0001419599,0.0002707923,0.0002604701,0.0000792068],"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.0002001917,0.0002545137,0.0005665539,0.0005416938,0.0001333535,0.000146364,0.0001933243,0.6070321,0.001533085,0.1751965,0.02429716,0.1899052],"study_design_scores_gemma":[0.0001838195,0.00005139358,0.0001282672,0.0000308411,0.00003081829,0.00007747613,0.00007561085,0.7169679,0.000789422,0.264272,0.01737877,0.00001366846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01038961,0.001585133,0.9630087,0.001124078,0.0002768561,0.0003516722,0.0003611344,0.002130671,0.02077215],"genre_scores_gemma":[0.1502761,0.002361826,0.8317357,0.0003943706,0.0003564269,0.001105321,0.001371546,0.0005467949,0.01185197],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009040775,"threshold_uncertainty_score":0.03024441,"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."}}