{"id":"W2325482186","doi":"10.1016/j.cor.2016.04.012","title":"A joint replenishment problem considering multiple trucks with shipment and resource constraints","year":2016,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Truck; Constraint (computer-aided design); Computer science; Genetic algorithm; Mathematical optimization; Joint (building); Budget constraint; Mathematics; Automotive engineering; Engineering","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001153308,0.0001782104,0.0001837466,0.0004458595,0.0006381971,0.0007700229,0.0002214995,0.00004066293,0.0002657361],"category_scores_gemma":[0.0001078337,0.0001204621,0.00003401102,0.000275332,0.00048648,0.0006192793,0.00057198,0.0001635558,0.0001197464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000121181,"about_ca_system_score_gemma":0.00005426764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001961933,"about_ca_topic_score_gemma":0.0002965777,"domain_scores_codex":[0.9980564,0.00006710283,0.0003034394,0.0005284805,0.0005544855,0.0004901393],"domain_scores_gemma":[0.999131,0.0001311594,0.00003750718,0.0003917498,0.0002575141,0.00005112515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005080128,0.001194662,0.05032782,0.001177064,0.0006979189,0.0005308229,0.003836928,0.006652975,0.01381534,0.2116393,0.1687944,0.5408248],"study_design_scores_gemma":[0.009101436,0.0003855342,0.01164966,0.001788865,0.00006046902,0.00005093897,0.005393241,0.08623308,0.00228159,0.001877823,0.8798723,0.001305091],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8173127,0.0002988083,0.07943766,0.04751296,0.0004431364,0.005468551,0.00001492713,0.0005879729,0.04892326],"genre_scores_gemma":[0.9913887,0.0000206595,0.005989356,0.0009933169,0.0003075481,0.000205214,0.0000146091,0.00002889388,0.001051691],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7110779,"threshold_uncertainty_score":0.7425348,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07686294499006517,"score_gpt":0.2760990296910471,"score_spread":0.1992360847009819,"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."}}