By replacing the selection component, a well researched evolutionary algorithm for scalar optimizationproblems (SOPs) can be directly used to solve multi-objective optimization problems (MOPs). Therefore, in most of ...
详细信息
By replacing the selection component, a well researched evolutionary algorithm for scalar optimizationproblems (SOPs) can be directly used to solve multi-objective optimization problems (MOPs). Therefore, in most of existing multi-objective evolutionary algorithms (MOEAs), selection and diversity maintenance have attracted a lot of research effort. However, conventional reproduction operators designed for SOPs might not be suitable for MOPs due to the different optima structures between them. At present, few works have been done to improve the searching efficiency of MOEAs according to the characteristic of MOPs. Based on the regularity of continues MOPs, a Baldwinian learning strategy is designed for improving the nondominated neighbor immune algorithm and a multi-objective immune algorithm with Baldwinian learning (MIAB) is proposed in this study. The Baldwinian learning strategy extracts the evolving environment of current population by building a probability distribution model and generates a predictive improving direction by combining the environment information and the evolving history of the parent individual. Experimental results based on ten representative benchmark problems indicate that, MIAB outperforms the original immune algorithm, it performs better or similarly the other two outstanding approached NSGAII and MOEA/D in solution quality on most of the eight testing MOPs. The efficiency of the proposed Baldwinian learning strategy has also been experimentally investigated in this work. (C) 2012 Elsevier B. V. All rights reserved.
Optimizing order-picking systems (OPSs) while considering human factors and integrating key decisions is a major challenge for warehouse managers. This study presents a two-stage framework based on multi-attribute dec...
详细信息
Optimizing order-picking systems (OPSs) while considering human factors and integrating key decisions is a major challenge for warehouse managers. This study presents a two-stage framework based on multi-attribute decision-making (MADM) and multi-objective decision-making (MODM) models to integrate decisions on picker selection, order batching, batch assignment, picker routing, and scheduling. In the first stage, the human factors affecting picker selection are considered as the problem's criteria and the available pickers are treated as alternatives. The fuzzy entropy method and fuzzy COmplex PRoportional ASsessment (COPRAS) are used to weight the factors and rank the pickers, respectively. In the second stage, a three-objective mathematical model is formulated to minimize makespan and the operating costs of picking while maximizing the total scores of the selected pickers. The improved augmented epsilon constraint method (AUGMECON2) and the non-dominated sorting genetic algorithm II (NSGA-II) are applied to solve the proposed model. The performance of the two methods is tested on well-known benchmark instances and a real-world case study. The NSGA-II algorithm can generate optimal results using only about 6.58% of the CPU time required by AUGMECON2 to solve the problem. Our computational experiments show that increasing the number of pickers from 2 to 8 and doubling their capacity reduces the makespan by 2.61% and 2.74%, respectively.
Voice adaptation is an interactive speech processing technique that allows the speaker to transmit with a chosen target voice. We propose a novel method that is intended for dynamic scenarios, such as online video gam...
详细信息
Voice adaptation is an interactive speech processing technique that allows the speaker to transmit with a chosen target voice. We propose a novel method that is intended for dynamic scenarios, such as online video games, where the source speaker's and target speaker's data are nonaligned. This would yield massive improvements to immersion and experience by fully becoming a character, and address privacy concerns to protect against harassment by disguising the voice. With unaligned data, traditional methods, e.g., probabilistic models become inaccurate, while recent methods such as deep neural networks (DNN) require too substantial preparation work. Common methods require multiple subjects to be trained in parallel, which constraints practicality in productive environments. Our proposal trains a subject nonparallel into a voice profile used against any unknown source speaker. Prosodic data such as pitch, power and temporal structure are encoded into RGBA-colored frames used in a multi-objectiveoptimization problem to adjust interrelated features based on color likeness. Finally, frames are smoothed and adjusted before output. The method was evaluated using Mean Opinion Score, ABX, MUSHRA, Single Ease Questions and performance benchmarks using two voice profiles of varying sizes and lastly discussion regarding game implementation. Results show improved adaptation quality, especially in a larger voice profile, and audience is positive about using such technology in future games.
Purpose–The purpose of this paper is to design an improved multi-objective algorithm with better spread and convergence than some current *** proposed application is for engineering design ***/methodology/approach–T...
详细信息
Purpose–The purpose of this paper is to design an improved multi-objective algorithm with better spread and convergence than some current *** proposed application is for engineering design ***/methodology/approach–This study proposes two novel approaches which focus on faster convergence to the Pareto front(PF)while adopting the advantages of Strength Pareto Evolutionary Algorithm-2(SPEA2)for better *** first method,decision variables corresponding to the optima of individual objective functions(Utopia Point)are strategically used to guide the search toward *** second method,boundary points of the PF are calculated and their decision variables are seeded to the initial ***–The proposed methods are tested with a wide range of constrained and unconstrained multi-objective test functions using standard performance *** evaluation demonstrates the superiority of proposed algorithms over well-known existing algorithms(such as NSGA-II and SPEA2)and recent ones such as NSLS and E-NSGA-II in most of the benchmark *** is also tested on an engineering design problem and compared with a currently used *** implications–The algorithms are intended to be used for practical engineering design problems which have many variables and conflicting objectives.A complex example of Welded Beam has been shown at the end of the *** implications–The algorithm would be useful for many design problems and social/industrial problems with conflicting ***/value–This paper presents two novel hybrid algorithms involving SPEA2 based on:local search;and Utopia point directed search *** concept has not been investigated before.
This paper presents a mathematical model of trade-off relations arising in third party logistics using Pareto optimal solutions for multi-objective optimization problems. The model defines an optimal set of distributi...
详细信息
This paper presents a mathematical model of trade-off relations arising in third party logistics using Pareto optimal solutions for multi-objective optimization problems. The model defines an optimal set of distribution costs and service levels constituting a trade-off relation. An analogy to the concept of the indifference curve in the field of economics is discussed. Numerical experiments for a simplified problem are performed, demonstrating an increasing process of the utility of logistics. (C) 2008 Elsevier B.V. All rights reserved.
The single-objective version of stochastic paint optimizer (SPO) is appropriately changed to solve multi-objective optimization problems described as MOSPO. Color theory, the color wheel, and color combination methods...
详细信息
The single-objective version of stochastic paint optimizer (SPO) is appropriately changed to solve multi-objective optimization problems described as MOSPO. Color theory, the color wheel, and color combination methods are the main concepts of SPO. The SPO will be able to do excellent exploration and exploitation thanks to four simple color combination rules that do not have any internal parameters. Principles like using of fixed-sized external archive make the recommended technique various from the initial single-objective SPO. In addition, to perform multi-objectiveoptimization, the leader selection feature has been added to SPO. The efficiency of recommended multi-objective stochastic paint optimizer (MOSPO) is tested on ten mathematical (CEC-09) and eight multi-objective engineering design problems concerning remarkable precision and uniformity compared to multi-objective particle swarm optimization (MOPSO), multi-objective slap swarm algorithm (MSSA), and multi-objective ant lion optimizer. According to the results of different performance metrics, such as generational distance (GD), inverted generational distance (IGD), maximum spread, and spacing, the proposed algorithm can provide quality Pareto fronts with very competitive results with high convergence.
In order to improve the convergence and diversity of multi-objective differential evolutionary algorithm in solving problems, a fuzzy adaptive sorting variation multi-objective differential evolution algorithm is prop...
详细信息
In order to improve the convergence and diversity of multi-objective differential evolutionary algorithm in solving problems, a fuzzy adaptive sorting variation multi-objective differential evolution algorithm is proposed. First of all, using an adaptive fuzzy system by adjusting the parameters of the sorting variation, the balance of local search ability and global exploring ability of the algorithm, at the same time of accelerate the algorithm convergence speed, reduce the possibility of a fall in local optimum;Secondly, using the homogeneous population initialization method, based on the distribution of the algorithm was beginning to get a uniform initial population, improving the stability and diversity;Finally, add a temporary population to store is discarded by individuals, the optimized choice finally, for each generation to improve the population diversity in the process of evolution. Matlab was used to conduct simulation experiments and compared the proposed algorithm with four other multi-target evolutionary algorithms. The experimental results show that the proposed algorithm is superior to several other contrasting algorithms in convergence and diversity, and can effectively approach the frontier of real Pareto. At the same time, the experiment also verifies the validity of fuzzy adaptive sort variation strategy in the proposed algorithm. (c) 2022 Published by Elsevier Ltd. This is an open access article under theCCBY-NC-ND license (http://***/licenses/by-nc-nd/4.0/).
Most multi-objective optimization problems (MOPs) have a set of optimal trade-off solutions known as the Pareto-optimal solutions since the objectives in MOPs are usually in conflict with one another. Recently propose...
详细信息
Most multi-objective optimization problems (MOPs) have a set of optimal trade-off solutions known as the Pareto-optimal solutions since the objectives in MOPs are usually in conflict with one another. Recently proposed estimation of distribution algorithms (EDAs) build a probability distribution model based on the probabilistic information about decision variables of solutions, and then produce new solutions from the model. In the algorithms, the modeling technique enables the initial large search space to be reduced to small promising solution space during the search. However, the existing EDAs might be inefficient at generating the promising solutions since they depend on the information extracted from the decision variables of current solutions expected to approach the optimal solutions. For effective modeling of the promising solutions, we firstly introduce new information about the relationship between decision variables and objective functions;this information is called sensitivity of objective function. Secondly, we propose a multi-objective estimation of distribution algorithm based on the sensitivity of objective function (MOEDA-S). In the MOEDA-S, the sensitivity-based distribution modeling adapts to the current search strategy such that the convergence-focused search at the beginning part of the search is changed to a diversity-focused search at the latter part of the search. MOEDA-S is compared with two other leading multi-objective evolutionary algorithms on a set of test instances. The simulation results show that MOEDA-S outperforms the two compared algorithms in terms of both convergence and diversity performances of the solutions.
Genetic Algorithm is optimization method based on the mechanics of natural genetics and natural selection. Genetic Algorithm mimics the principle of natural genetics and natural selection to constitute search and opti...
详细信息
Genetic Algorithm is optimization method based on the mechanics of natural genetics and natural selection. Genetic Algorithm mimics the principle of natural genetics and natural selection to constitute search and optimization procedures. GA is used for scheduling to find the near to optimum solution in short time. In a genetic algorithm representation is done with variable length of sub-chromosome. GA is developed to generate the optimal order scheduling solution. GA is used as tool in different processes to optimize the process parameters. This paper reviews the genetic algorithms that are designed for solving multiple problems in applications of material science and manufacturing in field of mechanical engineering. Genetic algorithm is a multi-path algorithm that searches many peaks in parallel, hence reducing the possibility of local minimum trapping and solve the multi-objective optimization problems. (C) 2015 Elsevier Ltd. All rights reserved.
This paper presents an algorithm for thermal optimization formulation strategies for multi-heat generation of integrated circuit (IC) on printed circuit board (PCB). Weighted-sum approach for multi-objective genetic a...
详细信息
ISBN:
(纸本)9781424445462
This paper presents an algorithm for thermal optimization formulation strategies for multi-heat generation of integrated circuit (IC) on printed circuit board (PCB). Weighted-sum approach for multi-objective genetic algorithm (WMOGA) with formulated initial placement and multi-constraints parameters (FIPMCP) are presented. FIPMCP is used for the components selection and components to PCB placement mapping procedures for random initial population. The objectives are to optimize thermal distribution f(T) of electronic components on PCB and the PCB area f(A) needed simultaneously. For multi-objectiveoptimization process, non-dominated optimal solutions and the best fitness WMOGA over iterations are plotted for both cases in order to obtain the best PCB optimal design solution. The results show that the best solution of f(T),f(A) and F(T,A) are minimized by 1.80%, 8.54% and 4.97% respectively.
暂无评论