Optimal Design of Decision Problem in The Production Process
DOI:
https://doi.org/10.54097/9s85vc91Keywords:
Sampling detection, Bayesian estimation, Dynamic programming, Simulated annealing, Genetic algorithmAbstract
Based on the production decision problem of the "Higher Education Society Cup" national College students Mathematical Contest in Modeling, this paper presents an optimization scheme to solve the sampling detection and production decision of two kinds of spare parts in the production process of enterprises. By establishing the production decision model and cost optimization model, the binomial distribution model is used to test the hypothesis, and the relationship between the minimum sampling quantity and the real defective rate is determined, which improves the detection efficiency and reduces the cost. A production decision model with binary code is constructed, which considers many cost factors, optimizes the model by decision tree and dynamic programming, and obtains the optimal strategy and net profit expectation. The whole calculation strategy of multi-process and multi-parts is proposed. The model is further optimized by simulated annealing and genetic algorithm, and the maximum profit of a single finished product is obtained. By integrating all models, a cost optimization model based on sampling inspection defective rate is proposed, which takes the posterior distribution of defective rate as the key basis to provide a more accurate decision analysis and optimization path for enterprises.
Downloads
References
[1] Yu Shanqi. Sampling Inspection and Quality Control [M]. Beijing: Peking University Press, 1991.
[2] Zhang Dongdong. Research on Decision tree optimization Algorithm based on Genetic Algorithm [D]. Lanzhou: Lanzhou Jiaotong University, 2024.
[3] Wang Xiaohua. Application of dynamic programming in resource allocation [J]. Journal of Jingchu University of Technology, 2007, 22(6): 84-86. (in Chinese) DOI:10.3969/j.issn.1008-4657.2007.06.025.
[4] Bellman R. Dynamic programming [J]. Science, 1966, 153(3731): 34-37.
[5] Eddy S R. What is dynamic programming? [J]. Nature Biotechnology, 2004, 22(7): 909-910.
[6] Bellman R. The theory of dynamic programming [J]. Bulletin of the American Mathematical Society, 1954, 60(6): 503-515.
[7] Blackwell D. Discrete dynamic programming [J]. The Annals of Mathematical Statistics, 1962: 719-726.
[8] Shaughnessy J M. Research in probability and statistics [J]. Handbook of Research on Mathematics Teaching and Learning: A Project of the National Council of Teachers of Mathematics, 2006: 465.
[9] Reichenbach H. The theory of probability [M]. Berkeley: University of California Press, 1971.
Downloads
Published
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.







