{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001290387,0.0006830872,0.001131538,0.001150401,0.0005798502,0.0009439749,0.001820939,0.001775311,0.002220592],"category_scores_gemma":[0.003017529,0.0006412605,0.0009847366,0.001013754,0.000580296,0.001176137,0.0009249908,0.0009804869,0.000168445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006418271,"about_ca_system_score_gemma":0.001032969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004211986,"about_ca_topic_score_gemma":0.00391812,"domain_scores_codex":[0.9995546,0.0001267455,0.00002757268,0.00008140125,0.0001398952,0.00006985052],"domain_scores_gemma":[0.9987704,0.0008035756,0.00009314792,0.00006375508,0.0002042781,0.00006482],"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.00003283268,0.00007317607,0.0003734128,0.00003432743,0.00005557839,0.00004940087,0.00003134503,0.9689672,0.0008512468,0.005874678,0.0004032161,0.02325353],"study_design_scores_gemma":[0.00000270421,0.00000898284,0.00003453337,0.000001827559,0.000005637111,0.000007362873,0.000003193344,0.9991525,0.00007306685,0.0006412783,0.00006723349,0.000001615044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05473395,0.0003738403,0.9386876,0.0004380519,0.0001445638,0.00008415175,0.00004230726,0.0001123432,0.005383247],"genre_scores_gemma":[0.761516,0.0002940592,0.2309997,0.0002544133,0.0001177191,0.000298718,0.00009614435,0.00007431585,0.006348835],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004211986,"threshold_uncertainty_score":0.008374929,"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."}}