An Optimization Algorithm of Slab-Design Based on Bipartite Graph and Linear Programming
Abstract
This paper shows a novel optimization algorithm based on bipartite graph and linear programming for the self-produced slab-design problem with continuous weight and color-constrained. Firstly, we reduce the number of slabs through bipartite graph maximum weight matching. The second step uses linear programming to reduce residual material. Finally, the experimental results show that the algorithm will lead to a good slab-design scheme in a short time, which will provide decision support for the actual scheduling production.
Keywords
Slab-design, Combination optimization, Bipartite graph, Linear programming
DOI
10.12783/dtetr/ecar2018/26382
10.12783/dtetr/ecar2018/26382
Refbacks
- There are currently no refbacks.