A well-designed production schedule for cold rolling can enhance steel enterprises'operational efficiency and profitability.Nevertheless,the intricate constraints and numerous steps involved in cold rolling pose c...A well-designed production schedule for cold rolling can enhance steel enterprises'operational efficiency and profitability.Nevertheless,the intricate constraints and numerous steps involved in cold rolling pose challenges to devising a rational scheduling plan.Therefore,considering the practical production constraints,this paper investigates a cold rolling scheduling problem for processing jobs with specific due dates and batch attributions on parallel heterogeneous machines with continuous production requirements.Firstly,the scheduling problem is formulated as a mixed integer linear program(MILP)model with an economic objective.Then,a modified genetic algorithm(GA)is proposed to search for the optimal solution to the MILP problem.Specifically,this method includes a heuristic initialization mechanism to generate feasible initial solutions,three heuristic mutation operators to generate promising candidate solutions,and a parallel computing mechanism to accelerate the evaluation process of the GA.The simulation results demonstrate that the proposed method can be effectively implemented to generate optimized scheduling schemes in the cold rolling process.展开更多
To solve the problem of low efficiency in pipe routing design, an improved genetic algorithm based approach is proposed. To present this approach, the paper mainly describes a generation method of nodes considering th...To solve the problem of low efficiency in pipe routing design, an improved genetic algorithm based approach is proposed. To present this approach, the paper mainly describes a generation method of nodes considering the safety distance of pipes and the directional constraints at terminals, the definition of a double coding technique, the collision detection method, the concept of energy and the definition of fitness functions. The similarity detection is introduced to prevent close breeding in the crossover operator, the selection pressure is controlled according to the evolution situation and a heuristic mutation method is used to boost the evolution. Simulation case shows that this approach is more practical and can satisfy different design requirements by changing algorithm parameters.展开更多
Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show...Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show that, with heuristic mutation strategy, the algorithm has high searching efficiency and fast convergence speed. Meanwhile, we also have take the avalanche probability of S-boxes into account, besides nonlinearity and difference uniformity. Under this method, an effective genetic algorithm for 6×6 S-boxes is provided and a number of S-boxes with good cryptographic capability can be obtained.展开更多
基金Supported by National Natural Science Foundation of China(Grant No.62273362)National Key Research and Development Program of China(Grant No.2024YFB3312100)。
文摘A well-designed production schedule for cold rolling can enhance steel enterprises'operational efficiency and profitability.Nevertheless,the intricate constraints and numerous steps involved in cold rolling pose challenges to devising a rational scheduling plan.Therefore,considering the practical production constraints,this paper investigates a cold rolling scheduling problem for processing jobs with specific due dates and batch attributions on parallel heterogeneous machines with continuous production requirements.Firstly,the scheduling problem is formulated as a mixed integer linear program(MILP)model with an economic objective.Then,a modified genetic algorithm(GA)is proposed to search for the optimal solution to the MILP problem.Specifically,this method includes a heuristic initialization mechanism to generate feasible initial solutions,three heuristic mutation operators to generate promising candidate solutions,and a parallel computing mechanism to accelerate the evaluation process of the GA.The simulation results demonstrate that the proposed method can be effectively implemented to generate optimized scheduling schemes in the cold rolling process.
基金Supported by National "863" Project of China (2006AA09A104)
文摘To solve the problem of low efficiency in pipe routing design, an improved genetic algorithm based approach is proposed. To present this approach, the paper mainly describes a generation method of nodes considering the safety distance of pipes and the directional constraints at terminals, the definition of a double coding technique, the collision detection method, the concept of energy and the definition of fitness functions. The similarity detection is introduced to prevent close breeding in the crossover operator, the selection pressure is controlled according to the evolution situation and a heuristic mutation method is used to boost the evolution. Simulation case shows that this approach is more practical and can satisfy different design requirements by changing algorithm parameters.
基金Supported by the National Natural Science Foundation of China (60473012)
文摘Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show that, with heuristic mutation strategy, the algorithm has high searching efficiency and fast convergence speed. Meanwhile, we also have take the avalanche probability of S-boxes into account, besides nonlinearity and difference uniformity. Under this method, an effective genetic algorithm for 6×6 S-boxes is provided and a number of S-boxes with good cryptographic capability can be obtained.
