Multi-criteria design optimization study of solvent extraction in mixer–settler units

Solvent extraction is considered as a multi-criteria optimization problem, since several chemical species with similar extraction kinetic properties are frequently present in the aqueous phase and the selective extraction is not practicable. This optimization, applied to mixer–settler units, considers the best parameters and operating conditions, as well as the best structure or process flow-sheet. Global process optimization is performed for a specific flow-sheet and a comparison of Pareto curves for different flow-sheets is made. The positive weight sum approach linked to the sequential quadratic programming method is used to obtain the Pareto set.In all investigated structures, recovery increases with hold-up, residence time and agitation speed, while the purity has an opposite behaviour. For the same treatment capacity, counter-current arrangements are shown to promote recovery without significant impairment in purity. Recycling the aqueous phase is shown to be irrelevant, but organic recycling with as many stages as economically feasible clearly improves the design criteria and reduces the most efficient organic flow-rate.     

A multi-objective selection procedure of determining a Pareto set

Ranking and selection (R&S) procedures have been widely studied and applied in determining the required sample size (i.e., the number of replications or batches) for selecting the best system or a subset containing the best system from a set of k alternatives. Most of the studies in the R&S have focused on a single measure of system performance. In many practical situations, however, we need to select systems based on multiple criteria. A solution is called Pareto optimal if there exists no other solution which is better in all criteria. This paper discusses extending a R&S procedure to select a Pareto set containing non-dominated systems. Computational results show that the proposed procedures are effective in obtaining non-dominated systems.     

Multi-objective evolutionary algorithm for SSSC-based controller design

In this paper, an evolutionary multi-objective optimization approach is employed to design a static synchronous series compensator (SSSC)-based controller. The design objective is to improve the transient performance of a power system subjected to a severe disturbance by damping the multi-modal oscillations namely; local mode, inter-area mode and inter-plant mode. A genetic algorithm (GA)-based solution technique is applied to generate a Pareto set of global optimal solutions to the given multi-objective optimization problem. Further, a fuzzy-based membership value assignment method is employed to choose the best compromise solution from the obtained Pareto solution set. Simulation results are presented and compared with a PI controller under various disturbances namely; three-phase fault, line outage, loss of load and unbalanced faults to show the effectiveness and robustness of the proposed approach.     

Fano Decoding with Timeout: Queuing Analysis

In mobile communications, a class of variable‐complexity algorithms for convolutional decoding known as sequential decoding algorithms is of interest since they have a computational time that could vary with changing channel conditions. The Fano algorithm is one well‐known version of a sequential decoding algorithm. Since the decoding time of a Fano decoder follows the Pareto distribution, which is a heavy‐tailed distribution parameterized by the channel signal‐to‐noise ratio (SNR), buffers are required to absorb the variable decoding delays of Fano decoders. Furthermore, since the decoding time drawn by a certain Pareto distribution can become unbounded, a maximum limit is often employed by a practical decoder to limit the worst‐case decoding time. In this paper, we investigate the relations between buffer occupancy, decoding time, and channel conditions in a system where the Fano decoder is not allowed to run with unbounded decoding time. A timeout limit is thus imposed so that the decoding will be terminated if the decoding time reaches the limit. We use discrete‐time semi‐Markov models to describe such a Fano decoding system with timeout limits. Our queuing analysis provides expressions characterizing the average buffer occupancy as a function of channel conditions and timeout limits. Both numerical and simulation results are provided to validate the analytical results.     

Bayesian approach to parameter estimation of the generalized pareto distribution

Several methods have been used for estimating the parameters of the generalized Pareto distribution (GPD), namely maximum likelihood (ML), the method of moments (MOM) and the probability-weighted moments (PWM). It is known that for these estimators to exist, certain constraints have to be imposed on the range of the shape parameter,k, of the GPD. For instance, PWM and ML estimators only exist fork>−0.5 andk≤1, respectively. Moreover, and particularly for small sample sizes, the most efficient method to apply in any practical situation highly depends on a previous knowledge of the most likely values ofk. This clearly suggests the use of Bayesian techniques as a way of using prior information onk. In the present work, we address the issue of estimating the parameters of the GPD from a Bayesian point of view. The proposed approach is compared via a simulation study with ML, PWM and also with the elemental percentile method (EPM) which was developed by Castillo and Hadi (1997). The estimation procedure is then applied to two real data sets.     

The multi-criteria minimum spanning tree problem based genetic algorithm

