Hot Rolling Batch Planning Problem Model Based on Genetic Algorithm

2012 ◽  
Vol 433-440 ◽  
pp. 2042-2046
Author(s):  
Hai Tao Li ◽  
Su Jian Li ◽  
Di Wu ◽  
Fang Han ◽  
Fang Wang

To solve the hot rolling batch planning problem in production scheduling of iron and steel enterprises, a hot rolling batch planning model is formulated based on multiple travelling salesmen problem(MTSP) model. The objective is to minimize the total limit penalty value of adjacent stripped steels in width, thickness and hardness. The main constraints include jumps in width, thickness and hardness between adjacent stripped steels, which are essential for steel production process. An improved genetic algorithm is designed to solve the model. A simulation example shows the reasonability of the model and validity of the algorithm.

2013 ◽  
Vol 365-366 ◽  
pp. 194-198 ◽  
Author(s):  
Mei Ni Guo

mprove the existing genetic algorithm, make the vehicle path planning problem solving can be higher quality and faster solution. The mathematic model for study of VRP with genetic algorithms was established. An improved genetic algorithm was proposed, which consist of a new method of initial population and partheno genetic algorithm revolution operation.Exploited Computer Aided Platform and Validated VRP by simulation software. Compared this improved genetic algorithm with the existing genetic algorithm and approximation algorithms through an example, convergence rate Much faster and the Optimal results from 117.0km Reduced to 107.8km,proved that this article improved genetic algorithm can be faster to reach an optimal solution. The results showed that the improved GA can keep the variety of cross and accelerate the search speed.


2013 ◽  
Vol 860-863 ◽  
pp. 3094-3099 ◽  
Author(s):  
Bao Lin Zhu ◽  
Shou Feng Ji

Iron and steel production scheduling problems are different from general production scheduling in machine industry. They have to meet special demands of steel production process. The CCR production manner dramatically promotes the revolution in technology and management, especially to planning and scheduling. In this paper, a scheduling model is presented to integrate the three working procedures and the lagrangian relaxation technology is proposed to get the optimal solution of the scheduling model. Finally, numerical examples are given to demonstrate the effectiveness of the integrated model and method.


2010 ◽  
Vol 139-141 ◽  
pp. 1679-1683 ◽  
Author(s):  
Hong Bing Wang ◽  
Ai Jun Xu ◽  
Dong Feng He

The real production scheduling problem between steel-making and continuous-casting can be modeled as JSSP with fuzzy processing and delivery time. An improved genetic algorithm is proposed for solving this problem and the improved aspects include the mechanism for preventing early-maturing and the job filter order-based crossover operator. The test results show that the improved genetic algorithm can find better solutions than other three algorithms. A real production scheduling problem of steel-making and continuous-casting is computed using the improved genetic algorithm and it shows the algorithm is effective.


Sign in / Sign up

Export Citation Format

Share Document