In recent years,decomposition-based evolutionary algorithms have become popular algorithms for solving multi-objective problems in real-life scenarios.In these algorithms,the reference vectors of the Penalty-Based bou...In recent years,decomposition-based evolutionary algorithms have become popular algorithms for solving multi-objective problems in real-life scenarios.In these algorithms,the reference vectors of the Penalty-Based boundary intersection(PBI)are distributed parallelly while those based on the normal boundary intersection(NBI)are distributed radially in a conical shape in the objective space.To improve the problem-solving effectiveness of multi-objective optimization algorithms in engineering applications,this paper addresses the improvement of the Collaborative Decomposition(CoD)method,a multi-objective decomposition technique that integrates PBI and NBI,and combines it with the Elephant Clan Optimization Algorithm,introducing the Collaborative Decomposition Multi-objective Improved Elephant Clan Optimization Algorithm(CoDMOIECO).Specifically,a novel subpopulation construction method with adaptive changes following the number of iterations and a novel individual merit ranking based onNBI and angle are proposed.,enabling the creation of subpopulations closely linked to weight vectors and the identification of diverse individuals within them.Additionally,new update strategies for the clan leader,male elephants,and juvenile elephants are introduced to boost individual exploitation capabilities and further enhance the algorithm’s convergence.Finally,a new CoD-based environmental selection method is proposed,introducing adaptive dynamically adjusted angle coefficients and individual angles on corresponding weight vectors,significantly improving both the convergence and distribution of the algorithm.Experimental comparisons on the ZDT,DTLZ,and WFG function sets with four benchmark multi-objective algorithms—MOEA/D,CAMOEA,VaEA,and MOEA/D-UR—demonstrate that CoDMOIECO achieves superior performance in both convergence and distribution.展开更多
Tourism route planning is widely applied in the smart tourism field.The Pareto-optimal front obtained by the traditional multi-objective evolutionary algorithm exhibits long tails,sharp peaks and disconnected regions ...Tourism route planning is widely applied in the smart tourism field.The Pareto-optimal front obtained by the traditional multi-objective evolutionary algorithm exhibits long tails,sharp peaks and disconnected regions problems,which leads to uneven distribution and weak diversity of optimization solutions of tourism routes.Inspired by these limitations,we propose a multi-objective evolutionary algorithm for tourism route recommendation(MOTRR)with two-stage and Pareto layering based on decomposition.The method decomposes the multiobjective problem into several subproblems,and improves the distribution of solutions through a two-stage method.The crowding degree mechanism between extreme and intermediate populations is used in the two-stage method.The neighborhood is determined according to the weight of the subproblem for crossover mutation.Finally,Pareto layering is used to improve the updating efficiency and population diversity of the solution.The two-stage method is combined with the Pareto layering structure,which not only maintains the distribution and diversity of the algorithm,but also avoids the same solutions.Compared with several classical benchmark algorithms,the experimental results demonstrate competitive advantages on five test functions,hypervolume(HV)and inverted generational distance(IGD)metrics.Using the experimental results of real scenic spot datasets from two famous tourism social networking sites with vast amounts of users and large-scale online comments in Beijing,our proposed algorithm shows better distribution.It proves that the tourism routes recommended by our proposed algorithm have better distribution and diversity,so that the recommended routes can better meet the personalized needs of tourists.展开更多
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.展开更多
To address issues such as poor initial population diversity, low stability and local convergence accuracy, and easy local optima in the traditional Multi-Objective Artificial Hummingbird Algorithm (MOAHA), an Improved...To address issues such as poor initial population diversity, low stability and local convergence accuracy, and easy local optima in the traditional Multi-Objective Artificial Hummingbird Algorithm (MOAHA), an Improved MOAHA (IMOAHA) was proposed. The improvements involve Tent mapping based on random variables to initialize the population, a logarithmic decrease strategy for inertia weight to balance search capability, and the improved search operators in the territory foraging phase to enhance the ability to escape from local optima and increase convergence accuracy. The effectiveness of IMOAHA was verified through Matlab/Simulink. The results demonstrate that IMOAHA exhibits superior convergence, diversity, uniformity, and coverage of solutions across 6 test functions, outperforming 4 comparative algorithms. A Wilcoxon rank-sum test further confirmed its exceptional performance. To assess IMOAHA’s ability to solve engineering problems, an optimization model for a multi-track, multi-train urban rail traction power supply system with Supercapacitor Energy Storage Systems (SCESSs) was established, and IMOAHA was successfully applied to solving the capacity allocation problem of SCESSs, demonstrating that it is an effective tool for solving complex Multi-Objective Optimization Problems (MOOPs) in engineering domains.展开更多
The operation variables,including feed rate of ore slurry,caustic solution and live steams in the double-stream alumina digestion process,determine the product quality,process costs and the environment pollution.Previ...The operation variables,including feed rate of ore slurry,caustic solution and live steams in the double-stream alumina digestion process,determine the product quality,process costs and the environment pollution.Previously,they were set by the technical workers according to the offline analysis results and an empirical formula,which leads to unstable process indices and high consumption frequently.So,a multi-objective optimization model is built to maintain the balance between resource consumptions and process indices by taking technical indices and energy efficiency as objectives,where the key technical indices are predicted based on the digestion kinetics of diaspore.A multi-objective state transition algorithm(MOSTA)is improved to solve the problem,in which a self-adaptive strategy is applied to dynamically adjust the operator factors of the MOSTA and dynamic infeasible threshold is used to handle constraints to enhance searching efficiency and ability of the algorithm.Then a rule based strategy is designed to make the final decision from the Pareto frontiers.The method is integrated into an optimal control system for the industrial digestion process and tested in the actual production.Results show that the proposed method can achieve the technical target while reducing the energy consumption.展开更多
In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop pro...In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.展开更多
The seismic reliability evaluation of lifeline networks has received considerable attention and been widely studied. In this paper, on the basis of an original recursive decomposition algorithm, an improved analytical...The seismic reliability evaluation of lifeline networks has received considerable attention and been widely studied. In this paper, on the basis of an original recursive decomposition algorithm, an improved analytical approach to evaluate the seismic reliability of large lifeline systems is presented. The proposed algorithm takes the shortest path from the source to the sink of a network as decomposition policy. Using the Boolean laws of set operation and the probabilistic operation principal, a recursive decomposition process is constructed in which the disjoint minimal path set and the disjoint minimal cut set are simultaneously enumerated. As the result, a probabilistic inequality can be used to provide results that satisfy a prescribed error bound. During the decomposition process, different from the original recursive decomposition algorithm which only removes edges to simplify the network, the proposed algorithm simplifies the network by merging nodes into sources and removing edges. As a result, the proposed algorithm can obtain simpler networks. Moreover, for a network owning s-independent components in its component set, two network reduction techniques are introduced to speed up the proposed algorithm. A series of case studies, including an actual water distribution network and a large urban gas system, are calculated using the proposed algorithm. The results indicate that the proposed algorithm provides a useful probabilistic analysis method for the seismic reliability evaluation of lifeline networks.展开更多
A multi-objective optimization model for draft scheduling of hot strip mill was presented, rolling power minimizing, rolling force ratio distribution and good strip shape as the objective functions. A multi-objective ...A multi-objective optimization model for draft scheduling of hot strip mill was presented, rolling power minimizing, rolling force ratio distribution and good strip shape as the objective functions. A multi-objective differential evolution algorithm based on decomposition （MODE/D）. The two-objective and three-objective optimization experiments were performed respectively to demonstrate the optimal solutions of trade-off. The simulation results show that MODE/D can obtain a good Pareto-optimal front, which suggests a series of alternative solutions to draft scheduling. The extreme Pareto solutions are found feasible and the centres of the Pareto fronts give a good compromise. The conflict exists between each two ones of three objectives. The final optimal solution is selected from the Pareto-optimal front by the importance of objectives, and it can achieve a better performance in all objective dimensions than the empirical solutions. Finally, the practical application cases confirm the feasibility of the multi-objective approach, and the optimal solutions can gain a better rolling stability than the empirical solutions, and strip flatness decreases from （0± 63） IU to （0±45） IU in industrial production.展开更多
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.展开更多
Improving the prediction accuracy of wind power is an effective means to reduce the impact of wind power on power grid.Therefore,we proposed an improved African vulture optimization algorithm(AVOA)to realize the predi...Improving the prediction accuracy of wind power is an effective means to reduce the impact of wind power on power grid.Therefore,we proposed an improved African vulture optimization algorithm(AVOA)to realize the prediction model of multi-objective optimization least squares support vector machine(LSSVM).Firstly,the original wind power time series was decomposed into a certain number of intrinsic modal components(IMFs)using variational modal decomposition(VMD).Secondly,random numbers in population initialization were replaced by Tent chaotic mapping,multi-objective LSSVM optimization was introduced by AVOA improved by elitist non-dominated sorting and crowding operator,and then each component was predicted.Finally,Tent multi-objective AVOA-LSSVM(TMOALSSVM)method was used to sum each component to obtain the final prediction result.The simulation results show that the improved AVOA based on Tent chaotic mapping,the improved non-dominated sorting algorithm with elite strategy,and the improved crowding operator are the optimal models for single-objective and multi-objective prediction.Among them,TMOALSSVM model has the smallest average error of stroke power values in four seasons,which are 0.0694,0.0545 and 0.0211,respectively.The average value of DS statistics in the four seasons is 0.9902,and the statistical value is the largest.The proposed model effectively predicts four seasons of wind power values on lateral and longitudinal precision,and faster and more accurately finds the optimal solution on the current solution space sets,which proves that the method has a certain scientific significance in the development of wind power prediction technology.展开更多
For increasing the overall performance of modem manufacturing systems, effective integration of process planning and scheduling functions has been an important area of consideration among researchers. Owing to the com...For increasing the overall performance of modem manufacturing systems, effective integration of process planning and scheduling functions has been an important area of consideration among researchers. Owing to the complexity of handling process planning and scheduling simultaneously, most of the research work has been limited to solving the integrated process planning and scheduling （IPPS） problem for a single objective function. As there are many conflicting objectives when dealing with process planning and scheduling, real world problems cannot be fully captured considering only a single objective for optimization. Therefore considering multi-objective IPPS （MOIPPS） problem is inevitable. Unfortunately, only a handful of research papers are available on solving MOIPPS problem. In this paper, an optimization algorithm for solving MOIPPS problem is presented. The proposed algorithm uses a set of dispatch- ing rules coupled with priority assignment to optimize the IPPS problem for various objectives like makespan, total machine load, total tardiness, etc. A fixed sized external archive coupled with a crowding distance mechanism is used to store and maintain the non-dominated solutions. To compare the results with other algorithms, a C-matric based method has been used. Instances from four recent papers have been solved to demonstrate the effectiveness of the proposed algorithm. The experimental results show that the proposed method is an efficient approach for solving the MOIPPS problem.展开更多
Task scheduling for electro-magnetic detection satellite is a typical combinatorial optimization problem. The count of constraints that need to be taken into account is of large scale. An algorithm combined integer pr...Task scheduling for electro-magnetic detection satellite is a typical combinatorial optimization problem. The count of constraints that need to be taken into account is of large scale. An algorithm combined integer programming with constraint programming is presented. This algorithm is deployed in this problem through two steps. The first step is to decompose the original problem into master and sub-problem using the logic-based Benders decomposition; then a circus combines master and sub-problem solving process together, and the connection between them is general Benders cut. This hybrid algorithm is tested by a set of derived experiments. The result is compared with corresponding outcomes generated by the strength Pareto evolutionary algorithm and the pure constraint programming solver GECODE, which is an open source software. These tests and comparisons yield promising effect.展开更多
文摘In recent years,decomposition-based evolutionary algorithms have become popular algorithms for solving multi-objective problems in real-life scenarios.In these algorithms,the reference vectors of the Penalty-Based boundary intersection(PBI)are distributed parallelly while those based on the normal boundary intersection(NBI)are distributed radially in a conical shape in the objective space.To improve the problem-solving effectiveness of multi-objective optimization algorithms in engineering applications,this paper addresses the improvement of the Collaborative Decomposition(CoD)method,a multi-objective decomposition technique that integrates PBI and NBI,and combines it with the Elephant Clan Optimization Algorithm,introducing the Collaborative Decomposition Multi-objective Improved Elephant Clan Optimization Algorithm(CoDMOIECO).Specifically,a novel subpopulation construction method with adaptive changes following the number of iterations and a novel individual merit ranking based onNBI and angle are proposed.,enabling the creation of subpopulations closely linked to weight vectors and the identification of diverse individuals within them.Additionally,new update strategies for the clan leader,male elephants,and juvenile elephants are introduced to boost individual exploitation capabilities and further enhance the algorithm’s convergence.Finally,a new CoD-based environmental selection method is proposed,introducing adaptive dynamically adjusted angle coefficients and individual angles on corresponding weight vectors,significantly improving both the convergence and distribution of the algorithm.Experimental comparisons on the ZDT,DTLZ,and WFG function sets with four benchmark multi-objective algorithms—MOEA/D,CAMOEA,VaEA,and MOEA/D-UR—demonstrate that CoDMOIECO achieves superior performance in both convergence and distribution.
基金partially supported by the National Natural Science Foundation of China(41930644,61972439)the Collaborative Innovation Project of Anhui Province(GXXT-2022-093)the Key Program in the Youth Elite Support Plan in Universities of Anhui Province(gxyqZD2019010)。
文摘Tourism route planning is widely applied in the smart tourism field.The Pareto-optimal front obtained by the traditional multi-objective evolutionary algorithm exhibits long tails,sharp peaks and disconnected regions problems,which leads to uneven distribution and weak diversity of optimization solutions of tourism routes.Inspired by these limitations,we propose a multi-objective evolutionary algorithm for tourism route recommendation(MOTRR)with two-stage and Pareto layering based on decomposition.The method decomposes the multiobjective problem into several subproblems,and improves the distribution of solutions through a two-stage method.The crowding degree mechanism between extreme and intermediate populations is used in the two-stage method.The neighborhood is determined according to the weight of the subproblem for crossover mutation.Finally,Pareto layering is used to improve the updating efficiency and population diversity of the solution.The two-stage method is combined with the Pareto layering structure,which not only maintains the distribution and diversity of the algorithm,but also avoids the same solutions.Compared with several classical benchmark algorithms,the experimental results demonstrate competitive advantages on five test functions,hypervolume(HV)and inverted generational distance(IGD)metrics.Using the experimental results of real scenic spot datasets from two famous tourism social networking sites with vast amounts of users and large-scale online comments in Beijing,our proposed algorithm shows better distribution.It proves that the tourism routes recommended by our proposed algorithm have better distribution and diversity,so that the recommended routes can better meet the personalized needs of tourists.
基金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.
基金by National Natural Science Foundation of China(62373142,62033014)Natural Science Foundation of Hunan Province(2025JJ70017,2022JJ50074).
文摘To address issues such as poor initial population diversity, low stability and local convergence accuracy, and easy local optima in the traditional Multi-Objective Artificial Hummingbird Algorithm (MOAHA), an Improved MOAHA (IMOAHA) was proposed. The improvements involve Tent mapping based on random variables to initialize the population, a logarithmic decrease strategy for inertia weight to balance search capability, and the improved search operators in the territory foraging phase to enhance the ability to escape from local optima and increase convergence accuracy. The effectiveness of IMOAHA was verified through Matlab/Simulink. The results demonstrate that IMOAHA exhibits superior convergence, diversity, uniformity, and coverage of solutions across 6 test functions, outperforming 4 comparative algorithms. A Wilcoxon rank-sum test further confirmed its exceptional performance. To assess IMOAHA’s ability to solve engineering problems, an optimization model for a multi-track, multi-train urban rail traction power supply system with Supercapacitor Energy Storage Systems (SCESSs) was established, and IMOAHA was successfully applied to solving the capacity allocation problem of SCESSs, demonstrating that it is an effective tool for solving complex Multi-Objective Optimization Problems (MOOPs) in engineering domains.
基金Project(62073342)supported by the National Natural Science Foundation of ChinaProject(2014 AA 041803)supported by the Hi-tech Research and Development Program of China。
文摘The operation variables,including feed rate of ore slurry,caustic solution and live steams in the double-stream alumina digestion process,determine the product quality,process costs and the environment pollution.Previously,they were set by the technical workers according to the offline analysis results and an empirical formula,which leads to unstable process indices and high consumption frequently.So,a multi-objective optimization model is built to maintain the balance between resource consumptions and process indices by taking technical indices and energy efficiency as objectives,where the key technical indices are predicted based on the digestion kinetics of diaspore.A multi-objective state transition algorithm(MOSTA)is improved to solve the problem,in which a self-adaptive strategy is applied to dynamically adjust the operator factors of the MOSTA and dynamic infeasible threshold is used to handle constraints to enhance searching efficiency and ability of the algorithm.Then a rule based strategy is designed to make the final decision from the Pareto frontiers.The method is integrated into an optimal control system for the industrial digestion process and tested in the actual production.Results show that the proposed method can achieve the technical target while reducing the energy consumption.
基金supported by the National Key R&D Plan(2020YFB1712902)the National Natural Science Foundation of China(52075036).
文摘In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.
基金Natural Science Funds for the Innovative Research Group of China Under Grant No.50621062
文摘The seismic reliability evaluation of lifeline networks has received considerable attention and been widely studied. In this paper, on the basis of an original recursive decomposition algorithm, an improved analytical approach to evaluate the seismic reliability of large lifeline systems is presented. The proposed algorithm takes the shortest path from the source to the sink of a network as decomposition policy. Using the Boolean laws of set operation and the probabilistic operation principal, a recursive decomposition process is constructed in which the disjoint minimal path set and the disjoint minimal cut set are simultaneously enumerated. As the result, a probabilistic inequality can be used to provide results that satisfy a prescribed error bound. During the decomposition process, different from the original recursive decomposition algorithm which only removes edges to simplify the network, the proposed algorithm simplifies the network by merging nodes into sources and removing edges. As a result, the proposed algorithm can obtain simpler networks. Moreover, for a network owning s-independent components in its component set, two network reduction techniques are introduced to speed up the proposed algorithm. A series of case studies, including an actual water distribution network and a large urban gas system, are calculated using the proposed algorithm. The results indicate that the proposed algorithm provides a useful probabilistic analysis method for the seismic reliability evaluation of lifeline networks.
基金Projects(50974039,50634030)supported by the National Natural Science Foundation of China
文摘A multi-objective optimization model for draft scheduling of hot strip mill was presented, rolling power minimizing, rolling force ratio distribution and good strip shape as the objective functions. A multi-objective differential evolution algorithm based on decomposition （MODE/D）. The two-objective and three-objective optimization experiments were performed respectively to demonstrate the optimal solutions of trade-off. The simulation results show that MODE/D can obtain a good Pareto-optimal front, which suggests a series of alternative solutions to draft scheduling. The extreme Pareto solutions are found feasible and the centres of the Pareto fronts give a good compromise. The conflict exists between each two ones of three objectives. The final optimal solution is selected from the Pareto-optimal front by the importance of objectives, and it can achieve a better performance in all objective dimensions than the empirical solutions. Finally, the practical application cases confirm the feasibility of the multi-objective approach, and the optimal solutions can gain a better rolling stability than the empirical solutions, and strip flatness decreases from （0± 63） IU to （0±45） IU in industrial production.
基金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 National Natural Science Foundation of China(Nos.61662042,62062049)Science and Technology Plan of Gansu Province(Nos.21JR7RA288,21JR7RE174).
文摘Improving the prediction accuracy of wind power is an effective means to reduce the impact of wind power on power grid.Therefore,we proposed an improved African vulture optimization algorithm(AVOA)to realize the prediction model of multi-objective optimization least squares support vector machine(LSSVM).Firstly,the original wind power time series was decomposed into a certain number of intrinsic modal components(IMFs)using variational modal decomposition(VMD).Secondly,random numbers in population initialization were replaced by Tent chaotic mapping,multi-objective LSSVM optimization was introduced by AVOA improved by elitist non-dominated sorting and crowding operator,and then each component was predicted.Finally,Tent multi-objective AVOA-LSSVM(TMOALSSVM)method was used to sum each component to obtain the final prediction result.The simulation results show that the improved AVOA based on Tent chaotic mapping,the improved non-dominated sorting algorithm with elite strategy,and the improved crowding operator are the optimal models for single-objective and multi-objective prediction.Among them,TMOALSSVM model has the smallest average error of stroke power values in four seasons,which are 0.0694,0.0545 and 0.0211,respectively.The average value of DS statistics in the four seasons is 0.9902,and the statistical value is the largest.The proposed model effectively predicts four seasons of wind power values on lateral and longitudinal precision,and faster and more accurately finds the optimal solution on the current solution space sets,which proves that the method has a certain scientific significance in the development of wind power prediction technology.
文摘For increasing the overall performance of modem manufacturing systems, effective integration of process planning and scheduling functions has been an important area of consideration among researchers. Owing to the complexity of handling process planning and scheduling simultaneously, most of the research work has been limited to solving the integrated process planning and scheduling （IPPS） problem for a single objective function. As there are many conflicting objectives when dealing with process planning and scheduling, real world problems cannot be fully captured considering only a single objective for optimization. Therefore considering multi-objective IPPS （MOIPPS） problem is inevitable. Unfortunately, only a handful of research papers are available on solving MOIPPS problem. In this paper, an optimization algorithm for solving MOIPPS problem is presented. The proposed algorithm uses a set of dispatch- ing rules coupled with priority assignment to optimize the IPPS problem for various objectives like makespan, total machine load, total tardiness, etc. A fixed sized external archive coupled with a crowding distance mechanism is used to store and maintain the non-dominated solutions. To compare the results with other algorithms, a C-matric based method has been used. Instances from four recent papers have been solved to demonstrate the effectiveness of the proposed algorithm. The experimental results show that the proposed method is an efficient approach for solving the MOIPPS problem.
基金supported by the National Security Fundamental Research Foundation of China (61361)the National Natural Science Foundation of China (61104180)
文摘Task scheduling for electro-magnetic detection satellite is a typical combinatorial optimization problem. The count of constraints that need to be taken into account is of large scale. An algorithm combined integer programming with constraint programming is presented. This algorithm is deployed in this problem through two steps. The first step is to decompose the original problem into master and sub-problem using the logic-based Benders decomposition; then a circus combines master and sub-problem solving process together, and the connection between them is general Benders cut. This hybrid algorithm is tested by a set of derived experiments. The result is compared with corresponding outcomes generated by the strength Pareto evolutionary algorithm and the pure constraint programming solver GECODE, which is an open source software. These tests and comparisons yield promising effect.