Minimum spanning tree (MST) problem is of high importance in network optimization and can be solved efficiently. The multi-criteria MST (mc-MST) is a more realistic representation of the practical problems in the real world, but it is difficult for traditional optimization technique to deal with. In this paper, a non-generational genetic algorithm (GA) for mc-MST is proposed. To keep the population diversity, this paper designs an efficient crossover operator by using dislocation a crossover technique and builds a niche evolution procedure, where a better offspring does not replace the whole or most individuals but replaces the worse ones of the current population. To evaluate the non-generational GA, the solution sets generated by it are compared with solution sets from an improved algorithm for enumerating all Pareto optimal spanning trees. The improved enumeration algorithm is proved to find all Pareto optimal solutions and experimental results show that the non-generational GA is efficient.     

Variable neighborhood search for multi-objective resource allocation problems

The Resource Allocation Problem (RAP) is a classical problem in the field of operations management that has been broadly applied to real problems such as product allocation, project budgeting, resource distribution, and weapon-target assignment. In addition to focusing on a single objective, the RAP may seek to simultaneously optimize several expected but conflicting goals under conditions of resources scarcity. Thus, the single-objective RAP can be intuitively extended to become a Multi-Objective Resource Allocation Problem (MORAP) that also falls in the category of NP-Hard. Due to the complexity of the problem, metaheuristics have been proposed as a practical alternative in the selection of techniques for finding a solution. This study uses Variable Neighborhood Search (VNS) algorithms, one of the extensively used metaheuristic approaches, to solve the MORAP with two important but conflicting objectives—minimization of cost and maximization of efficiency. VNS searches the solution space by systematically changing the neighborhoods. Therefore, proper design of neighborhood structures, base solution selection strategy, and perturbation operators are used to help build a well-balanced set of non-dominated solutions. Two test instances from the literature are used to compare the performance of the competing algorithms including a hybrid genetic algorithm and an ant colony optimization algorithm. Moreover, two large instances are generated to further verify the performance of the proposed VNS algorithms. The approximated Pareto front obtained from the competing algorithms is compared with a reference Pareto front by the exhaustive search method. Three measures are considered to evaluate algorithm performance: D1_R, the Accuracy Ratio, and the number of non-dominated solutions. The results demonstrate the practicability and promise of VNS for solving multi-objective resource allocation problems.     

多目标进化算法中基于聚集距离调整的分布性保持方法

在经典的非支配排序遗传算法中,基于聚集距离的种群维护策略并不能很好地保持解集的分布性。提出一种改进的基于聚集距离调整的分布性维护策略,根据邻近个体的聚集距离大小关系,保留分布较好的个体。与经典算法NSGA-Ⅱ,PESA-Ⅱ和小生境方法进行比较,实验结果表明,提出的分布性维护策略能较大程度提高分布性,并保持较好的收敛性。     

解决多目标优化问题的差分进化算法研究进展

差分进化(differential evolution,DE)是一种简单但功能强大的进化优化算法.由于其优秀的性能,其诞生之日起就吸引了各国研究人员的关注.作为一种基于群体的全局性启发式搜索算法,差分进化算法在科学和工程中有许多成功的应用.本文对解决多目标优化问题的差分进化算法研究进行了综述,对差分进化的基本概念进行了详细的描述,给出了几种解决多目标优化问题的差分进化算法变体,并且给出了差分进化算法解决多目标优化问题的理论分析,最后,给出了差分进化算法解决多目标优化问题的工程应用,并指出了未来具有挑战性的研究领域.     

PRODUCT QUALITY MULTI-OBJECTIVE DRYER DESIGN

ABSTRACT

Design of conveyor-belt dryers constitutes a mathematical programming problem involving the evaluation of appropriate structural and operational process variables so that total annual plant cost involved is optimized. The increasing need for dehydrated products of the highest quality, imposes the development of new criteria that, together with cost, determine the design rules for drying processes. Quality of dehydrated products is a complex resultant of properties characterizing the final products, where the most important one is color. Color is determined as a three-parameter resultant, whose values for products undergone drying should deviate from the corresponding ones of natural products, as little as possible. In this case, product quality dryer design is a complex multi-objective optimization problem, involving the color deviation vector as an objective function and as constraints the ones deriving from the process mathematical model. The mathematical model of the dryer was developed and the fundamental color deterioration laws were determined for the drying process. Non-preference multi-criteria optimization methods were used and the Pareto-optimal set of efficient solutions was evaluated. An example covering the drying of sliced potato was included to demonstrate the performance of the design procedure, as well as the effectiveness of the proposed approach.