{"id":"W4205600329","doi":"10.5267/j.ijiec.2021.10.001","title":"Hybrid algorithm for the solution of the periodic vehicle routing problem with variable service frequency","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Integer programming; Time horizon; Ant colony optimization algorithms; Computer science; Metaheuristic; Routing (electronic design automation); Scheduling (production processes); Linear programming; Algorithm; Simulated annealing; Variable (mathematics); Set (abstract data type); Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006331955,0.0007984438,0.0007767743,0.0008222085,0.0004509825,0.0006612423,0.001216321,0.0009779973,0.004088239],"category_scores_gemma":[0.001129517,0.0003464119,0.000611418,0.0008772475,0.0003653526,0.0006002454,0.0007570859,0.0007381186,0.000567267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006517426,"about_ca_system_score_gemma":0.00137784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004875341,"about_ca_topic_score_gemma":0.00547974,"domain_scores_codex":[0.9997002,0.00007835234,0.00001470903,0.00006793491,0.0000864032,0.00005253349],"domain_scores_gemma":[0.9996305,0.0002296052,0.00003969219,0.00002298987,0.00005914,0.00001819414],"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.00009045723,0.00007213792,0.0003376144,0.00008291542,0.00003870415,0.00004149103,0.00004421396,0.8899474,0.001202056,0.01219232,0.001725545,0.09422524],"study_design_scores_gemma":[0.00002098025,0.00003001083,0.00004294706,0.000004479016,0.000004859005,0.00001224164,0.000007494619,0.9968651,0.0001732527,0.002039069,0.0007968131,0.000002807069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01192738,0.0002681333,0.9830596,0.00009064378,0.00005633103,0.00008550847,0.00005641328,0.0004804561,0.003975607],"genre_scores_gemma":[0.2204898,0.0002306324,0.7733328,0.00009476388,0.00005390212,0.0005856974,0.0002935174,0.0001174858,0.004801466],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004875341,"threshold_uncertainty_score":0.01367658,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02123064897644581,"score_gpt":0.2451079673216813,"score_spread":0.2238773183452355,"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."}}