{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007419076,0.0001119022,0.0001469456,0.0001348404,0.0002189676,0.00005788317,0.0005796286,0.00003129991,0.0000202093],"category_scores_gemma":[0.0001338749,0.00008340614,0.00008715234,0.0004147715,0.00002003648,0.0001516253,0.00007863122,0.0004668256,2.33567e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000244672,"about_ca_system_score_gemma":0.0002022726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003074139,"about_ca_topic_score_gemma":9.659735e-7,"domain_scores_codex":[0.9987698,0.00006132781,0.000463481,0.00007916987,0.000480712,0.0001455213],"domain_scores_gemma":[0.9985187,0.0004723749,0.000292057,0.0001081879,0.00057486,0.00003382943],"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.00000980814,0.00002002848,0.0001149887,0.000006090238,0.0002061151,0.000001366797,0.0002350351,0.985419,0.0009841823,0.0005093845,0.0001712252,0.01232272],"study_design_scores_gemma":[0.0009911904,0.00005940572,0.0001231926,0.00007949444,0.00005845738,0.0001407283,0.0001063187,0.9962193,0.0006532605,0.0001268225,0.001350975,0.00009083157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0181411,0.0000999144,0.9781106,0.001216552,0.002002853,0.0002665522,0.00007918597,0.00004874375,0.00003453634],"genre_scores_gemma":[0.7460268,0.000004546444,0.2532689,0.00005553015,0.0005418455,0.00003735227,0.00001213889,0.00003973418,0.00001320833],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7278856,"threshold_uncertainty_score":0.3401203,"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."}}