|
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: Manufacturing systems Material flow network design
Lagrangian heuristic Enhanced
branch-and-bound algorithm
CLC No: TP391.7
国家自然科学基金资助项目(59905009). Received 20010814, received in revised form
20011220
|