{"id":"W2121266360","doi":"10.1287/ijoc.1100.0439","title":"A Hybrid Heuristic for an Inventory Routing Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":199,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Stockout; Mathematical optimization; Heuristic; Benchmark (surveying); Computer science; Integer programming; Service level; Inventory control; Operations research; Inventory theory; Routing (electronic design automation); Set (abstract data type); Time horizon; Vehicle routing problem; Tabu search; 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.0009439955,0.0009237322,0.0009478773,0.001147782,0.0005331877,0.001373158,0.00162299,0.001482499,0.004379362],"category_scores_gemma":[0.001662459,0.0006228449,0.0006211874,0.001322034,0.0006709321,0.0009927517,0.00081584,0.0007111286,0.0005448065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001161686,"about_ca_system_score_gemma":0.001286494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003859259,"about_ca_topic_score_gemma":0.004595475,"domain_scores_codex":[0.9994127,0.0002849832,0.00001885123,0.00006886341,0.0001205248,0.00009414271],"domain_scores_gemma":[0.9991753,0.0005914759,0.00006208949,0.00005367134,0.00007063756,0.0000469062],"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.0001008981,0.0001195977,0.0002778524,0.00009433208,0.00004112332,0.00010235,0.00006184674,0.9504784,0.001071046,0.0112992,0.001487832,0.03486556],"study_design_scores_gemma":[0.00004719007,0.00006353238,0.00005013551,0.00001211652,0.00001199823,0.00003236998,0.0000241512,0.9952028,0.0003134052,0.003038374,0.00119668,0.00000716556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07988244,0.0008672458,0.9008961,0.0003631258,0.0001107683,0.0003500613,0.0003145926,0.001250053,0.01596563],"genre_scores_gemma":[0.4793362,0.0004558062,0.5138586,0.0002392833,0.00005284755,0.0006938986,0.0003632022,0.0001507531,0.004849407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004379362,"threshold_uncertainty_score":0.0146504,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05024524965669892,"score_gpt":0.2806375269401999,"score_spread":0.230392277283501,"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."}}