{"id":"W2056059863","doi":"10.1016/j.endm.2012.10.032","title":"MPI Parallelization of Variable Neighborhood Search","year":2012,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Benchmark (surveying); Generality; Parallel computing; Asynchronous communication; Variable neighborhood search; Scheduling (production processes); Variable (mathematics); Automatic parallelization; Multiprocessing; Heuristic; Metaheuristic; Algorithm; Mathematical optimization; Programming language; Mathematics; Artificial intelligence","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.0004555108,0.0008236168,0.000940179,0.0007844177,0.001339749,0.00121294,0.002561403,0.0006155109,0.02095325],"category_scores_gemma":[0.003220927,0.0003514036,0.0006109853,0.00169768,0.0005294636,0.001017078,0.001119961,0.001183511,0.003203589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009392264,"about_ca_system_score_gemma":0.001414714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01026379,"about_ca_topic_score_gemma":0.01360597,"domain_scores_codex":[0.9993024,0.0001707482,0.00002760092,0.0001077806,0.000254764,0.0001366399],"domain_scores_gemma":[0.9989803,0.0003316923,0.0000342135,0.0003128986,0.000277221,0.00006364781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001483891,0.0003696134,0.002907782,0.000466577,0.0002038707,0.0003892597,0.0006155652,0.3609246,0.01352084,0.09705687,0.08565379,0.4364073],"study_design_scores_gemma":[0.0001629809,0.00004240382,0.0005062044,0.000009796226,0.00002568726,0.00003537196,0.00006746328,0.9603944,0.00724005,0.02155649,0.009940544,0.00001873654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.122358,0.0006765496,0.7415413,0.001128414,0.0006973037,0.0002110903,0.001587047,0.03718383,0.09461644],"genre_scores_gemma":[0.6348416,0.0002050089,0.3395172,0.0002064206,0.0001212369,0.0004894835,0.001960976,0.003497179,0.01916086],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02095325,"threshold_uncertainty_score":0.07009566,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01610591746015497,"score_gpt":0.2769799389609048,"score_spread":0.2608740215007498,"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."}}