Jul 2026· Chemical product and process modeling· 0 citations· 19 references
Abstract
Abstract Refinery network optimization is a challenging Mixed-Integer Nonlinear Programming (MINLP) problem due to complex process interactions and non-linearities. This paper proposes a multi-period solution strategy that decomposes the original MINLP into a sequence of tractable sub-problems. First, all non-linear terms are linearized, and the resulting linear program is solved to obtain an initial feasible solution. Then, each non-linear term is restored iteratively, using the solution of the previous step as a starting point. After all non-linearities are reintroduced, the full MINLP is solved with the refined initial conditions. The approach is demonstrated on a real-world refinery case study. Compared to the benchmark of Seinfeld and McBride (1970), the proposed strategy achieves a 2.7 % increase in profit while maintaining computational feasibility. The step-by-step evolution of the solution, intermediate results, and computational performance (CPU time: 0.45 s, optimality gap: 0.0 %) are discussed in detail.
The algorithm's objective is to efficiently solve Dynamic Linear Programs by taking advantage of their special staircase structure, which constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which would make the nonlinear programming method of Successive Quadratic Programs more...
The scalability of a multi-criteria optimization for the Service Team Transport Scheduling (STTS) problem is investigated, minimizing total travel time, maximum vehicle worktime, and total vehicle engagement time to define scale-aware algorithmic boundaries essential for real-time decision support systems.
Jarosław Rudy, G. Radzki· IEEE Access· 0 citations
A modification of the algorithm is proposed that allows reducing computation time without losing solution accuracy, and a heuristic limitation on the number of recalculated potentials within each iteration is introduced.
A. Ozerov, O. I. Kurlykov· Vestnik of Samara State Univ...· 0 citations
Within the current steelmaking and continuous-casting (SCC) production, the growing differentiation in the production processes stemming from the product diversification, brings about great difficulties in solving the SCC scheduling problem, and decreases pitifully the possibility of ascertaining the duality gap which...
Da-Yong Han, Jin-Lei Tan, Yu-Qi Yang· International Symposium on N...· 0 citations
By prioritizing absolute search stability and robustness in high-dimensional tasks, the proposed algorithm attains an optimal balance between convergence quality and practical engineering efficiency, proving exceptionally effective in complex path-planning scenarios.
The results show that basis-aware refinement and informative initial partitions substantially reduce solution times while keeping objective gaps small relative to the reference model, indicating that adaptive partitioning is a promising computational strategy for large-scale stochastic bilevel optimization.
Carlos Muñoz-Rey, Francisco Jara-Moroni· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
