{"id":"W2607258061","doi":"10.1007/s12293-017-0231-8","title":"A co-evolutionary approach using information about future requests for dynamic vehicle routing problem with soft time windows","year":2017,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Vehicle routing problem; Heuristic; Routing (electronic design automation); Genetic algorithm; Evolutionary algorithm; Artificial intelligence; Machine learning; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001261262,0.0002948492,0.0003443635,0.0001506257,0.001122538,0.0003765653,0.0003945299,0.0001509812,0.00000792232],"category_scores_gemma":[0.000178768,0.0002971845,0.00008003652,0.0001752281,0.00007301495,0.0007596182,0.00008081906,0.0002853224,0.00001229646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000254089,"about_ca_system_score_gemma":0.00007389876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001268609,"about_ca_topic_score_gemma":9.765882e-7,"domain_scores_codex":[0.9982767,0.00008626353,0.000526936,0.0002767258,0.0002915618,0.0005418448],"domain_scores_gemma":[0.9986641,0.0001442951,0.0003712799,0.0005184084,0.0002049134,0.00009694428],"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.00002415956,0.00001732709,0.00196154,0.0002965253,0.00005767242,0.000001044213,0.001127329,0.9550245,0.001159459,0.00012997,0.00005970149,0.04014074],"study_design_scores_gemma":[0.0009076627,0.00003523532,0.005567836,0.0002108017,0.00004748425,0.0000413119,0.000160596,0.9920062,0.0001587209,0.00004753003,0.0004447691,0.00037185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1093687,0.00007845832,0.8868826,0.0000598926,0.0001932778,0.0008066435,0.00001353077,0.0005731743,0.002023723],"genre_scores_gemma":[0.4993078,0.000001671704,0.5003344,0.00002154396,0.0001970059,0.00001385968,0.00005096379,0.00004798188,0.00002474936],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3899392,"threshold_uncertainty_score":0.999948,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01193631036119443,"score_gpt":0.2627367152526489,"score_spread":0.2508004048914545,"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."}}