PROJECT TITLE :
Modeling and Solution for the Coil Sequencing Problem in Steel Color-Coating Production
This paper studies the matter of selecting coils and sequencing them to form a production plan by considering production practical necessities, that arises on the colour coating line within the steel trade. The matter can be modeled as a generalization of the prize collecting vehicle routing problem which should build both sequencing and choosing selections. We have a tendency to propose tabu search-primarily based algorithm (TS) to solve the matter. After each move in the looking procedure, the sequencing decision is adjusted to optimal by a dynamic programming algorithm that can solve up to the industrial sized problem quickly. Therefore, TS procedure essentially makes the selecting decision. To further improve the TS algorithm, composite neighborhoods involving block moves are proposed. Further, compound moves are implemented by choosing improvement strategy from variable neighborhoods alternately at every iteration. To evaluate the performance of the TS algorithm, by reformulating the problem as a collection covering model with double-aspect inequality capacity constraints, the lower bound is constructed employing a column generation algorithm where the pricing downside is solved by dynamic programming method primarily based on derived dominance rules. From the computation results based on randomly generated instances, the average deviation between the feasible resolution and lower sure is 4.2334%, thus the performance of the proposed TS algorithm and column generation is demonstrated. Alternately, another TS algorithm while not DP is proposed for the attainable larger scale instances.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here