Magnetic Material Group Furnace Problem Modeling and the Specialization of the Genetic Algorithm

Grade, due date, priority, and demand are attributes of magnetic material products. Planners are required to seek the optimal combination of production work orders to minimize cost and improve efficiency based on these attributes. The magnetic material group furnace optimization problem is a generalization of the 1-D bin-packing problem wherein bins of varying sizes are used. Bin sizes are determined by the grade and demand of the grouped work orders. A mathematical model is established to solve the magnetic material group furnace optimization problem by using a specialized genetic algorithm (SGA). In SGA, an initial population generation method is designed by following the sort criteria of the earliest completion date. The furnace charging weight is set according to several rules derived from work order attributes. An elite strategy and an improved greedy three-crossover operator are introduced to enhance convergence speed and precision. In addition, a reverse operator is applied to exploit the proposed algorithm. Simulation results based on practical production data show that the established model is suitable and that the presented algorithm is effective.

[1]  Wei Huang,et al.  Project-Scheduling Problem With Random Time-Dependent Activity Duration Times , 2011, IEEE Transactions on Engineering Management.

[2]  Suresh K. Nair,et al.  Designer-moderated product design , 2001, IEEE Trans. Engineering Management.

[3]  Gleb Belov,et al.  A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths , 2002, Eur. J. Oper. Res..

[4]  Tianyou Chai,et al.  Improved genetic algorithm for magnetic material two-stage multi-product production scheduling: A case study , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[5]  Wallace K. S. Tang,et al.  A hybrid genetic approach for garment cutting in the clothing industry , 2003, IEEE Trans. Ind. Electron..

[6]  Chengbin Chu,et al.  Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms , 2001, SIAM J. Comput..

[7]  Francis J. Vasko,et al.  A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading , 1999, Eur. J. Oper. Res..

[8]  J. O. Berkey,et al.  A Systolic-Based Parallel Bin Packing Algorithm , 1994, IEEE Trans. Parallel Distributed Syst..

[9]  Yang Yang,et al.  Multicomponent Signal Analysis Based on Polynomial Chirplet Transform , 2013, IEEE Transactions on Industrial Electronics.

[10]  Kamal Al-Haddad,et al.  A Novel Six-Band Hysteresis Control for the Packed U Cells Seven-Level Converter: Experimental Validation , 2012, IEEE Transactions on Industrial Electronics.

[11]  Bruce L. Golden,et al.  Solving the one-dimensional bin packing problem with a weight annealing heuristic , 2008, Computers & Operations Research.

[12]  Eva Hopper,et al.  Two-dimensional Packing utilising Evolutionary Algorithms and other Meta-Heuristic Methods , 2002 .

[13]  Hongfei Teng,et al.  An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles , 1999, Eur. J. Oper. Res..

[14]  Michael Randolph Garey,et al.  Approximation algorithms for bin-packing , 1984 .

[15]  Yang Qiwen.  Optimum charge plan of steelmaking continuous casting based on the modified discrete particle swarm optimization algorithm , 2011 .

[16]  Miro Gradisar,et al.  A hybrid approach for optimization of one-dimensional cutting , 1999, Eur. J. Oper. Res..

[17]  Chak-Kuen Wong,et al.  Linear time-approximation algorithms for bin packing , 2000, Oper. Res. Lett..

[18]  Keisuke Ishihara,et al.  A Tree Based Novel Representation for 3D-Block Packing , 2009, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[19]  Teodor Gabriel Crainic,et al.  Efficient lower bounds and heuristics for the variable cost and size bin packing problem , 2011, Comput. Oper. Res..

[20]  Chia-Feng Juang.  Genetic recurrent fuzzy system by coevolutionary computation with divide-and-conquer technique , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[21]  Wallace Kit-Sang Tang,et al.  A hybrid genetic approach for container loading in logistics industry , 2005, IEEE Transactions on Industrial Electronics.

[22]  Kang Li,et al.  An improved TLBO with elite strategy for parameters identification of PEM fuel cell and solar cell models , 2014 .

[23]  Enrico Zio,et al.  An Integrated Framework for Risk Response Planning Under Resource Constraints in Large Engineering Projects , 2013, IEEE Transactions on Engineering Management.

