Optimization of Multi-Stage Production Decision-Making Based on Dynamic Block-Accelerated Enumeration Algorithm

Authors

  • Junhong Li
  • Zhuohang Ma
  • Wenchao Su

DOI:

https://doi.org/10.54097/dxz38x84

Keywords:

Dynamic Blocking Accelerated Enumeration Algorithm, Analytic Hierarchy Process, Bayesian sampling, Multi-objective optimization.

Abstract

This paper introduces a Dynamic Blocking Accelerated Enumeration Algorithm (D-BES) for high-dimensional production decision-making, employing recursive space partitioning and sensitivity-based pruning to reduce a 20-dimensional search space from 2²⁰ to 2⁵ sub-blocks, achieving a 71.3% computational speedup over exhaustive methods. By integrating Analytic Hierarchy Process (AHP) and Bayesian sampling, D-BES ensures precise defect rate estimation (errors ≤0.03%) and adaptive weight adjustment (±30%), while its multi-objective optimization model lowers the resource-defect conflict coefficient from 0.82 to 0.47. Benchmark tests demonstrate D-BES’s superiority over Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) in convergence and efficiency, achieving 98.3% defect detection accuracy, an optimized defect rate of 0.8%, and a computation time of 0.5 seconds on the MIT PCB dataset. Under ±20% weight fluctuations and 10dB Gaussian noise, D-BES maintains resource consumption stability (σ=0.23) with only a 0.1% increase in defect rates, showcasing its robustness and real-time capabilities for Industry 4.0 smart production systems.

Downloads

Download data is not yet available.

References

[1] Blanuša J, Atasu K, Ienne P. Fast parallel algorithms for enumeration of simple, temporal, and hop-constrained cycles [J]. ACM Transactions on Parallel Computing, 2023, 10 (3): 1-35.

[2] Albrecht M R, Bai S, Li J, et al. Lattice reduction with approximate enumeration oracles: practical algorithms and concrete performance [C] // Annual International Cryptology Conference. Cham: Springer International Publishing, 2021: 732-759.

[3] Pant S, Kumar A, Ram M, et al. Consistency indices in analytic hierarchy process: a review [J]. Mathematics, 2022, 10 (8): 1206.

[4] Tavana M, Soltanifar M, Santos-Arteaga F J. Analytical hierarchy process: Revolution and evolution [J]. Annals of operations research, 2023, 326 (2): 879-907.

[5] Leal J E. AHP-express: A simplified version of the analytical hierarchy process method [J]. MethodsX, 2020, 7: 100748.

[6] Ghosh M. Bayesian methods for finite population sampling [M]. Routledge, 2021.

[7] Lye A, Cicirello A, Patelli E. Sampling methods for solving Bayesian model updating problems: A tutorial [J]. Mechanical Systems and Signal Processing, 2021, 159: 107760.

[8] Van de Schoot R, Depaoli S, King R, et al. Bayesian statistics and modelling [J]. Nature Reviews Methods Primers, 2021, 1 (1): 1.

[9] Gagné C, Sioud A, Gravel M, et al. Multi-objective optimization [J]. Heuristics for Optimization and Learning, 2020, 906: 183.

[10] Wang, F., Guo, L., & Zhao, W. A Comprehensive Study on Micro-Defect Detection in PCB Using Convolutional Neural Networks [J]. Sensors, 2021, 21 (8): 2896.

[11] Chen, J., Liu, Z., & Wu, T. A Dynamic Block Strategy for Micro-Defect Localization in PCB Inspection Based on CNN [J]. Journal of Electronic Testing, 2023, 39 (3): 312-325.

Downloads

Published

28-09-2025

How to Cite

Li, J., Ma, Z., & Su, W. (2025). Optimization of Multi-Stage Production Decision-Making Based on Dynamic Block-Accelerated Enumeration Algorithm. Highlights in Science, Engineering and Technology, 155, 68-79. https://doi.org/10.54097/dxz38x84