{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019467,0.0001410603,0.0002376514,0.0001142513,0.00002417352,0.00001348441,0.0001666623,0.00009476206,0.0001273775],"category_scores_gemma":[0.0002640376,0.0001423633,0.00003613869,0.0004945876,0.00002604401,0.0001723064,0.00003865318,0.0002212725,0.00001302651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001383672,"about_ca_system_score_gemma":0.00004083605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005353246,"about_ca_topic_score_gemma":0.000001948392,"domain_scores_codex":[0.9986812,0.0000660721,0.0003902516,0.00009397574,0.0001997391,0.0005687544],"domain_scores_gemma":[0.9992812,0.0002943104,0.00005422263,0.0002810406,0.00003635844,0.00005284784],"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.000004840912,0.000122821,0.006897697,0.000523985,0.00005806293,2.538875e-7,0.002382954,0.7920881,0.005257353,0.1906032,0.0000231087,0.002037621],"study_design_scores_gemma":[0.0003106295,0.00003046305,0.0003949987,0.00008369557,0.0000219526,0.0000051176,0.00008181886,0.9692826,0.01706877,0.01244424,0.00006452931,0.0002111902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05807973,0.0006539834,0.9370629,0.00001885497,0.00007233446,0.0001883424,0.000003010793,0.0001282967,0.003792548],"genre_scores_gemma":[0.8018292,0.00008499323,0.1979357,0.000006623739,0.0000445533,0.00001179916,0.000009972886,0.00004390175,0.00003322864],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7437495,"threshold_uncertainty_score":0.5805408,"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."}}