Abstract
To address large scale industrial processes, a novel Lagrangian scheme is proposed to decompose a refinery scheduling problem with operational transitions in mode switching into a production subproblem and a blending and delivery subproblem. To accelerate the convergence of Lagrange multipliers, some auxiliary constraints are added in the blending and delivery subproblem. A speed-up scheme is presented to increase the efficiency for solving the production subproblem. An initialization scheme of Lagrange multipliers and a heuristic algorithm to find feasible solutions are designed. Computational results on three cases with different lengths of time horizons and different numbers of orders show that the proposed Lagrangian scheme is effective and efficient.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
