关键词: 拉格朗日启发式算法, 物流网络设计, 增强型分枝定界算法, 制造系统, DEVS, LCM, 多粒度建模, 实时动态, 碳排放

Abstract: The material flow network design problem in manufacturing systems is investigated. A fixed-charge capacitated network design model is formulated, and an enhanced branch-and-bound algorithm based on a Lagrangian heuristic is proposed to solve the resulting NP-hard problem. The Lagrangian heuristic provides both upper and lower bounds to the problem, and the branch-and-bound procedure is based on the information generated by the Lagrangian heuristic to reduce the size of the branch-and-bound tree. The method is tested on networks of various sizes. Results indicate that the algorithm can provide good solutions in reasonable time.

Key words: Enhanced branch-and-bound algorithm, Lagrangian heuristic, Manufacturing systems, Material flow network design, Carbon emission, DEVS, Multi-granular modeling, Real-time dynamic, LCM