{"id":"W4394910141","doi":"10.1016/j.ejor.2024.04.011","title":"A hybrid genetic search and dynamic programming-based split algorithm for the multi-trip time-dependent vehicle routing problem","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; National University's Basic Research Foundation of China; Ministry of Education - Singapore","keywords":"Vehicle routing problem; Solver; Computer science; Algorithm; Monotone polygon; Queue; Mathematical optimization; Genetic algorithm; Computation; Routing (electronic design automation); Dynamic programming; Mathematics","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.0007161972,0.000763213,0.00119187,0.0009277393,0.0004742095,0.0007583112,0.001571995,0.001327913,0.003058432],"category_scores_gemma":[0.001125953,0.0004927985,0.000742936,0.0009164914,0.0005602217,0.0008657846,0.001209035,0.0008729916,0.0003744672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007427357,"about_ca_system_score_gemma":0.001447367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005137276,"about_ca_topic_score_gemma":0.004270809,"domain_scores_codex":[0.9997084,0.00008241683,0.0000106003,0.0000526431,0.00009602553,0.00004986583],"domain_scores_gemma":[0.9996603,0.0001680426,0.00002923124,0.00002404049,0.00008184643,0.00003658821],"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.0001236701,0.0001395588,0.0005196476,0.00004410282,0.00005346416,0.00004439026,0.0000451685,0.9038722,0.002500371,0.006625545,0.001054709,0.08497715],"study_design_scores_gemma":[0.00002067974,0.00003657507,0.00006415735,0.000003254235,0.000006749668,0.000009387604,0.000006271111,0.9984801,0.0001918635,0.0009353927,0.0002430546,0.000002443022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04776686,0.0003121974,0.9464052,0.0001778691,0.00007555162,0.0001063936,0.00006082281,0.0003725639,0.00472254],"genre_scores_gemma":[0.5175266,0.0002306568,0.4765815,0.0002063743,0.00005224896,0.0004114203,0.0002739965,0.0001317067,0.00458562],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005137276,"threshold_uncertainty_score":0.01023149,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04608592239922939,"score_gpt":0.3465077906686401,"score_spread":0.3004218682694107,"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."}}