[24]  Yefeng Liu,et al.  A Component-Based Technology for Production Planning System in the Magnetic Material Industry , 2012 .

[25]  Tongdan Jin,et al.  Designing a Sustainable and Distributed Generation System for Semiconductor Wafer Fabs , 2013, IEEE Transactions on Automation Science and Engineering.

[26]  Kiejin Park,et al.  Frame Packing for Minimizing the Bandwidth Consumption of the FlexRay Static Segment , 2013, IEEE Transactions on Industrial Electronics.

[27]  Andrew Lim,et al.  Effective Neighborhood Operators for Solving the Flexible Demand Assignment Problem , 2008, IEEE Transactions on Automation Science and Engineering.

[28]  Reza Tavakkoli-Moghaddam,et al.  Multiobjective Dynamic Vehicle Routing Problem With Fuzzy Travel Times and Customers’ Satisfaction in Supply Chain Management , 2013, IEEE Transactions on Engineering Management.

[29]  E. Hopper,et al.  A genetic algorithm for a 2D industrial packing problem , 1999 .

[30]  Teodor Gabriel Crainic,et al.  The Generalized Bin Packing Problem , 2012 .

[31]  Frank D. Murgolo.  An Efficient Approximation Scheme for Variable-Sized Bin Packing , 1987, SIAM J. Comput..

[32]  Armin Scholl,et al.  Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..

[33]  Hsiung-Cheng Lin,et al.  Power Harmonics and Interharmonics Measurement Using Recursive Group-Harmonic Power Minimizing Algorithm , 2012, IEEE Transactions on Industrial Electronics.

[34]  Mehdi Serairi,et al.  Relaxations and exact solution of the variable sized bin packing problem , 2011, Comput. Optim. Appl..

[35]  Sai Ho Chung,et al.  Minimization of Order Tardiness Through Collaboration Strategy in Multifactory Production System , 2011, IEEE Systems Journal.

[36]  Murray Shanahan,et al.  A Vision-Based Intelligent System for Packing 2-D Irregular Shapes , 2007, IEEE Transactions on Automation Science and Engineering.

[37]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[38]  Mehmet Bayram Yildirim,et al.  Single-Machine Sustainable Production Planning to Minimize Total Energy Consumption and Total Completion Time Using a Multiple Objective Genetic Algorithm , 2012, IEEE Transactions on Engineering Management.

[39]  Sungsoo Park,et al.  Algorithms for the variable sized bin packing problem , 2003, Eur. J. Oper. Res..

[40]  Cláudio Alves,et al.  Accelerating column generation for variable sized bin-packing problems , 2007, Eur. J. Oper. Res..

[41]  L. V. Kantorovich,et al.  Mathematical Methods of Organizing and Planning Production , 1960 .

[42]  Christian Blum,et al.  Variable neighbourhood search for the variable sized bin packing problem , 2012, Comput. Oper. Res..

[43]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[44]  Ge Hongwei.  Improved simulated annealing genetic algorithm for solving TSP problem , 2010 .

[45]  Chen Hailong.  Optimization of unit commitment of marine power system using improved genetic algorithm , 2011 .

[46]  Hing Kai Chan,et al.  A Two-Level Genetic Algorithm to Determine Production Frequencies for Economic Lot Scheduling Problem , 2012, IEEE Transactions on Industrial Electronics.

[47]  Pei-Chann Chang,et al.  Multiple parents crossover operators: A new approach removes the overlapping solutions for sequencing problems , 2013 .

[48]  Gerhard Wäscher,et al.  The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP , 1997 .

[49]  Sammy Chan,et al.  Optimal file placement in VOD system using genetic algorithm , 2001, IEEE Trans. Ind. Electron..

[50]  Mohamed I. Elmasry,et al.  Design and optimization of multithreshold CMOS (MTCMOS) circuits , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[51]  David Menotti,et al.  Combining Multiple Classification Methods for Hyperspectral Data Interpretation , 2013, IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing.

[52]  Luís Gouveia,et al.  Solving the variable size bin packing problem with discretized formulations , 2008, Comput. Oper. Res..

[53]  D. K. Friesen,et al.  Variable Sized Bin Packing , 1986, SIAM J. Comput..

[54]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..