{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007708143,0.0003126267,0.0003022616,0.0001102922,0.0002989438,0.0001932305,0.0002327385,0.0001210928,0.00001909545],"category_scores_gemma":[0.0001758099,0.0003353155,0.0001046136,0.0003483621,0.00005901129,0.0003277342,0.00001792113,0.0002469367,0.00002297225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001051826,"about_ca_system_score_gemma":0.00003611279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003440119,"about_ca_topic_score_gemma":8.978884e-7,"domain_scores_codex":[0.9981092,0.00008687234,0.0004679299,0.0003946633,0.000229549,0.0007118264],"domain_scores_gemma":[0.9993126,0.0001255338,0.0001090973,0.0002482561,0.0000785725,0.0001259297],"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.000006061461,0.00002095097,0.0006908366,0.0002683169,0.00003260863,0.000002274737,0.00063981,0.9780455,0.007702084,0.000326512,0.001086794,0.01117821],"study_design_scores_gemma":[0.001236447,0.00002067919,0.0001922882,0.0001069026,0.00003245608,0.00001499185,0.0000811663,0.9883952,0.001125972,0.0003757801,0.007856454,0.0005616991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01083698,0.0007301245,0.9847465,0.0005711297,0.0002859141,0.0004880954,0.000003378612,0.0009195321,0.001418344],"genre_scores_gemma":[0.2938252,0.00001535784,0.7048976,0.000596938,0.0001359453,0.0001976184,0.00001310854,0.0001324777,0.0001858085],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2829882,"threshold_uncertainty_score":0.9999099,"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."}}