Proportioning is an important part of sintering,as it affects the cost of sintering and the quality of sintered ore.To address the problems posed by the complex raw material information and numerous constraints in the...Proportioning is an important part of sintering,as it affects the cost of sintering and the quality of sintered ore.To address the problems posed by the complex raw material information and numerous constraints in the sintering process,a multi-objective optimisation model for sintering proportioning was established,which takes the proportioning cost and TFe as the optimisation objectives.Additionally,an improved multi-objective beluga whale optimisation(IMOBWO)algorithm was proposed to solve the nonlinear,multi-constrained multi-objective optimisation problems.The algorithm uses the con-strained non-dominance criterion to deal with the constraint problem in the model.Moreover,the algorithm employs an opposite learning strategy and a population guidance mechanism based on angular competition and two-population competition strategy to enhance convergence and population diversity.The actual proportioning of a steel plant indicates that the IMOBWO algorithm applied to the ore proportioning process has good convergence and obtains the uniformly distributed Pareto front.Meanwhile,compared with the actual proportioning scheme,the proportioning cost is reduced by 4.3361¥/t,and the TFe content in the mixture is increased by 0.0367%in the optimal compromise solution.Therefore,the proposed method effectively balances the cost and total iron,facilitating the comprehensive utilisation of sintered iron ore resources while ensuring quality assurance.展开更多
In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However,...In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However, an overly finetuned strategy or technique might overfit some problem types,resulting in a lack of versatility. In this article, we propose a generic search strategy that performs an even search in a promising region. The promising region, determined by obtained feasible non-dominated solutions, possesses two general properties.First, the constrained Pareto front(CPF) is included in the promising region. Second, as the number of feasible solutions increases or the convergence performance(i.e., approximation to the CPF) of these solutions improves, the promising region shrinks. Then we develop a new strategy named even search,which utilizes the non-dominated solutions to accelerate convergence and escape from local optima, and the feasible solutions under a constraint relaxation condition to exploit and detect feasible regions. Finally, a diversity measure is adopted to make sure that the individuals in the population evenly cover the valuable areas in the promising region. Experimental results on 45 instances from four benchmark test suites and 14 real-world CMOPs have demonstrated that searching evenly in the promising region can achieve competitive performance and excellent versatility compared to 11 most state-of-the-art methods tailored for CMOPs.展开更多
In recent years,the path planning for multi-agent technology has gradually matured,and has made breakthrough progress.The main difficulties in path planning for multi-agent are large state space,long algorithm running...In recent years,the path planning for multi-agent technology has gradually matured,and has made breakthrough progress.The main difficulties in path planning for multi-agent are large state space,long algorithm running time,multiple optimization objectives,and asynchronous action of multiple agents.To solve the above problems,this paper first introduces the main problem of the research:multi-objective multi-agent path finding with asynchronous action,and proposes the algorithm framework of multi-objective loose synchronous(MO-LS)search.By combining A*and M*,MO-LS-A*and MO-LS-M*algorithms are respectively proposed.The completeness and optimality of the algorithm are proved,and a series of comparative experiments are designed to analyze the factors affecting the performance of the algorithm,verifying that the proposed MO-LS-M*algorithm has certain advantages.展开更多
With the increasing demand for electrical services,wind farm layout optimization has been one of the biggest challenges that we have to deal with.Despite the promising performance of the heuristic algorithm on the rou...With the increasing demand for electrical services,wind farm layout optimization has been one of the biggest challenges that we have to deal with.Despite the promising performance of the heuristic algorithm on the route network design problem,the expressive capability and search performance of the algorithm on multi-objective problems remain unexplored.In this paper,the wind farm layout optimization problem is defined.Then,a multi-objective algorithm based on Graph Neural Network(GNN)and Variable Neighborhood Search(VNS)algorithm is proposed.GNN provides the basis representations for the following search algorithm so that the expressiveness and search accuracy of the algorithm can be improved.The multi-objective VNS algorithm is put forward by combining it with the multi-objective optimization algorithm to solve the problem with multiple objectives.The proposed algorithm is applied to the 18-node simulation example to evaluate the feasibility and practicality of the developed optimization strategy.The experiment on the simulation example shows that the proposed algorithm yields a reduction of 6.1% in Point of Common Coupling(PCC)over the current state-of-the-art algorithm,which means that the proposed algorithm designs a layout that improves the quality of the power supply by 6.1%at the same cost.The ablation experiments show that the proposed algorithm improves the power quality by more than 8.6% and 7.8% compared to both the original VNS algorithm and the multi-objective VNS algorithm.展开更多
Aircraft engine design is a complicated process,as it involves huge number of components.The design process begins with parametric cycle analysis.It is crucial to determine the optimum values of the cycle parameters t...Aircraft engine design is a complicated process,as it involves huge number of components.The design process begins with parametric cycle analysis.It is crucial to determine the optimum values of the cycle parameters that would give a robust design in the early phase of engine development,to shorten the design cycle for cost saving and man-hour reduction.To obtain a robust solution,optimisation program is often being executed more than once,especially in Reliability Based Design Optimisations(RBDO)with Monte-Carlo Simulation(MCS)scheme for complex systems which require thousands to millions of optimisation loops to be executed.This paper presents a fast heuristic technique to optimise the thermodynamic cycle of two-spool separated flow turbofan engines based on energy and probability of failure criteria based on Luus-Jaakola algorithm(LJ).A computer program called Turbo Jet Engine Optimiser v2.0(TJEO-2.0)has been developed to perform the optimisation calculation.The program is made up of inner and outer loops,where LJ is used in the outer loop to determine the design variables while parametric cycle analysis of the engine is done in the inner loop to determine the engine performance.Latin-Hypercube-Sampling(LHS)technique is used to sample the design and model variations for uncertainty analysis.The results show that optimisation without reliability criteria may lead to high probability of failure of more than 11%on average.The thrust obtained with uncertainty quantification was about 25%higher than the one without uncertainty quantification,at the expense of less than 3%of fuel consumption.The proposed algorithm can solve the turbofan RBDO problem within 3 min.展开更多
For dealing with the multi-objective optimization problems of parametric design for aircraft, a novel hybrid parallel multi-objective tabu search （HPMOTS） algorithm is used. First, a new multi-objective tabu search ...For dealing with the multi-objective optimization problems of parametric design for aircraft, a novel hybrid parallel multi-objective tabu search （HPMOTS） algorithm is used. First, a new multi-objective tabu search （MOTS） algorithm is proposed. Comparing with the traditional MOTS algorithm, this proposed algorithm adds some new methods such as the combination of MOTS algorithm and ＂Pareto solution＂, the strategy of ＂searching from many directions＂ and the reservation of good solutions. Second, this article also proposes the improved parallel multi-objective tabu search （PMOTS） algorithm. Finally, a new hybrid algorithm--HPMOTS algorithm which combines the PMOTS algorithm with the non-dominated sorting-based multi-objective genetic algorithm （NSGA） is presented. The computing results of these algorithms are compared with each other and it is shown that the optimal result can be obtained by the HPMOTS algorithm and the computing result of the PMOTS algorithm is better than that of MOTS algorithm.展开更多
Decomposition of a complex multi-objective optimisation problem(MOP)to multiple simple subMOPs,known as M2M for short,is an effective approach to multi-objective optimisation.However,M2M facilitates little communicati...Decomposition of a complex multi-objective optimisation problem(MOP)to multiple simple subMOPs,known as M2M for short,is an effective approach to multi-objective optimisation.However,M2M facilitates little communication/collaboration between subMOPs,which limits its use in complex optimisation scenarios.This paper extends the M2M framework to develop a unified algorithm for both multi-objective and manyobjective optimisation.Through bilevel decomposition,an MOP is divided into multiple subMOPs at upper level,each of which is further divided into a number of single-objective subproblems at lower level.Neighbouring subMOPs are allowed to share some subproblems so that the knowledge gained from solving one subMOP can be transferred to another,and eventually to all the subMOPs.The bilevel decomposition is readily combined with some new mating selection and population update strategies,leading to a high-performance algorithm that competes effectively against a number of state-of-the-arts studied in this paper for both multiand many-objective optimisation.Parameter analysis and component analysis have been also carried out to further justify the proposed algorithm.展开更多
The recently proposed Cuckoo search algorithm is an evolutionary algorithm based on probability. It surpasses other algorithms in solving the multi-modal discontinuous and nonlinear problems. Searches made by it are v...The recently proposed Cuckoo search algorithm is an evolutionary algorithm based on probability. It surpasses other algorithms in solving the multi-modal discontinuous and nonlinear problems. Searches made by it are very efficient because it adopts Levy flight to carry out random walks. This paper proposes an improved version of cuckoo search for multi-objective problems（IMOCS）. Combined with nondominated sorting, crowding distance and Levy flights, elitism strategy is applied to improve the algorithm. Then numerical studies are conducted to compare the algorithm with DEMO and NSGA-II against some benchmark test functions. Result shows that our improved cuckoo search algorithm convergences rapidly and performs efficienly.展开更多
Shenvi et al.have proposed a quantum algorithm based on quantum walking called Shenvi-Kempe-Whaley(SKW)algorithm,but this search algorithm can only search one target state and use a specific search target state vector...Shenvi et al.have proposed a quantum algorithm based on quantum walking called Shenvi-Kempe-Whaley(SKW)algorithm,but this search algorithm can only search one target state and use a specific search target state vector.Therefore,when there are more than two target nodes in the search space,the algorithm has certain limitations.Even though a multiobjective SKW search algorithm was proposed later,when the number of target nodes is more than two,the SKW search algorithm cannot be mapped to the same quotient graph.In addition,the calculation of the optimal target state depends on the number of target states m.In previous studies,quantum computing and testing algorithms were used to solve this problem.But these solutions require more Oracle calls and cannot get a high accuracy rate.Therefore,to solve the above problems,we improve the multi-target quantum walk search algorithm,and construct a controllable quantum walk search algorithm under the condition of unknown number of target states.By dividing the Hilbert space into multiple subspaces,the accuracy of the search algorithm is improved from p_(c)=(1/2)-O(1/n)to p_(c)=1-O(1/n).And by adding detection gate phase,the algorithm can stop when the amplitude of the target state becomes the maximum for the first time,and the algorithm can always maintain the optimal number of iterations,so as to reduce the number of unnecessary iterations in the algorithm process and make the number of iterations reach t_(f)=(π/2)(?).展开更多
Multi-objective Evolutionary Algorithm (MOEA) is becoming a hot research area and quite a few aspects of MOEAs have been studied and discussed. However there are still few literatures discussing the roles of search an...Multi-objective Evolutionary Algorithm (MOEA) is becoming a hot research area and quite a few aspects of MOEAs have been studied and discussed. However there are still few literatures discussing the roles of search and selection operators in MOEAs. This paper studied their roles by solving a case of discrete Multi-objective Optimization Problem (MOP): Multi-objective TSP with a new MOEA. In the new MOEA, We adopt an efficient search operator, which has the properties of both crossover and mutation, to generate the new individuals and chose two selection operators: Family Competition and Population Competition with probabilities to realize selection. The simulation experiments showed that this new MOEA could get good uniform solutions representing the Pareto Front and outperformed SPEA in almost every simulation run on this problem. Furthermore, we analyzed its convergence property using finite Markov chain and proved that it could converge to Pareto Front with probability 1. We also find that the convergence property of MOEAs has much relationship with search and selection operators.展开更多
Deep neural networks often outperform classical machine learning algorithms in solving real-world problems.However,designing better networks usually requires domain expertise and consumes significant time and com-puti...Deep neural networks often outperform classical machine learning algorithms in solving real-world problems.However,designing better networks usually requires domain expertise and consumes significant time and com-puting resources.Moreover,when the task changes,the original network architecture becomes outdated and requires redesigning.Thus,Neural Architecture Search(NAS)has gained attention as an effective approach to automatically generate optimal network architectures.Most NAS methods mainly focus on achieving high performance while ignoring architectural complexity.A myriad of research has revealed that network performance and structural complexity are often positively correlated.Nevertheless,complex network structures will bring enormous computing resources.To cope with this,we formulate the neural architecture search task as a multi-objective optimization problem,where an optimal architecture is learned by minimizing the classification error rate and the number of network parameters simultaneously.And then a decomposition-based multi-objective stochastic fractal search method is proposed to solve it.In view of the discrete property of the NAS problem,we discretize the stochastic fractal search step size so that the network architecture can be optimized more effectively.Additionally,two distinct update methods are employed in step size update stage to enhance the global and local search abilities adaptively.Furthermore,an information exchange mechanism between architectures is raised to accelerate the convergence process and improve the efficiency of the algorithm.Experimental studies show that the proposed algorithm has competitive performance comparable to many existing manual and automatic deep neural network generation approaches,which achieved a parameter-less and high-precision architecture with low-cost on each of the six benchmark datasets.展开更多
Cloud computing has rapidly evolved into a critical technology,seamlessly integrating into various aspects of daily life.As user demand for cloud services continues to surge,the need for efficient virtualization and r...Cloud computing has rapidly evolved into a critical technology,seamlessly integrating into various aspects of daily life.As user demand for cloud services continues to surge,the need for efficient virtualization and resource management becomes paramount.At the core of this efficiency lies task scheduling,a complex process that determines how tasks are allocated and executed across cloud resources.While extensive research has been conducted in the area of task scheduling,optimizing multiple objectives simultaneously remains a significant challenge due to the NP(Non-deterministic Polynomial)Complete nature of the problem.This study aims to address these challenges by providing a comprehensive review and experimental analysis of task scheduling approaches,with a particular focus on hybrid techniques that offer promising solutions.Utilizing the CloudSim simulation toolkit,we evaluated the performance of three hybrid algorithms:Estimation of Distribution Algorithm-Genetic Algorithm(EDA-GA),Hybrid Genetic Algorithm-Ant Colony Optimization(HGA-ACO),and Improved Discrete Particle Swarm Optimization(IDPSO).Our experimental results demonstrate that these hybrid methods significantly outperform traditional standalone algorithms in reducing Makespan,which is a critical measure of task completion time.Notably,the IDPSO algorithm exhibited superior performance,achieving a Makespan of just 0.64 milliseconds for a set of 150 tasks.These findings underscore the potential of hybrid algorithms to enhance task scheduling efficiency in cloud computing environments.This paper concludes with a discussion of the implications of our findings and offers recommendations for future research aimed at further improving task scheduling strategies,particularly in the context of increasingly complex and dynamic cloud environments.展开更多
This paper introduces a parallel search system for dynamic multi-objective traveling salesman problem. We design a multi-objective TSP in a stochastic dynamic environment. This dynamic setting of the problem is very u...This paper introduces a parallel search system for dynamic multi-objective traveling salesman problem. We design a multi-objective TSP in a stochastic dynamic environment. This dynamic setting of the problem is very useful for routing in ad-hoc networks. The proposed search system first uses parallel processors to identify the extreme solutions of the search space for each ofk objectives individually at the same time. These solutions are merged into the so-called hit-frequency matrix E. The solutions in E are then searched by parallel processors and evaluated for dominance relationship. The search system is implemented in two different ways master-worker architecture and pipeline architecture.展开更多
The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency...The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency. A multi-objective model was presented for the material distribution routing problem in mixed manufacturing systems, and it was solved by a hybrid multi-objective evolutionary algorithm (HMOEA). The characteristics of the HMOEA are as follows: 1) A route pool is employed to preserve the best routes for the population initiation; 2) A specialized best?worst route crossover (BWRC) mode is designed to perform the crossover operators for selecting the best route from Chromosomes 1 to exchange with the worst one in Chromosomes 2, so that the better genes are inherited to the offspring; 3) A route swap mode is used to perform the mutation for improving the convergence speed and preserving the better gene; 4) Local heuristics search methods are applied in this algorithm. Computational study of a practical case shows that the proposed algorithm can decrease the total travel distance by 51.66%, enhance the average vehicle load rate by 37.85%, cut down 15 routes and reduce a deliver vehicle. The convergence speed of HMOEA is faster than that of famous NSGA-II.展开更多
Large-scale multi-objective optimization problems(MOPs)that involve a large number of decision variables,have emerged from many real-world applications.While evolutionary algorithms(EAs)have been widely acknowledged a...Large-scale multi-objective optimization problems(MOPs)that involve a large number of decision variables,have emerged from many real-world applications.While evolutionary algorithms(EAs)have been widely acknowledged as a mainstream method for MOPs,most research progress and successful applications of EAs have been restricted to MOPs with small-scale decision variables.More recently,it has been reported that traditional multi-objective EAs(MOEAs)suffer severe deterioration with the increase of decision variables.As a result,and motivated by the emergence of real-world large-scale MOPs,investigation of MOEAs in this aspect has attracted much more attention in the past decade.This paper reviews the progress of evolutionary computation for large-scale multi-objective optimization from two angles.From the key difficulties of the large-scale MOPs,the scalability analysis is discussed by focusing on the performance of existing MOEAs and the challenges induced by the increase of the number of decision variables.From the perspective of methodology,the large-scale MOEAs are categorized into three classes and introduced respectively:divide and conquer based,dimensionality reduction based and enhanced search-based approaches.Several future research directions are also discussed.展开更多
In this paper, a new hybrid multi-objective evolutionary algorithm （MOEA）, the niched Pareto tabu search combined with a genetic algorithm （NPTSGA）, is proposed for the management of groundwater resources under va...In this paper, a new hybrid multi-objective evolutionary algorithm （MOEA）, the niched Pareto tabu search combined with a genetic algorithm （NPTSGA）, is proposed for the management of groundwater resources under variable density conditions. Relatively few MOEAs can possess global search ability contenting with intensified search in a local area. Moreover, the overall searching ability of tabu search （TS） based MOEAs is very sensitive to the neighborhood step size. The NPTSGA is developed on the thought of integrating the genetic algorithm （GA） with a TS based MOEA, the niched Pareto tabu search （NPTS）, which helps to alleviate both of the above difficulties. Here, the global search ability of the NPTS is improved by the diversification of candidate solutions arising from the evolving genetic algorithm population. Furthermore, the proposed methodology coupled with a density-dependent groundwater flow and solute transport simulator, SEAWAT, is developed and its performance is evaluated through a synthetic seawater intrusion management problem. Optimization results indicate that the NPTSGA offers a tradeoff between the two conflicting objectives. A key conclusion of this study is that the NPTSGA keeps the balance between the intensification of nondomination and the diversification of near Pareto-optimal solutions along the tradeoff curves and is a stable and robust method for implementing the multi-objective design of variable-density groundwater resources.展开更多
In this paper, the modelling and multi-objective optimal control of batch processes, using a recurrent neuro-fuzzy network, are presented. The recurrent neuro-fuzzy network, forms a ＂global＂ nonlinear long-range pre...In this paper, the modelling and multi-objective optimal control of batch processes, using a recurrent neuro-fuzzy network, are presented. The recurrent neuro-fuzzy network, forms a ＂global＂ nonlinear long-range prediction model through the fuzzy conjunction of a number of ＂local＂ linear dynamic models. Network output is fed back to network input through one or more time delay units, which ensure that predictions from the recurrent neuro-fuzzy network are long-range. In building a recurrent neural network model, process knowledge is used initially to partition the processes non-linear characteristics into several local operating regions, and to aid in the initialisation of corresponding network weights. Process operational data is then used to train the network. Membership functions of the local regimes are identified, and local models are discovered via network training. Based on a recurrent neuro-fuzzy network model, a multi-objective optimal control policy can be obtained. The proposed technique is applied to a fed-batch reactor.展开更多
The study of training hyperparameters optimisation problems remains underexplored in skin lesion research.This is the first report of using hierarchical optimisation to improve computational effort in a four-dimension...The study of training hyperparameters optimisation problems remains underexplored in skin lesion research.This is the first report of using hierarchical optimisation to improve computational effort in a four-dimensional search space for the problem.The authors explore training parameters selection in optimising the learning process of a model to differentiate pigmented lesions characteristics.In the authors'demonstration,pretrained GoogleNet is fine-tuned with a full training set by varying hyperparameters,namely epoch,mini-batch value,initial learning rate,and gradient threshold.The iterative search of the optimal global-local solution is by using the derivative-based method.The authors used non-parametric one-way ANOVA to test whether the classification accuracies differed for the variation in the training parameters.The authors identified the mini-batch size and initial learning rate as parameters that significantly influence the model's learning capability.The authors'results showed that a small fraction of combinations(5%)from constrained global search space,in contrarily to 82%at the local level,can converge with early stopping conditions.The mean(standard deviation,SD)validation accuracies increased from 78.4(4.44)%to 82.9(1.8)%using the authors'system.The fine-tuned model's performance measures evaluated on a testing dataset showed classification accuracy,precision,sensitivity,and specificity of 85.3%,75.6%,64.4%,and 97.2%,respectively.The authors'system achieves an overall better diagnosis performance than four state-of-the-art approaches via an improved search of parameters for a good adaptation of the model to the authors'dataset.The extended experiments also showed its superior performance consistency across different deep networks,where the overall classification accuracy increased by 5%with this technique.This approach reduces the risk of search being trapped in a suboptimal solution,and its use may be expanded to network architecture optimisation for enhanced diagnostic performance.展开更多
The halbach permanent magnet synchronous motor(HPMSM)combines the advantages of permanent magnet motors and halbach arrays,which make it very suitable to act as a robot joint motor,and it can also be used in other fie...The halbach permanent magnet synchronous motor(HPMSM)combines the advantages of permanent magnet motors and halbach arrays,which make it very suitable to act as a robot joint motor,and it can also be used in other fields,such as electric vehicles,wind power generation,etc.At first,the sizing equation is derived and the initial design dimensions are calculated for the HPMSM with the rated power of 275W,based on which the finite element parametric model of the motor is built up and the key structural parameters that affect the total harmonic distortion of air-gap flux density and output torque are determined by analyzing multi-objective sensitivity.Then the structure parameters are optimized by using the cuckoo search algorithm.Last,in view of the problem of local overheating of the motor,an improved stator slot structure is proposed and researched.Under the condition of the same outer dimensions,the electromagnetic performance of the HPMSM before and after the improvement are analyzed and compared by the finite element method.It is found that the improved HPMSM can obtain better performances.展开更多
基金supported by the National Key Research and Development Program of China (2022YFB3304700)Hunan Province Natural Science Foundation (2022JJ50132,2022JCYJ05 and 2022JCYJ09).
文摘Proportioning is an important part of sintering,as it affects the cost of sintering and the quality of sintered ore.To address the problems posed by the complex raw material information and numerous constraints in the sintering process,a multi-objective optimisation model for sintering proportioning was established,which takes the proportioning cost and TFe as the optimisation objectives.Additionally,an improved multi-objective beluga whale optimisation(IMOBWO)algorithm was proposed to solve the nonlinear,multi-constrained multi-objective optimisation problems.The algorithm uses the con-strained non-dominance criterion to deal with the constraint problem in the model.Moreover,the algorithm employs an opposite learning strategy and a population guidance mechanism based on angular competition and two-population competition strategy to enhance convergence and population diversity.The actual proportioning of a steel plant indicates that the IMOBWO algorithm applied to the ore proportioning process has good convergence and obtains the uniformly distributed Pareto front.Meanwhile,compared with the actual proportioning scheme,the proportioning cost is reduced by 4.3361¥/t,and the TFe content in the mixture is increased by 0.0367%in the optimal compromise solution.Therefore,the proposed method effectively balances the cost and total iron,facilitating the comprehensive utilisation of sintered iron ore resources while ensuring quality assurance.
基金partly supported by the National Natural Science Foundation of China(62076225)。
文摘In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However, an overly finetuned strategy or technique might overfit some problem types,resulting in a lack of versatility. In this article, we propose a generic search strategy that performs an even search in a promising region. The promising region, determined by obtained feasible non-dominated solutions, possesses two general properties.First, the constrained Pareto front(CPF) is included in the promising region. Second, as the number of feasible solutions increases or the convergence performance(i.e., approximation to the CPF) of these solutions improves, the promising region shrinks. Then we develop a new strategy named even search,which utilizes the non-dominated solutions to accelerate convergence and escape from local optima, and the feasible solutions under a constraint relaxation condition to exploit and detect feasible regions. Finally, a diversity measure is adopted to make sure that the individuals in the population evenly cover the valuable areas in the promising region. Experimental results on 45 instances from four benchmark test suites and 14 real-world CMOPs have demonstrated that searching evenly in the promising region can achieve competitive performance and excellent versatility compared to 11 most state-of-the-art methods tailored for CMOPs.
基金Aeronautical Science Foundation of China(No.20220001057001)。
文摘In recent years,the path planning for multi-agent technology has gradually matured,and has made breakthrough progress.The main difficulties in path planning for multi-agent are large state space,long algorithm running time,multiple optimization objectives,and asynchronous action of multiple agents.To solve the above problems,this paper first introduces the main problem of the research:multi-objective multi-agent path finding with asynchronous action,and proposes the algorithm framework of multi-objective loose synchronous(MO-LS)search.By combining A*and M*,MO-LS-A*and MO-LS-M*algorithms are respectively proposed.The completeness and optimality of the algorithm are proved,and a series of comparative experiments are designed to analyze the factors affecting the performance of the algorithm,verifying that the proposed MO-LS-M*algorithm has certain advantages.
基金supported by the Natural Science Foundation of Zhejiang Province(LY19A020001).
文摘With the increasing demand for electrical services,wind farm layout optimization has been one of the biggest challenges that we have to deal with.Despite the promising performance of the heuristic algorithm on the route network design problem,the expressive capability and search performance of the algorithm on multi-objective problems remain unexplored.In this paper,the wind farm layout optimization problem is defined.Then,a multi-objective algorithm based on Graph Neural Network(GNN)and Variable Neighborhood Search(VNS)algorithm is proposed.GNN provides the basis representations for the following search algorithm so that the expressiveness and search accuracy of the algorithm can be improved.The multi-objective VNS algorithm is put forward by combining it with the multi-objective optimization algorithm to solve the problem with multiple objectives.The proposed algorithm is applied to the 18-node simulation example to evaluate the feasibility and practicality of the developed optimization strategy.The experiment on the simulation example shows that the proposed algorithm yields a reduction of 6.1% in Point of Common Coupling(PCC)over the current state-of-the-art algorithm,which means that the proposed algorithm designs a layout that improves the quality of the power supply by 6.1%at the same cost.The ablation experiments show that the proposed algorithm improves the power quality by more than 8.6% and 7.8% compared to both the original VNS algorithm and the multi-objective VNS algorithm.
基金The project is funded by the Ministry of Higher Education Malaysia,under the Fundamental Research Grant Scheme(FRGS Grant No.FRGS/1/2017/TK07/SEGI/02/1).
文摘Aircraft engine design is a complicated process,as it involves huge number of components.The design process begins with parametric cycle analysis.It is crucial to determine the optimum values of the cycle parameters that would give a robust design in the early phase of engine development,to shorten the design cycle for cost saving and man-hour reduction.To obtain a robust solution,optimisation program is often being executed more than once,especially in Reliability Based Design Optimisations(RBDO)with Monte-Carlo Simulation(MCS)scheme for complex systems which require thousands to millions of optimisation loops to be executed.This paper presents a fast heuristic technique to optimise the thermodynamic cycle of two-spool separated flow turbofan engines based on energy and probability of failure criteria based on Luus-Jaakola algorithm(LJ).A computer program called Turbo Jet Engine Optimiser v2.0(TJEO-2.0)has been developed to perform the optimisation calculation.The program is made up of inner and outer loops,where LJ is used in the outer loop to determine the design variables while parametric cycle analysis of the engine is done in the inner loop to determine the engine performance.Latin-Hypercube-Sampling(LHS)technique is used to sample the design and model variations for uncertainty analysis.The results show that optimisation without reliability criteria may lead to high probability of failure of more than 11%on average.The thrust obtained with uncertainty quantification was about 25%higher than the one without uncertainty quantification,at the expense of less than 3%of fuel consumption.The proposed algorithm can solve the turbofan RBDO problem within 3 min.
基金National Science Fund for Distinguished Young Scholars (10425208)Programme of Introducing Talents of Discipline to Universities (B07009)
文摘For dealing with the multi-objective optimization problems of parametric design for aircraft, a novel hybrid parallel multi-objective tabu search （HPMOTS） algorithm is used. First, a new multi-objective tabu search （MOTS） algorithm is proposed. Comparing with the traditional MOTS algorithm, this proposed algorithm adds some new methods such as the combination of MOTS algorithm and ＂Pareto solution＂, the strategy of ＂searching from many directions＂ and the reservation of good solutions. Second, this article also proposes the improved parallel multi-objective tabu search （PMOTS） algorithm. Finally, a new hybrid algorithm--HPMOTS algorithm which combines the PMOTS algorithm with the non-dominated sorting-based multi-objective genetic algorithm （NSGA） is presented. The computing results of these algorithms are compared with each other and it is shown that the optimal result can be obtained by the HPMOTS algorithm and the computing result of the PMOTS algorithm is better than that of MOTS algorithm.
基金supported in part by the National Natural Science Foundation of China (62376288,U23A20347)the Engineering and Physical Sciences Research Council of UK (EP/X041239/1)the Royal Society International Exchanges Scheme of UK (IEC/NSFC/211404)。
文摘Decomposition of a complex multi-objective optimisation problem(MOP)to multiple simple subMOPs,known as M2M for short,is an effective approach to multi-objective optimisation.However,M2M facilitates little communication/collaboration between subMOPs,which limits its use in complex optimisation scenarios.This paper extends the M2M framework to develop a unified algorithm for both multi-objective and manyobjective optimisation.Through bilevel decomposition,an MOP is divided into multiple subMOPs at upper level,each of which is further divided into a number of single-objective subproblems at lower level.Neighbouring subMOPs are allowed to share some subproblems so that the knowledge gained from solving one subMOP can be transferred to another,and eventually to all the subMOPs.The bilevel decomposition is readily combined with some new mating selection and population update strategies,leading to a high-performance algorithm that competes effectively against a number of state-of-the-arts studied in this paper for both multiand many-objective optimisation.Parameter analysis and component analysis have been also carried out to further justify the proposed algorithm.
基金Supported by the National Natural Science Foundation of China(71471140)
文摘The recently proposed Cuckoo search algorithm is an evolutionary algorithm based on probability. It surpasses other algorithms in solving the multi-modal discontinuous and nonlinear problems. Searches made by it are very efficient because it adopts Levy flight to carry out random walks. This paper proposes an improved version of cuckoo search for multi-objective problems（IMOCS）. Combined with nondominated sorting, crowding distance and Levy flights, elitism strategy is applied to improve the algorithm. Then numerical studies are conducted to compare the algorithm with DEMO and NSGA-II against some benchmark test functions. Result shows that our improved cuckoo search algorithm convergences rapidly and performs efficienly.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11975132 and 61772295)the Natural Science Foundation of Shandong Province,China(Grant No.ZR2019YQ01)the Project of Shandong Provincial Higher Educational Science and Technology Program,China(Grant No.J18KZ012)。
文摘Shenvi et al.have proposed a quantum algorithm based on quantum walking called Shenvi-Kempe-Whaley(SKW)algorithm,but this search algorithm can only search one target state and use a specific search target state vector.Therefore,when there are more than two target nodes in the search space,the algorithm has certain limitations.Even though a multiobjective SKW search algorithm was proposed later,when the number of target nodes is more than two,the SKW search algorithm cannot be mapped to the same quotient graph.In addition,the calculation of the optimal target state depends on the number of target states m.In previous studies,quantum computing and testing algorithms were used to solve this problem.But these solutions require more Oracle calls and cannot get a high accuracy rate.Therefore,to solve the above problems,we improve the multi-target quantum walk search algorithm,and construct a controllable quantum walk search algorithm under the condition of unknown number of target states.By dividing the Hilbert space into multiple subspaces,the accuracy of the search algorithm is improved from p_(c)=(1/2)-O(1/n)to p_(c)=1-O(1/n).And by adding detection gate phase,the algorithm can stop when the amplitude of the target state becomes the maximum for the first time,and the algorithm can always maintain the optimal number of iterations,so as to reduce the number of unnecessary iterations in the algorithm process and make the number of iterations reach t_(f)=(π/2)(?).
基金Supported by the National Natural Science Foundation of China(60133010,70071042,60073043)
文摘Multi-objective Evolutionary Algorithm (MOEA) is becoming a hot research area and quite a few aspects of MOEAs have been studied and discussed. However there are still few literatures discussing the roles of search and selection operators in MOEAs. This paper studied their roles by solving a case of discrete Multi-objective Optimization Problem (MOP): Multi-objective TSP with a new MOEA. In the new MOEA, We adopt an efficient search operator, which has the properties of both crossover and mutation, to generate the new individuals and chose two selection operators: Family Competition and Population Competition with probabilities to realize selection. The simulation experiments showed that this new MOEA could get good uniform solutions representing the Pareto Front and outperformed SPEA in almost every simulation run on this problem. Furthermore, we analyzed its convergence property using finite Markov chain and proved that it could converge to Pareto Front with probability 1. We also find that the convergence property of MOEAs has much relationship with search and selection operators.
基金supported by the China Postdoctoral Science Foundation Funded Project(Grant Nos.2017M613054 and 2017M613053)the Shaanxi Postdoctoral Science Foundation Funded Project(Grant No.2017BSHYDZZ33)the National Science Foundation of China(Grant No.62102239).
文摘Deep neural networks often outperform classical machine learning algorithms in solving real-world problems.However,designing better networks usually requires domain expertise and consumes significant time and com-puting resources.Moreover,when the task changes,the original network architecture becomes outdated and requires redesigning.Thus,Neural Architecture Search(NAS)has gained attention as an effective approach to automatically generate optimal network architectures.Most NAS methods mainly focus on achieving high performance while ignoring architectural complexity.A myriad of research has revealed that network performance and structural complexity are often positively correlated.Nevertheless,complex network structures will bring enormous computing resources.To cope with this,we formulate the neural architecture search task as a multi-objective optimization problem,where an optimal architecture is learned by minimizing the classification error rate and the number of network parameters simultaneously.And then a decomposition-based multi-objective stochastic fractal search method is proposed to solve it.In view of the discrete property of the NAS problem,we discretize the stochastic fractal search step size so that the network architecture can be optimized more effectively.Additionally,two distinct update methods are employed in step size update stage to enhance the global and local search abilities adaptively.Furthermore,an information exchange mechanism between architectures is raised to accelerate the convergence process and improve the efficiency of the algorithm.Experimental studies show that the proposed algorithm has competitive performance comparable to many existing manual and automatic deep neural network generation approaches,which achieved a parameter-less and high-precision architecture with low-cost on each of the six benchmark datasets.
文摘Cloud computing has rapidly evolved into a critical technology,seamlessly integrating into various aspects of daily life.As user demand for cloud services continues to surge,the need for efficient virtualization and resource management becomes paramount.At the core of this efficiency lies task scheduling,a complex process that determines how tasks are allocated and executed across cloud resources.While extensive research has been conducted in the area of task scheduling,optimizing multiple objectives simultaneously remains a significant challenge due to the NP(Non-deterministic Polynomial)Complete nature of the problem.This study aims to address these challenges by providing a comprehensive review and experimental analysis of task scheduling approaches,with a particular focus on hybrid techniques that offer promising solutions.Utilizing the CloudSim simulation toolkit,we evaluated the performance of three hybrid algorithms:Estimation of Distribution Algorithm-Genetic Algorithm(EDA-GA),Hybrid Genetic Algorithm-Ant Colony Optimization(HGA-ACO),and Improved Discrete Particle Swarm Optimization(IDPSO).Our experimental results demonstrate that these hybrid methods significantly outperform traditional standalone algorithms in reducing Makespan,which is a critical measure of task completion time.Notably,the IDPSO algorithm exhibited superior performance,achieving a Makespan of just 0.64 milliseconds for a set of 150 tasks.These findings underscore the potential of hybrid algorithms to enhance task scheduling efficiency in cloud computing environments.This paper concludes with a discussion of the implications of our findings and offers recommendations for future research aimed at further improving task scheduling strategies,particularly in the context of increasingly complex and dynamic cloud environments.
文摘This paper introduces a parallel search system for dynamic multi-objective traveling salesman problem. We design a multi-objective TSP in a stochastic dynamic environment. This dynamic setting of the problem is very useful for routing in ad-hoc networks. The proposed search system first uses parallel processors to identify the extreme solutions of the search space for each ofk objectives individually at the same time. These solutions are merged into the so-called hit-frequency matrix E. The solutions in E are then searched by parallel processors and evaluated for dominance relationship. The search system is implemented in two different ways master-worker architecture and pipeline architecture.
基金Project(50775089)supported by the National Natural Science Foundation of ChinaProject(2007AA04Z190,2009AA043301)supported by the National High Technology Research and Development Program of ChinaProject(2005CB724100)supported by the National Basic Research Program of China
文摘The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency. A multi-objective model was presented for the material distribution routing problem in mixed manufacturing systems, and it was solved by a hybrid multi-objective evolutionary algorithm (HMOEA). The characteristics of the HMOEA are as follows: 1) A route pool is employed to preserve the best routes for the population initiation; 2) A specialized best?worst route crossover (BWRC) mode is designed to perform the crossover operators for selecting the best route from Chromosomes 1 to exchange with the worst one in Chromosomes 2, so that the better genes are inherited to the offspring; 3) A route swap mode is used to perform the mutation for improving the convergence speed and preserving the better gene; 4) Local heuristics search methods are applied in this algorithm. Computational study of a practical case shows that the proposed algorithm can decrease the total travel distance by 51.66%, enhance the average vehicle load rate by 37.85%, cut down 15 routes and reduce a deliver vehicle. The convergence speed of HMOEA is faster than that of famous NSGA-II.
基金This work was supported by the Natural Science Foundation of China(Nos.61672478 and 61806090)the National Key Research and Development Program of China(No.2017YFB1003102)+4 种基金the Guangdong Provincial Key Laboratory(No.2020B121201001)the Shenzhen Peacock Plan(No.KQTD2016112514355531)the Guangdong-Hong Kong-Macao Greater Bay Area Center for Brain Science and Brain-inspired Intelligence Fund(No.2019028)the Fellowship of China Postdoctoral Science Foundation(No.2020M671900)the National Leading Youth Talent Support Program of China.
文摘Large-scale multi-objective optimization problems(MOPs)that involve a large number of decision variables,have emerged from many real-world applications.While evolutionary algorithms(EAs)have been widely acknowledged as a mainstream method for MOPs,most research progress and successful applications of EAs have been restricted to MOPs with small-scale decision variables.More recently,it has been reported that traditional multi-objective EAs(MOEAs)suffer severe deterioration with the increase of decision variables.As a result,and motivated by the emergence of real-world large-scale MOPs,investigation of MOEAs in this aspect has attracted much more attention in the past decade.This paper reviews the progress of evolutionary computation for large-scale multi-objective optimization from two angles.From the key difficulties of the large-scale MOPs,the scalability analysis is discussed by focusing on the performance of existing MOEAs and the challenges induced by the increase of the number of decision variables.From the perspective of methodology,the large-scale MOEAs are categorized into three classes and introduced respectively:divide and conquer based,dimensionality reduction based and enhanced search-based approaches.Several future research directions are also discussed.
基金funded by the National Basic Research Program of China(the 973 Program,No.2010CB428803)the National Natural Science Foundation of China(Nos.41072175,40902069 and 40725010)
文摘In this paper, a new hybrid multi-objective evolutionary algorithm （MOEA）, the niched Pareto tabu search combined with a genetic algorithm （NPTSGA）, is proposed for the management of groundwater resources under variable density conditions. Relatively few MOEAs can possess global search ability contenting with intensified search in a local area. Moreover, the overall searching ability of tabu search （TS） based MOEAs is very sensitive to the neighborhood step size. The NPTSGA is developed on the thought of integrating the genetic algorithm （GA） with a TS based MOEA, the niched Pareto tabu search （NPTS）, which helps to alleviate both of the above difficulties. Here, the global search ability of the NPTS is improved by the diversification of candidate solutions arising from the evolving genetic algorithm population. Furthermore, the proposed methodology coupled with a density-dependent groundwater flow and solute transport simulator, SEAWAT, is developed and its performance is evaluated through a synthetic seawater intrusion management problem. Optimization results indicate that the NPTSGA offers a tradeoff between the two conflicting objectives. A key conclusion of this study is that the NPTSGA keeps the balance between the intensification of nondomination and the diversification of near Pareto-optimal solutions along the tradeoff curves and is a stable and robust method for implementing the multi-objective design of variable-density groundwater resources.
基金This work was supported by the UK EPSRC (GR/N13319, GR/R10875).
文摘In this paper, the modelling and multi-objective optimal control of batch processes, using a recurrent neuro-fuzzy network, are presented. The recurrent neuro-fuzzy network, forms a ＂global＂ nonlinear long-range prediction model through the fuzzy conjunction of a number of ＂local＂ linear dynamic models. Network output is fed back to network input through one or more time delay units, which ensure that predictions from the recurrent neuro-fuzzy network are long-range. In building a recurrent neural network model, process knowledge is used initially to partition the processes non-linear characteristics into several local operating regions, and to aid in the initialisation of corresponding network weights. Process operational data is then used to train the network. Membership functions of the local regimes are identified, and local models are discovered via network training. Based on a recurrent neuro-fuzzy network model, a multi-objective optimal control policy can be obtained. The proposed technique is applied to a fed-batch reactor.
基金Number:FRGS/1/2020/TK0/UTHM/02/27Universiti Tun Hussein Onn Malaysia,Grant/Award Number:H766。
文摘The study of training hyperparameters optimisation problems remains underexplored in skin lesion research.This is the first report of using hierarchical optimisation to improve computational effort in a four-dimensional search space for the problem.The authors explore training parameters selection in optimising the learning process of a model to differentiate pigmented lesions characteristics.In the authors'demonstration,pretrained GoogleNet is fine-tuned with a full training set by varying hyperparameters,namely epoch,mini-batch value,initial learning rate,and gradient threshold.The iterative search of the optimal global-local solution is by using the derivative-based method.The authors used non-parametric one-way ANOVA to test whether the classification accuracies differed for the variation in the training parameters.The authors identified the mini-batch size and initial learning rate as parameters that significantly influence the model's learning capability.The authors'results showed that a small fraction of combinations(5%)from constrained global search space,in contrarily to 82%at the local level,can converge with early stopping conditions.The mean(standard deviation,SD)validation accuracies increased from 78.4(4.44)%to 82.9(1.8)%using the authors'system.The fine-tuned model's performance measures evaluated on a testing dataset showed classification accuracy,precision,sensitivity,and specificity of 85.3%,75.6%,64.4%,and 97.2%,respectively.The authors'system achieves an overall better diagnosis performance than four state-of-the-art approaches via an improved search of parameters for a good adaptation of the model to the authors'dataset.The extended experiments also showed its superior performance consistency across different deep networks,where the overall classification accuracy increased by 5%with this technique.This approach reduces the risk of search being trapped in a suboptimal solution,and its use may be expanded to network architecture optimisation for enhanced diagnostic performance.
基金This work was supported by the National Natural Science Foundation of China(51507087)the Six Talents Summit Project of Jiangsu Province(XNYQC-017)the Science and Technology Planning Project of Nantong City(MS22019017).
文摘The halbach permanent magnet synchronous motor(HPMSM)combines the advantages of permanent magnet motors and halbach arrays,which make it very suitable to act as a robot joint motor,and it can also be used in other fields,such as electric vehicles,wind power generation,etc.At first,the sizing equation is derived and the initial design dimensions are calculated for the HPMSM with the rated power of 275W,based on which the finite element parametric model of the motor is built up and the key structural parameters that affect the total harmonic distortion of air-gap flux density and output torque are determined by analyzing multi-objective sensitivity.Then the structure parameters are optimized by using the cuckoo search algorithm.Last,in view of the problem of local overheating of the motor,an improved stator slot structure is proposed and researched.Under the condition of the same outer dimensions,the electromagnetic performance of the HPMSM before and after the improvement are analyzed and compared by the finite element method.It is found that the improved HPMSM can obtain better performances.
基金the National Natural Science Foundation of China(Nos.61202085,61300019)the Ningxia Hui Autonomous Region Natural Science Foundation(No.NZ13265)the Special Fund for Fundamental Research of Central Universities of Northeastern University(Nos.N120804001,N120204003)
