A reactive GRASP and Path Relinking for balancing reconfigurable transfer lines

2012 ◽  
Vol 50 (18) ◽  
pp. 5213-5238 ◽  
Author(s):  
Mohamed Essafi ◽  
Xavier Delorme ◽  
Alexandre Dolgui
TAPPI Journal ◽  
2018 ◽  
Vol 17 (05) ◽  
pp. 261-269
Author(s):  
Wei Ren ◽  
Brennan Dubord ◽  
Jason Johnson ◽  
Bruce Allison

Tight control of raw green liquor total titratable alkali (TTA) may be considered an important first step towards improving the overall economic performance of the causticizing process. Dissolving tank control is made difficult by the fact that the unknown smelt flow is highly variable and subject to runoff. High TTA variability negatively impacts operational costs through increased scaling in the dissolver and transfer lines, increased deadload in the liquor cycle, under- and over-liming, increased energy consumption, and increased maintenance. Current practice is to use feedback control to regulate the TTA to a target value through manipulation of weak wash flow while simultaneously keeping dissolver density within acceptable limits. Unfortunately, the amount of variability reduction that can be achieved by feedback control alone is fundamentally limited by the process dynamics. One way to improve upon the situation would be to measure the smelt flow and use it as a feedforward control variable. Direct measurement of smelt flow is not yet possible. The use of an indirect measurement, the dissolver vent stack temperature, is investigated in this paper as a surrogate feedforward variable for dissolving tank TTA control. Mill trials indicate that significant variability reduction in the raw green liquor TTA is possible and that the control improvements carry through to the downstream processes.


Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 853
Author(s):  
Jesús Sánchez-Oro ◽  
Ana D. López-Sánchez ◽  
Anna Martínez-Gavara ◽  
Alfredo G. Hernández-Díaz ◽  
Abraham Duarte

This paper presents a hybridization of Strategic Oscillation with Path Relinking to provide a set of high-quality nondominated solutions for the Multiobjective k-Balanced Center Location problem. The considered location problem seeks to locate k out of m facilities in order to serve n demand points, minimizing the maximum distance between any demand point and its closest facility while balancing the workload among the facilities. An extensive computational experimentation is carried out to compare the performance of our proposal, including the best method found in the state-of-the-art as well as traditional multiobjective evolutionary algorithms.


2005 ◽  
Vol 17 (2) ◽  
pp. 224-247 ◽  
Author(s):  
Renata M. Aiex ◽  
Mauricio G. C. Resende ◽  
Panos M. Pardalos ◽  
Gerardo Toraldo

Sign in / Sign up

Export Citation Format

Share Document