Search results
1 – 10 of 811B. Latha Shankar, S. Basavarajappa and Rajeshwar S. Kadadevaramath
The paper aims at the bi‐objective optimization of a two‐echelon distribution network model for facility location and capacity allocation where in a set of customer locations with…
Abstract
Purpose
The paper aims at the bi‐objective optimization of a two‐echelon distribution network model for facility location and capacity allocation where in a set of customer locations with demands and a set of candidate facility locations will be known in advance. The problem is to find the locations of the facilities and the shipment pattern between the facilities and the distribution centers (DCs) to minimize the combined facility location and shipment costs subject to a requirement that maximum customer demands be met.
Design/methodology/approach
To optimize the two objectives simultaneously, the location and distribution two‐echelon network model is mathematically represented in this paper considering the associated constraints, capacity, production and shipment costs and solved using hybrid multi‐objective particle swarm optimization (MOPSO) algorithm.
Findings
This paper shows that the heuristic based hybrid MOPSO algorithm can be used as an optimizer for characterizing the Pareto optimal front by computing well‐distributed non‐dominated solutions. These aolutions represent trade‐off solutions out of which an appropriate solution can be chosen according to industrial requirement.
Originality/value
Very few applications of hybrid MOPSO are mentioned in literature in the area of supply chain management. This paper addresses one of such applications.
Details
Keywords
Yalin Pan, Jun Huang, Feng Li and Chuxiong Yan
The purpose of this paper is to propose a robust optimization strategy to deal with the aerodynamic optimization issue, which does not need a large sum of information on the…
Abstract
Purpose
The purpose of this paper is to propose a robust optimization strategy to deal with the aerodynamic optimization issue, which does not need a large sum of information on the uncertainty of input parameters.
Design/methodology/approach
Interval numbers were adopted to describe the uncertain input, which only requires bounds and does not necessarily need probability distributions. Based on the method, model outputs were also regarded as intervals. To identify a better solution, an order relation was used to rank interval numbers.
Findings
Based on intervals analysis method, the uncertain optimization problem was transformed into nested optimization. The outer optimization was used to optimize the design vector, and inner optimization was used to compute the interval of model outputs. A flying wing aircraft was used as a basis for uncertainty optimization through the suggested optimization strategy, and optimization results demonstrated the validity of the method.
Originality/value
In aircraft conceptual design, the uncertain information of design parameters are often insufficient. Interval number programming method used for uncertainty analysis is effective for aerodynamic robust optimization for aircraft conceptual design.
Details
Keywords
Janagaraman Radha, Srikrishna Subramanian, Sivarajan Ganesan and Manoharan Abirami
This study aims to minimize operating cost, adhere to pollution norms and maintain reserve and voltage levels subject to various operational concerns, including non linear…
Abstract
Purpose
This study aims to minimize operating cost, adhere to pollution norms and maintain reserve and voltage levels subject to various operational concerns, including non linear characteristics of generators and fuel limitation issues, which are useful for the current power system applications.
Design/methodology/approach
Improved control settings are required while considering multiple conflicting operational objectives that necessitate using the modern bio-inspired algorithm ant lion optimizer (ALO) as the main optimization tool. Fuzzy decision-making mechanism is incorporated in ALO to extract the best compromise solution (BCS) among set of non-dominated solutions.
Findings
The BCS records of IEEE-30 bus and JEAS-118 bus systems are updated in this work. Numerical simulation results comparison and comprehensive performance analysis justify the applicability of the intended algorithm to solve multi-objective dynamic optimal power flow (DOPF) problem over the state-of-art methods.
Originality/value
Optimal control settings are obtained for IEEE-30 and JEAS-118 bus systems with the objectives of minimizing fuel cost and emission in dynamic environment considering take-or-pay fuel contract issue. The fuzzy supported ALO (FSALO) is applied first time to solve the DOPF problem.
Details
Keywords
Mun‐Bo Shim, Myung‐Won Suh, Tomonari Furukawa, Genki Yagawa and Shinobu Yoshimura
In an attempt to solve multiobjective optimization problems, many traditional methods scalarize an objective vector into a single objective by a weight vector. In these cases, the…
Abstract
In an attempt to solve multiobjective optimization problems, many traditional methods scalarize an objective vector into a single objective by a weight vector. In these cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands a user to have knowledge about the underlying problem. Moreover, in solving multiobjective problems, designers may be interested in a set of Pareto‐optimal points, instead of a single point. In this paper, Pareto‐based Continuous Evolutionary Algorithms for Multiobjective Optimization problems having continuous search space are introduced. These algorithms are based on Continuous Evolutionary Algorithms, which were developed by the authors to solve single‐objective optimization problems with a continuous function and continuous search space efficiently. For multiobjective optimization, a progressive reproduction operator and a niche‐formation method for fitness sharing and a storing process for elitism are implemented in the algorithm. The operator and the niche formulation allow the solution set to be distributed widely over the Pareto‐optimal tradeoff surface. Finally, the validity of this method has been demonstrated through some numerical examples.
Details
Keywords
Riccardo Amirante and Paolo Tamburrano
The purpose of this paper is to propose an effective methodology for the industrial design of tangential inlet cyclone separators that is based on the fully three-dimensional (3D…
Abstract
Purpose
The purpose of this paper is to propose an effective methodology for the industrial design of tangential inlet cyclone separators that is based on the fully three-dimensional (3D) simulation of the flow field within the cyclone coupled with an effective genetic algorithm.
Design/methodology/approach
The proposed fully 3D computational fluid dynamics (CFD) model makes use of the Reynold stress model for the accurate prediction of turbulence, while the particle trajectories are simulated using the one-way coupling discrete phase, which is a model particularly effective in case of low concentration of dust. To validate the CFD model, the numerical predictions are compared with experimental data available in the scientific literature. Eight design parameters were chosen, with the two objectives being the minimization of the pressure drop and the maximization of the collection efficiency.
Findings
The optimization procedure allows the determination of the Pareto Front, which represents the set of the best geometries and can be instrumental in taking an optimal decision in the presence of such a trade-off between the two conflicting objectives. The comparison among the individuals belonging to the Pareto Front with a more standard cyclone geometry shows that such a CFD global search is very effective.
Practical implications
The proposed procedure is tested for specific values of the operating conditions; however, it has general validity and can be used in place of typical procedures based on empirical models or engineers’ experience for the industrial design of tangential inlet cyclone separators with low solid loading.
Originality/value
Such an optimization process has never been proposed before for the design of cyclone separators; it has been developed with the aim of being both highly accurate and compatible with the industrial design time.
Details
Keywords
He-Nan Bu, Hong-Gen Zhou, Zhu-Wen Yan and Dian-Hua Zhang
In the process of cold rolled strip, there is tight coupling between flatness control and gauge control. The variation of the roll gap caused by the change of bending force will…
Abstract
Purpose
In the process of cold rolled strip, there is tight coupling between flatness control and gauge control. The variation of the roll gap caused by the change of bending force will lead to the change of rolling force. Furthermore, it can cause a deep impact on the control accuracy of strip exit thickness and exit crown. The purpose of this paper is to improve the accuracy of the bending force preset value for cold rolled strip.
Design/methodology/approach
In this paper, the bending force preset control strategy with considering of rolling force was proposed for the first time and the preset objective function of bending force was established on the basis of the two-objective optimization of bending force and rolling force. Meanwhile, the multi-objective intelligent algorithm – INSGA-II – was used to solve the objective function.
Findings
The proposed bending force multi-objective preset model has been tested in a 1,450 mm tandem cold rolling line. The analyzed results of field data show that the deviations of strip exit thickness and exit crown are reduced effectively by using the improved model, and at the same time, more reasonable bending force preset values are obtained, which can enhance the accuracy of flatness preset control.
Originality/value
A preset model of bending force with considering flatness and gauge is proposed in this paper and the multi-objective function of bending force preset is established on the basis of the two-objective optimization of bending force and rolling force. The value lies in proposing a new decoupling method of rolling force and bending force.
Details
Keywords
Nikos D. Lagaros, Vagelis Plevris and Manolis Papadrakakis
This paper, by taking randomness and uncertainty of structural systems into account aims to implement a combined reliability‐based robust design optimization (RRDO) formulation…
Abstract
Purpose
This paper, by taking randomness and uncertainty of structural systems into account aims to implement a combined reliability‐based robust design optimization (RRDO) formulation. The random variables to be considered include the cross section dimensions, modulus of elasticity, yield stress, and applied loading. The RRDO problem is to be formulated as a multi‐objective optimization problem where the construction cost and the standard deviation of the structural response are the objectives to be minimized.
Design/methodology/approach
The solution of the optimization problem is performed with the non‐dominant cascade evolutionary algorithm with the weighted Tchebycheff metric, while the probabilistic analysis required is carried out with the Monte Carlo simulation method. Despite the computational advances, the solution of a RRDO problem for real‐world structures is extremely computationally demanding and for this reason neurocomputing estimations are implemented.
Findings
The obtained estimates with the neural network predictions are shown to be very satisfactory in terms of accuracy for performing this type of computation. Furthermore, the present numerical results manage to achieve a reduction in computational time up to four orders of magnitude, for low probabilities of violation, compared to the conventional procedure making thus feasible the reliability‐robust design optimization of realistic structures under probabilistic constraints.
Originality/value
The novel parts of the present work include the implementation of neurocomputing strategies in RRDO problems for reducing the computational cost and the comparison of the results given by RRDO and robust design optimization formulations, where the significance of taking into account probabilistic constraints is emphasized.
Details
Keywords
Fowei Wang, Bo Shen, Shaoyuan Sun and Zidong Wang
The purpose of this paper is to improve the accuracy of the facial expression recognition by using genetic algorithm (GA) with an appropriate fitness evaluation function and…
Abstract
Purpose
The purpose of this paper is to improve the accuracy of the facial expression recognition by using genetic algorithm (GA) with an appropriate fitness evaluation function and Pareto optimization model with two new objective functions.
Design/methodology/approach
To achieve facial expression recognition with high accuracy, the Haar-like features representation approach and the bilateral filter are first used to preprocess the facial image. Second, the uniform local Gabor binary patterns are used to extract the facial feature so as to reduce the feature dimension. Third, an improved GA and Pareto optimization approach are used to select the optimal significant features. Fourth, the random forest classifier is chosen to achieve the feature classification. Subsequently, some comparative experiments are implemented. Finally, the conclusion is drawn and some future research topics are pointed out.
Findings
The experiment results show that the proposed facial expression recognition algorithm outperforms ones in the existing literature in terms of both the actuary and computational time.
Originality/value
The GA and Pareto optimization algorithm are combined to select the optimal significant feature. To improve the accuracy of the facial expression recognition, the GA is improved by adjusting an appropriate fitness evaluation function, and a new Pareto optimization model is proposed that contains two objective functions indicating the achievements in minimizing within-class variations and in maximizing between-class variations.
Details
Keywords
Slawomir Koziel and Anna Pietrenko-Dabrowska
This study aims to propose a computationally efficient framework for multi-objective optimization (MO) of antennas involving nested kriging modeling technology. The technique is…
Abstract
Purpose
This study aims to propose a computationally efficient framework for multi-objective optimization (MO) of antennas involving nested kriging modeling technology. The technique is demonstrated through a two-objective optimization of a planar Yagi antenna and three-objective design of a compact wideband antenna.
Design/methodology/approach
The keystone of the proposed approach is the usage of recently introduced nested kriging modeling for identifying the design space region containing the Pareto front and constructing fast surrogate model for the MO algorithm. Surrogate-assisted design refinement is applied to improve the accuracy of Pareto set determination. Consequently, the Pareto set is obtained cost-efficiently, even though the optimization process uses solely high-fidelity electromagnetic (EM) analysis.
Findings
The optimization cost is dramatically reduced for the proposed framework as compared to other state-of-the-art frameworks. The initial Pareto set is identified more precisely (its span is wider and of better quality), which is a result of a considerably smaller domain of the nested kriging model and better predictive power of the surrogate.
Research limitations/implications
The proposed technique can be generalized to accommodate low- and high-fidelity EM simulations in a straightforward manner. The future work will incorporate variable-fidelity simulations to further reduce the cost of the training data acquisition.
Originality/value
The fast MO optimization procedure with the use of the nested kriging modeling technology for approximation of the Pareto set has been proposed and its superiority over state-of-the-art surrogate-assisted procedures has been proved. To the best of the authors’ knowledge, this approach to multi-objective antenna optimization is novel and enables obtaining optimal designs cost-effectively even in relatively high-dimensional spaces (considering typical antenna design setups) within wide parameter ranges.
Details
Keywords
Paolo Di Barba, Maria Evelina Mognaschi, Lidija Petkovska and Goga Vladimir Cvetkovski
This paper aims to deal with the optimal shape design of a class of permanent magnet motors by minimizing multiple objectives according to an original interpretation of Pareto…
Abstract
Purpose
This paper aims to deal with the optimal shape design of a class of permanent magnet motors by minimizing multiple objectives according to an original interpretation of Pareto optimality. The proposed method solves a many-objective problems characterized by five objective functions and five design variables with evolution strategy algorithms, classically used for single- and multi-objective (two objective functions) optimization problems.
Design/methodology/approach
Two approaches are proposed in the paper: the All-Objectives (AO) and the Many-Objectives (MO) optimization approach. The former is based on a single-objective optimization of a preference function, i.e. a normalized weighted sum. In contrast, in the MO a multi-objective optimization algorithm is applied to the minimization of a weight-free preference function and simultaneously to a maximization of the distance of the current solution from the prototype. The optimizations are based on an equivalent circuit model of the Permanent Magnet (PM) motor, but the results are assessed by means of finite element analyses (FEAs).
Findings
An extensive study of the solutions obtained by means of the different optimization approaches is provided by means of post-processing analyses. Both the approaches find non-dominated solutions with respect to the prototype that are substantially improving the initial solution. The points of strength along with the weakness points of each solution with respect to the prototype are analysed in depth.
Practical implications
The paper gives a good guide to the designers of electric motors, focussed on a shape design optimization.
Originality/value
Considering simultaneously five objective functions in an automated optimal design procedure is challenging. The proposed approach, based on a well-known and established optimization algorithm, but exploiting a new concept of degree of conflict, can lead to new results in the field of automated optimal design in a many-objective context.
Details