{"id":"W2163715979","doi":"10.1007/978-0-387-77778-8_8","title":"Parallel Solution Methods for Vehicle Routing Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Operations research, computer science. Interface series","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Vehicle routing problem; Heuristic; Pace; Computer science; Metaheuristic; Mathematical optimization; Routing (electronic design automation); Field (mathematics); Combinatorial optimization; Algorithm; Mathematics; Geography; Computer network","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.0007823626,0.001298445,0.001002583,0.0006939602,0.0005465952,0.0009903159,0.001386222,0.0009808326,0.008478667],"category_scores_gemma":[0.002391931,0.0005725534,0.0009131721,0.001390032,0.0007183032,0.001172092,0.001321024,0.001949606,0.002940669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000684873,"about_ca_system_score_gemma":0.0009660734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003087936,"about_ca_topic_score_gemma":0.00314128,"domain_scores_codex":[0.99944,0.0001681054,0.00002637188,0.00006499796,0.0002623445,0.00003814629],"domain_scores_gemma":[0.9994741,0.0002423651,0.00003315717,0.00008194411,0.0001493946,0.00001909426],"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.00007862585,0.0001054171,0.0002341899,0.0004383999,0.00008315306,0.00008136142,0.0001050621,0.4268484,0.002155598,0.2200186,0.03067646,0.3191749],"study_design_scores_gemma":[0.00004139666,0.00002074138,0.00008436861,0.00004052001,0.00001671605,0.00005185263,0.00002133142,0.7839109,0.0007832094,0.1857877,0.02923208,0.000009235716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001578098,0.002329558,0.9783876,0.0003322658,0.0003418254,0.00004293648,0.00007069239,0.0003022721,0.01661483],"genre_scores_gemma":[0.113347,0.008019703,0.822478,0.0003547918,0.0008695091,0.0007399386,0.0005163245,0.0008155373,0.05285913],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008478667,"threshold_uncertainty_score":0.028364,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09522652726484755,"score_gpt":0.3867614583324927,"score_spread":0.2915349310676452,"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."}}