摘要
研究了制造系统中物流网络设计问题,构建了一个带固定费用的容量受限的网络设计模型,提出了一种求解该问题的基于拉格朗日启发式算法的增强型分枝定界方法。通过大量的试验测试,结果表明该算法能有效地解决大型的具有NP-hard特性的网络设计问题。
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.
出处
《机械工程学报》
EI
CAS
CSCD
北大核心
2003年第2期84-89,共6页
Journal of Mechanical Engineering
基金
国家自然科学基金资助项目(59905009)。
关键词
制造系统
物流网络设计
拉格朗日启发式算法
增强型分枝定界算法
Manufacturing systemsMaterial flow network designLagrangian heuristicEnhanced branch-and-bound algorithm
