scholarly journals Research on Steelmaking-Continuous Casting Production Scheduling Problem Based on Augmented Lagrangian Relaxation Algorithm under Multi-Coupling Constraints

2019 ◽  
Vol 52 (1) ◽  
pp. 820-825 ◽  
Author(s):  
Liangliang Sun ◽  
Hang Jin ◽  
Yaqian Yu ◽  
Zhi Li ◽  
Jiali Xi
2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Ping Che ◽  
Zhenhao Tang ◽  
Hua Gong ◽  
Xiaoli Zhao

The robust generation self-scheduling problem under electricity price uncertainty is usually solved by the commercial solver, which is limited in computation time and memory requirement. This paper proposes an improved Lagrangian relaxation algorithm for the robust generation self-scheduling problem where the quadratic fuel cost and the time-dependent exponential startup cost are considered. By using the optimal duality theory, the robust generation self-scheduling problem, which has a max-min structure, is reformulated as a minimization mixed integer nonlinear programming (MINLP) problem. Upon the reformulation, the Lagrangian relaxation algorithm is developed. To obtain a solvable relaxed problem, the variable splitting technique is introduced before the relaxation. The obtained relaxed problem is decomposed into a linear programming-type subproblem and multiple single-unit subproblems. Each single-unit subproblem is solved optimally by a two-stage backward dynamic programming procedure. The special cases of the problem are discussed and a two-stage algorithm is proposed. The proposed algorithms are tested on test cases of different sizes and the numerical results show that the algorithms can find near-optimal solutions in a reasonable time.


2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Binghai Zhou ◽  
Yuanrui Lei ◽  
Shi Zong

<p style='text-indent:20px;'>Cross-docking is a kind of process that products are unloaded in front of the inbound doors, consolidated based on the downstream demand, and then directly transferred to the outbound doors without a long storage process during the transportation. In this paper, a multi-door cross-dock truck scheduling problem is investigated in which the scheduling and sequencing assignment of trucks need to be considered, with the objectives of minimizing the inner transportation cost in the cross-dock and the total truck waiting cost. The major contribution of this paper is that a novel product-related time window constraint and the temporary storage area are firstly introduced to adapt to different physical conditions of goods considering real-world requirements. Then, a Lagrangian relaxation algorithm is proposed which aims to decompose the relaxed problem into several easy-to-be-solved sub-problems. Besides, a subgradient algorithm is used at each iteration to further deal with these sub-problems. Finally, theory analysis and simulation experiments of different problem scales are carried out during the comparison with a Greedy algorithm to evaluate the performance of the proposed algorithm. Results indicate that the Lagrangian relaxation algorithm is able to achieve more satisfactory near-optimal solutions within an acceptable time.</p>


2013 ◽  
Vol 441 ◽  
pp. 1077-1080
Author(s):  
Gui Rong Wang ◽  
Qi Qiang Li ◽  
Mao Rong Yuan

This paper addresses the Steelmaking Continuous Casting production scheduling problem (SCC) with power consumption as the main objective. An encoding and decoding scheme is proposed and an effective Estimation of Distribution Algorithm (EDA) is presented to solve it. Simulation experiments indicate that EDA can solve the SCC problem efficiently and has fast speed of convergency.


Sign in / Sign up

Export Citation Format

Share Document