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.展开更多
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.展开更多
To enhance the rationality of the layout of electric vehicle charging stations,meet the actual needs of users,and optimise the service range and coverage efficiency of charging stations,this paper proposes an optimisa...To enhance the rationality of the layout of electric vehicle charging stations,meet the actual needs of users,and optimise the service range and coverage efficiency of charging stations,this paper proposes an optimisation strategy for the layout of electric vehicle charging stations that integrates Mini Batch K-Means and simulated annealing algorithms.By constructing a circle-like service area model with the charging station as the centre and a certain distance as the radius,the maximum coverage of electric vehicle charging stations in the region and the influence of different regional environments on charging demand are considered.Based on the real data of electric vehicle charging stations in Nanjing,Jiangsu Province,this paper uses the model proposed in this paper to optimise the layout of charging stations in the study area.The results show that the optimisation strategy incorporating Mini Batch K-Means and simulated annealing algorithms outperforms the existing charging station layouts in terms of coverage and the number of stations served,and compared to the original charging station layouts,the optimised charging station layouts have flatter Lorentzian curves and are closer to the average distribution.The proposed optimisation strategy not only improves the service efficiency and user satisfaction of EV(Electric Vehicle)charging stations but also provides a reference for the layout optimisation of EV charging stations in other cities,which has important practical value and promotion potential.展开更多
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.展开更多
Introducing carbon trading into electricity market can convert carbon dioxide into schedulable resources with economic value.However,the randomness of wind power generation puts forward higher requirements for electri...Introducing carbon trading into electricity market can convert carbon dioxide into schedulable resources with economic value.However,the randomness of wind power generation puts forward higher requirements for electricity market transactions.Therefore,the carbon trading market is introduced into the wind power market,and a new form of low-carbon economic dispatch model is developed.First,the economic dispatch goal of wind power is be considered.It is projected to save money and reduce the cost of power generation for the system.The model includes risk operating costs to account for the impact of wind power output variability on the system,as well as wind farm negative efficiency operating costs to account for the loss caused by wind abandonment.The model also employs carbon trading market metrics to achieve the goal of lowering system carbon emissions,and analyze the impact of different carbon trading prices on the system.A low-carbon economic dispatch model for the wind power market is implemented based on the following two goals.Finally,the solution is optimised using the Ant-lion optimisation method,which combines Levi's flight mechanism and golden sine.The proposed model and algorithm's rationality is proven through the use of cases.展开更多
Two uncoupleable distributions, assigning missions to robots and allocating robots to home stations, accompany the use ofmobile service robots in hospitals.In the given problem, two workload-related objectives and fiv...Two uncoupleable distributions, assigning missions to robots and allocating robots to home stations, accompany the use ofmobile service robots in hospitals.In the given problem, two workload-related objectives and five groups of constraints areproposed.A bio-mimicked Binary Bees Algorithm (BBA) is introduced to solve this multiobjective multiconstraint combinatorialoptimisation problem, in which constraint handling technique (Multiobjective Transformation, MOT), multiobjectiveevaluation method (nondominance selection), global search strategy (stochastic search in the variable space), local searchstrategy (Hamming neighbourhood exploitation), and post-processing means (feasibility selection) are the main issues.TheBBA is then demonstrated with a case study, presenting the execution process of the algorithm, and also explaining the change ofelite number in evolutionary process.Its optimisation result provides a group of feasible nondominated two-level distributionschemes.展开更多
In real-world applications, datasets frequently contain outliers, which can hinder the generalization ability of machine learning models. Bayesian classifiers, a popular supervised learning method, rely on accurate pr...In real-world applications, datasets frequently contain outliers, which can hinder the generalization ability of machine learning models. Bayesian classifiers, a popular supervised learning method, rely on accurate probability density estimation for classifying continuous datasets. However, achieving precise density estimation with datasets containing outliers poses a significant challenge. This paper introduces a Bayesian classifier that utilizes optimized robust kernel density estimation to address this issue. Our proposed method enhances the accuracy of probability density distribution estimation by mitigating the impact of outliers on the training sample’s estimated distribution. Unlike the conventional kernel density estimator, our robust estimator can be seen as a weighted kernel mapping summary for each sample. This kernel mapping performs the inner product in the Hilbert space, allowing the kernel density estimation to be considered the average of the samples’ mapping in the Hilbert space using a reproducing kernel. M-estimation techniques are used to obtain accurate mean values and solve the weights. Meanwhile, complete cross-validation is used as the objective function to search for the optimal bandwidth, which impacts the estimator. The Harris Hawks Optimisation optimizes the objective function to improve the estimation accuracy. The experimental results show that it outperforms other optimization algorithms regarding convergence speed and objective function value during the bandwidth search. The optimal robust kernel density estimator achieves better fitness performance than the traditional kernel density estimator when the training data contains outliers. The Naïve Bayesian with optimal robust kernel density estimation improves the generalization in the classification with outliers.展开更多
There is a growing interest in the study development of artificial intelligence and machine learning,especially regarding the support vector machine pattern classification method.This study proposes an enhanced implem...There is a growing interest in the study development of artificial intelligence and machine learning,especially regarding the support vector machine pattern classification method.This study proposes an enhanced implementation of the well-known whale optimisation algorithm,which combines chaotic and opposition-based learning strategies,which is adopted for hyper-parameter optimisation and feature selection machine learning challenges.The whale optimisation algorithm is a relatively recent addition to the group of swarm intelligence algorithms commonly used for optimisation.The Proposed improved whale optimisation algorithm was first tested for standard unconstrained CEC2017 benchmark suite and it was later adapted for simultaneous feature selection and support vector machine hyper-parameter tuning and validated for medical diagnostics by using breast cancer,diabetes,and erythemato-squamous dataset.The performance of the proposed model is compared with multiple competitive support vector machine models boosted with other metaheuristics,including another improved whale optimisation approach,particle swarm optimisation algorithm,bacterial foraging optimisation algorithms,and genetic algorithms.Results of the simulation show that the proposed model outperforms other competitors concerning the performance of classification and the selected subset feature size.展开更多
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.展开更多
This paper presents an integrated methodology for the modelling and optimisation of precedence-constrained production sequencing and scheduling for multiple production lines based on Genetic Algorithms （GA）. The pro...This paper presents an integrated methodology for the modelling and optimisation of precedence-constrained production sequencing and scheduling for multiple production lines based on Genetic Algorithms （GA）. The problems in this class are NP-hard combinatorial problems, requiring a triple optimisation at the same time： allocation of resources to each line, production sequencing and production scheduling within each production line. They are ubiquitous to production and manufacturing environments. Due to nature of constraints, the length of solutions for the problem can be variable. To cope with this variability, new strategies for encoding chromosomes, crossover and mutation operations have been developed. Robustness of the proposed GA is demonstrated by a complex and realistic case study.展开更多
Unmanned Aerial Vehicles(UAVs)or drones introduced for military applications are gaining popularity in several other fields as well such as security and surveillance,due to their ability to perform repetitive and tedi...Unmanned Aerial Vehicles(UAVs)or drones introduced for military applications are gaining popularity in several other fields as well such as security and surveillance,due to their ability to perform repetitive and tedious tasks in hazardous environments.Their increased demand created the requirement for enabling the UAVs to traverse independently through the Three Dimensional(3D)flight environment consisting of various obstacles which have been efficiently addressed by metaheuristics in past literature.However,not a single optimization algorithms can solve all kind of optimization problem effectively.Therefore,there is dire need to integrate metaheuristic for general acceptability.To address this issue,in this paper,a novel reinforcement learning controlled Grey Wolf Optimisation-Archimedes Optimisation Algorithm(QGA)has been exhaustively introduced and exhaustively validated firstly on 22 benchmark functions and then,utilized to obtain the optimum flyable path without collision for UAVs in three dimensional environment.The performance of the developed QGA has been compared against the various metaheuristics.The simulation experimental results reveal that the QGA algorithm acquire a feasible and effective flyable path more efficiently in complicated environment.展开更多
电离层总电子含量(Total Electron Content,TEC)精确预报对提高卫星导航定位精度具有重要意义.为此,提出一种联合鲸鱼优化算法(Whale Optimization Algorithm,WOA)与长短期记忆神经网络模型(Long-Short Term Memory Networks,LSTM)的TE...电离层总电子含量(Total Electron Content,TEC)精确预报对提高卫星导航定位精度具有重要意义.为此,提出一种联合鲸鱼优化算法(Whale Optimization Algorithm,WOA)与长短期记忆神经网络模型(Long-Short Term Memory Networks,LSTM)的TEC短期预报模型;该模型通过LSTM模型训练得到WOA算法的最佳适应度,并利用优化的WOA算法得到LSTM模型最优参数.最后,结合欧洲定轨中心(Center for Orbit Determination in Europe,CODE)提供的TEC格网点数据对所提模型进行验证;试验结果表明:地磁平静状态下,组合模型的平均相关系数ρ较LSTM模型在低、中、高纬度分别提升了2.8%、6.2%和14.8%;地磁活跃状态下组合模型的平均相关系数ρ在低、中、高纬度地区较LSTM模型分别提升了6.6%、9.2%与7.9%.且模型预报效果与地磁活跃状态、季节、太阳活跃水平等有关,在不同地磁活跃状态、季节与不同太阳活动水平情况下,组合模型预报效果均优于单一LSTM模型,为电离层TEC预报模型的实际应用提供了参考.展开更多
基金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.
文摘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.
基金supported by the Jiangsu Provincial College Students Innovation andEntrepreneurship Training Plan Project(grant number 202411276037Z)the Nanjing Institute ofTechnology Fund for Research Startup Projects of Introduced Talents(grant number TB202406012).
文摘To enhance the rationality of the layout of electric vehicle charging stations,meet the actual needs of users,and optimise the service range and coverage efficiency of charging stations,this paper proposes an optimisation strategy for the layout of electric vehicle charging stations that integrates Mini Batch K-Means and simulated annealing algorithms.By constructing a circle-like service area model with the charging station as the centre and a certain distance as the radius,the maximum coverage of electric vehicle charging stations in the region and the influence of different regional environments on charging demand are considered.Based on the real data of electric vehicle charging stations in Nanjing,Jiangsu Province,this paper uses the model proposed in this paper to optimise the layout of charging stations in the study area.The results show that the optimisation strategy incorporating Mini Batch K-Means and simulated annealing algorithms outperforms the existing charging station layouts in terms of coverage and the number of stations served,and compared to the original charging station layouts,the optimised charging station layouts have flatter Lorentzian curves and are closer to the average distribution.The proposed optimisation strategy not only improves the service efficiency and user satisfaction of EV(Electric Vehicle)charging stations but also provides a reference for the layout optimisation of EV charging stations in other cities,which has important practical value and promotion potential.
基金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.
基金National Natural Science Foundation of China,Grant/Award Number:51677059。
文摘Introducing carbon trading into electricity market can convert carbon dioxide into schedulable resources with economic value.However,the randomness of wind power generation puts forward higher requirements for electricity market transactions.Therefore,the carbon trading market is introduced into the wind power market,and a new form of low-carbon economic dispatch model is developed.First,the economic dispatch goal of wind power is be considered.It is projected to save money and reduce the cost of power generation for the system.The model includes risk operating costs to account for the impact of wind power output variability on the system,as well as wind farm negative efficiency operating costs to account for the loss caused by wind abandonment.The model also employs carbon trading market metrics to achieve the goal of lowering system carbon emissions,and analyze the impact of different carbon trading prices on the system.A low-carbon economic dispatch model for the wind power market is implemented based on the following two goals.Finally,the solution is optimised using the Ant-lion optimisation method,which combines Levi's flight mechanism and golden sine.The proposed model and algorithm's rationality is proven through the use of cases.
文摘Two uncoupleable distributions, assigning missions to robots and allocating robots to home stations, accompany the use ofmobile service robots in hospitals.In the given problem, two workload-related objectives and five groups of constraints areproposed.A bio-mimicked Binary Bees Algorithm (BBA) is introduced to solve this multiobjective multiconstraint combinatorialoptimisation problem, in which constraint handling technique (Multiobjective Transformation, MOT), multiobjectiveevaluation method (nondominance selection), global search strategy (stochastic search in the variable space), local searchstrategy (Hamming neighbourhood exploitation), and post-processing means (feasibility selection) are the main issues.TheBBA is then demonstrated with a case study, presenting the execution process of the algorithm, and also explaining the change ofelite number in evolutionary process.Its optimisation result provides a group of feasible nondominated two-level distributionschemes.
文摘In real-world applications, datasets frequently contain outliers, which can hinder the generalization ability of machine learning models. Bayesian classifiers, a popular supervised learning method, rely on accurate probability density estimation for classifying continuous datasets. However, achieving precise density estimation with datasets containing outliers poses a significant challenge. This paper introduces a Bayesian classifier that utilizes optimized robust kernel density estimation to address this issue. Our proposed method enhances the accuracy of probability density distribution estimation by mitigating the impact of outliers on the training sample’s estimated distribution. Unlike the conventional kernel density estimator, our robust estimator can be seen as a weighted kernel mapping summary for each sample. This kernel mapping performs the inner product in the Hilbert space, allowing the kernel density estimation to be considered the average of the samples’ mapping in the Hilbert space using a reproducing kernel. M-estimation techniques are used to obtain accurate mean values and solve the weights. Meanwhile, complete cross-validation is used as the objective function to search for the optimal bandwidth, which impacts the estimator. The Harris Hawks Optimisation optimizes the objective function to improve the estimation accuracy. The experimental results show that it outperforms other optimization algorithms regarding convergence speed and objective function value during the bandwidth search. The optimal robust kernel density estimator achieves better fitness performance than the traditional kernel density estimator when the training data contains outliers. The Naïve Bayesian with optimal robust kernel density estimation improves the generalization in the classification with outliers.
文摘There is a growing interest in the study development of artificial intelligence and machine learning,especially regarding the support vector machine pattern classification method.This study proposes an enhanced implementation of the well-known whale optimisation algorithm,which combines chaotic and opposition-based learning strategies,which is adopted for hyper-parameter optimisation and feature selection machine learning challenges.The whale optimisation algorithm is a relatively recent addition to the group of swarm intelligence algorithms commonly used for optimisation.The Proposed improved whale optimisation algorithm was first tested for standard unconstrained CEC2017 benchmark suite and it was later adapted for simultaneous feature selection and support vector machine hyper-parameter tuning and validated for medical diagnostics by using breast cancer,diabetes,and erythemato-squamous dataset.The performance of the proposed model is compared with multiple competitive support vector machine models boosted with other metaheuristics,including another improved whale optimisation approach,particle swarm optimisation algorithm,bacterial foraging optimisation algorithms,and genetic algorithms.Results of the simulation show that the proposed model outperforms other competitors concerning the performance of classification and the selected subset feature size.
基金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.
文摘This paper presents an integrated methodology for the modelling and optimisation of precedence-constrained production sequencing and scheduling for multiple production lines based on Genetic Algorithms （GA）. The problems in this class are NP-hard combinatorial problems, requiring a triple optimisation at the same time： allocation of resources to each line, production sequencing and production scheduling within each production line. They are ubiquitous to production and manufacturing environments. Due to nature of constraints, the length of solutions for the problem can be variable. To cope with this variability, new strategies for encoding chromosomes, crossover and mutation operations have been developed. Robustness of the proposed GA is demonstrated by a complex and realistic case study.
基金funded by Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2022R66),Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.
文摘Unmanned Aerial Vehicles(UAVs)or drones introduced for military applications are gaining popularity in several other fields as well such as security and surveillance,due to their ability to perform repetitive and tedious tasks in hazardous environments.Their increased demand created the requirement for enabling the UAVs to traverse independently through the Three Dimensional(3D)flight environment consisting of various obstacles which have been efficiently addressed by metaheuristics in past literature.However,not a single optimization algorithms can solve all kind of optimization problem effectively.Therefore,there is dire need to integrate metaheuristic for general acceptability.To address this issue,in this paper,a novel reinforcement learning controlled Grey Wolf Optimisation-Archimedes Optimisation Algorithm(QGA)has been exhaustively introduced and exhaustively validated firstly on 22 benchmark functions and then,utilized to obtain the optimum flyable path without collision for UAVs in three dimensional environment.The performance of the developed QGA has been compared against the various metaheuristics.The simulation experimental results reveal that the QGA algorithm acquire a feasible and effective flyable path more efficiently in complicated environment.
文摘电离层总电子含量(Total Electron Content,TEC)精确预报对提高卫星导航定位精度具有重要意义.为此,提出一种联合鲸鱼优化算法(Whale Optimization Algorithm,WOA)与长短期记忆神经网络模型(Long-Short Term Memory Networks,LSTM)的TEC短期预报模型;该模型通过LSTM模型训练得到WOA算法的最佳适应度,并利用优化的WOA算法得到LSTM模型最优参数.最后,结合欧洲定轨中心(Center for Orbit Determination in Europe,CODE)提供的TEC格网点数据对所提模型进行验证;试验结果表明:地磁平静状态下,组合模型的平均相关系数ρ较LSTM模型在低、中、高纬度分别提升了2.8%、6.2%和14.8%;地磁活跃状态下组合模型的平均相关系数ρ在低、中、高纬度地区较LSTM模型分别提升了6.6%、9.2%与7.9%.且模型预报效果与地磁活跃状态、季节、太阳活跃水平等有关,在不同地磁活跃状态、季节与不同太阳活动水平情况下,组合模型预报效果均优于单一LSTM模型,为电离层TEC预报模型的实际应用提供了参考.
