{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00426648,0.002435226,0.005354652,0.002329883,0.001914146,0.006041643,0.004481323,0.005844885,0.009771443],"category_scores_gemma":[0.007645385,0.004361844,0.003428113,0.004564261,0.001503185,0.004859912,0.00302401,0.002399012,0.0006673936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002360366,"about_ca_system_score_gemma":0.002980269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01526887,"about_ca_topic_score_gemma":0.009039117,"domain_scores_codex":[0.9977232,0.0007536942,0.0001741542,0.0005125949,0.0003544056,0.0004819699],"domain_scores_gemma":[0.995277,0.003008467,0.0004534253,0.0001982027,0.0004408921,0.0006219099],"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.0003568674,0.000154088,0.0008109091,0.0003214845,0.0001733647,0.000954864,0.00009815959,0.9782785,0.001209543,0.005972005,0.001057992,0.01061217],"study_design_scores_gemma":[0.00008298264,0.0001869875,0.0004703921,0.00002806015,0.0001153218,0.0001737155,0.0001028341,0.992501,0.0003708232,0.005213141,0.0007128064,0.00004195037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3688343,0.003144779,0.5999328,0.001942056,0.0005369954,0.000775582,0.001372421,0.0005949158,0.02286624],"genre_scores_gemma":[0.9095762,0.0007527555,0.07614051,0.0001452185,0.0001777475,0.0002924243,0.0006492891,0.0001550993,0.01211083],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01526887,"threshold_uncertainty_score":0.03268874,"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."}}