By Topic

Modeling and Solution for the Coil Sequencing Problem in Steel Color-Coating Production

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lixin Tang ; Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang, China ; Yang Yang ; Jiyin Liu

This paper studies the problem of selecting coils and sequencing them to form a production plan by considering production practical requirements, which arises on the color coating line in the steel industry. The problem can be modeled as a generalization of the prize collecting vehicle routing problem which should make both sequencing and selecting decisions. We propose tabu search-based algorithm (TS) to solve the problem. After each move in the searching procedure, the sequencing decision is adjusted to optimal by a dynamic programming algorithm which can solve up to the industrial sized problem quickly. Thus, TS procedure essentially makes the selecting decision. To further improve the TS algorithm, composite neighborhoods involving block moves are proposed. In addition, compound moves are implemented by choosing improvement strategy from variable neighborhoods alternately at each iteration. To evaluate the performance of the TS algorithm, by reformulating the problem as a set covering model with double-side inequality capacity constraints, the lower bound is constructed using a column generation algorithm where the pricing problem is solved by dynamic programming method based on derived dominance rules. From the computation results based on randomly generated instances, the average deviation between the feasible solution and lower bound is 4.2334%, thus the performance of the proposed TS algorithm and column generation is demonstrated. Alternately, another TS algorithm without DP is proposed for the possible larger scale instances.

Published in:

IEEE Transactions on Control Systems Technology  (Volume:20 ,  Issue: 6 )