期刊文献+
共找到1,767篇文章
< 1 2 89 >
每页显示 20 50 100
基于Double Q-Learning的改进蝗虫算法求解分布式柔性作业车间逆调度问题
1
作者 胡旭伦 唐红涛 《机床与液压》 北大核心 2025年第20期52-63,共12页
针对分布式柔性作业车间中存在的资源分配不均和调度稳定性不足问题,构建以最小化最大完工时间、机器总能耗和偏离度为目标的逆调度数学模型,提出一种基于Double Q-Learning的改进多目标蝗虫优化算法(DQIGOA)。针对该问题设计一种混合... 针对分布式柔性作业车间中存在的资源分配不均和调度稳定性不足问题,构建以最小化最大完工时间、机器总能耗和偏离度为目标的逆调度数学模型,提出一种基于Double Q-Learning的改进多目标蝗虫优化算法(DQIGOA)。针对该问题设计一种混合三层编码方式;提出一种基于逆调度特点的种群初始化方式以提高种群质量;引入权重平衡因子来提高非支配解存档中解集的多样性;将强化学习中的Double Q-Learning机制融入非支配解的选择过程,通过动态动作策略优化目标解的选取,提升调度方案的全局搜索能力与局部优化效率。最后构建26组算例,通过策略有效性分析证明了所提策略可显著提升DQIGOA算法的性能,并通过与NSGA-II、DE和SPEA-II算法进行对比证明DQIGOA算法的有效性。结果表明:相比NSGA-II、DE和SPEA-II算法,DQIGOA算法在HV、IGD、SP指标上均有优势,证明了DQIGOA能够有效提升解的收敛速度和多样性分布,在动态扰动条件下表现出更强的鲁棒性。 展开更多
关键词 分布式柔性作业车间 逆调度 蝗虫算法 double q-learning机制
在线阅读 下载PDF
基于softmax的加权Double Q-Learning算法 被引量:5
2
作者 钟雨昂 袁伟伟 关东海 《计算机科学》 CSCD 北大核心 2024年第S01期46-50,共5页
强化学习作为机器学习的一个分支,用于描述和解决智能体在与环境的交互过程中,通过学习策略以达成回报最大化的问题。Q-Learning作为无模型强化学习的经典方法,存在过估计引起的最大化偏差问题,并且在环境中奖励存在噪声时表现不佳。Dou... 强化学习作为机器学习的一个分支,用于描述和解决智能体在与环境的交互过程中,通过学习策略以达成回报最大化的问题。Q-Learning作为无模型强化学习的经典方法,存在过估计引起的最大化偏差问题,并且在环境中奖励存在噪声时表现不佳。Double Q-Learning(DQL)的出现解决了过估计问题,但同时造成了低估问题。为解决以上算法的高低估问题,提出了基于softmax的加权Q-Learning算法,并将其与DQL相结合,提出了一种新的基于softmax的加权Double Q-Learning算法(WDQL-Softmax)。该算法基于加权双估计器的构造,对样本期望值进行softmax操作得到权重,使用权重估计动作价值,有效平衡对动作价值的高估和低估问题,使估计值更加接近理论值。实验结果表明,在离散动作空间中,相比于Q-Learning算法、DQL算法和WDQL算法,WDQL-Softmax算法的收敛速度更快且估计值与理论值的误差更小。 展开更多
关键词 强化学习 q-learning double q-learning Softmax
在线阅读 下载PDF
A Q-Learning-Assisted Co-Evolutionary Algorithm for Distributed Assembly Flexible Job Shop Scheduling Problems
3
作者 Song Gao Shixin Liu 《Computers, Materials & Continua》 2025年第6期5623-5641,共19页
With the development of economic globalization,distributedmanufacturing is becomingmore andmore prevalent.Recently,integrated scheduling of distributed production and assembly has captured much concern.This research s... With the development of economic globalization,distributedmanufacturing is becomingmore andmore prevalent.Recently,integrated scheduling of distributed production and assembly has captured much concern.This research studies a distributed flexible job shop scheduling problem with assembly operations.Firstly,a mixed integer programming model is formulated to minimize the maximum completion time.Secondly,a Q-learning-assisted coevolutionary algorithmis presented to solve themodel:(1)Multiple populations are developed to seek required decisions simultaneously;(2)An encoding and decoding method based on problem features is applied to represent individuals;(3)A hybrid approach of heuristic rules and random methods is employed to acquire a high-quality population;(4)Three evolutionary strategies having crossover and mutation methods are adopted to enhance exploration capabilities;(5)Three neighborhood structures based on problem features are constructed,and a Q-learning-based iterative local search method is devised to improve exploitation abilities.The Q-learning approach is applied to intelligently select better neighborhood structures.Finally,a group of instances is constructed to perform comparison experiments.The effectiveness of the Q-learning approach is verified by comparing the developed algorithm with its variant without the Q-learning method.Three renowned meta-heuristic algorithms are used in comparison with the developed algorithm.The comparison results demonstrate that the designed method exhibits better performance in coping with the formulated problem. 展开更多
关键词 Distributed manufacturing flexible job shop scheduling problem assembly operation co-evolutionary algorithm q-learning method
在线阅读 下载PDF
A Genetic Algorithm-Based Double Auction Framework for Secure and Scalable Resource Allocation in Cloud-Integrated Intrusion Detection Systems
4
作者 Siraj Un Muneer Ihsan Ullah +1 位作者 Zeshan Iqbal Rajermani Thinakaran 《Computers, Materials & Continua》 2025年第12期4959-4975,共17页
The complexity of cloud environments challenges secure resource management,especially for intrusion detection systems(IDS).Existing strategies struggle to balance efficiency,cost fairness,and threat resilience.This pa... The complexity of cloud environments challenges secure resource management,especially for intrusion detection systems(IDS).Existing strategies struggle to balance efficiency,cost fairness,and threat resilience.This paper proposes an innovative approach to managing cloud resources through the integration of a genetic algorithm(GA)with a“double auction”method.This approach seeks to enhance security and efficiency by aligning buyers and sellers within an intelligent market framework.It guarantees equitable pricing while utilizing resources efficiently and optimizing advantages for all stakeholders.The GA functions as an intelligent search mechanism that identifies optimal combinations of bids from users and suppliers,addressing issues arising from the intricacies of cloud systems.Analyses proved that our method surpasses previous strategies,particularly in terms of price accuracy,speed,and the capacity to manage large-scale activities,critical factors for real-time cybersecurity systems,such as IDS.Our research integrates artificial intelligence-inspired evolutionary algorithms with market-driven methods to develop intelligent resource management systems that are secure,scalable,and adaptable to evolving risks,such as process innovation. 展开更多
关键词 Cloud computing combinatorial double auction genetic algorithm optimization resource allocation intrusion detection system(IDS) cloud security
在线阅读 下载PDF
Double BP Q-Learning Algorithm for Local Path Planning of Mobile Robot 被引量:1
5
作者 Guoming Liu Caihong Li +2 位作者 Tengteng Gao Yongdi Li Xiaopei He 《Journal of Computer and Communications》 2021年第6期138-157,共20页
Aiming at the dimension disaster problem, poor model generalization ability and deadlock problem in special obstacles environment caused by the increase of state information in the local path planning process of mobil... Aiming at the dimension disaster problem, poor model generalization ability and deadlock problem in special obstacles environment caused by the increase of state information in the local path planning process of mobile robot, this paper proposed a Double BP Q-learning algorithm based on the fusion of Double Q-learning algorithm and BP neural network. In order to solve the dimensional disaster problem, two BP neural network fitting value functions with the same network structure were used to replace the two <i>Q</i> value tables in Double Q-Learning algorithm to solve the problem that the <i>Q</i> value table cannot store excessive state information. By adding the mechanism of priority experience replay and using the parameter transfer to initialize the model parameters in different environments, it could accelerate the convergence rate of the algorithm, improve the learning efficiency and the generalization ability of the model. By designing specific action selection strategy in special environment, the deadlock state could be avoided and the mobile robot could reach the target point. Finally, the designed Double BP Q-learning algorithm was simulated and verified, and the probability of mobile robot reaching the target point in the parameter update process was compared with the Double Q-learning algorithm under the same condition of the planned path length. The results showed that the model trained by the improved Double BP Q-learning algorithm had a higher success rate in finding the optimal or sub-optimal path in the dense discrete environment, besides, it had stronger model generalization ability, fewer redundant sections, and could reach the target point without entering the deadlock zone in the special obstacles environment. 展开更多
关键词 Mobile Robot Local Path Planning double BP q-learning BP Neural Network Transfer Learning
在线阅读 下载PDF
Path Planning of Oil Spill Recovery System With Double USVs Based on Artificial Potential Field Method
6
作者 Yulei Liao Xiaoyu Tang +3 位作者 Congcong Chen Zijia Ren Shuo Pang Guocheng Zhang 《哈尔滨工程大学学报(英文版)》 2025年第3期606-618,共13页
Path planning for recovery is studied on the engineering background of double unmanned surface vehicles(USVs)towing oil booms for oil spill recovery.Given the influence of obstacles on the sea,the improved artificial ... Path planning for recovery is studied on the engineering background of double unmanned surface vehicles(USVs)towing oil booms for oil spill recovery.Given the influence of obstacles on the sea,the improved artificial potential field(APF)method is used for path planning.For addressing the two problems of unreachable target and local minimum in the APF,three improved algorithms are proposed by combining the motion performance constraints of the double USV system.These algorithms are then combined as the final APF-123 algorithm for oil spill recovery.Multiple sets of simulation tests are designed according to the flaws of the APF and the process of oil spill recovery.Results show that the proposed algorithms can ensure the system’s safety in tracking oil spills in a complex environment,and the speed is increased by more than 40%compared with the APF method. 展开更多
关键词 Oil spill recovery double unmanned surface vehicles Artificial potential field method Path planning Simulated annealing algorithm
在线阅读 下载PDF
Supervisory control of the hybrid off-highway vehicle for fuel economy improvement using predictive double Q-learning with backup models 被引量:1
7
作者 SHUAI Bin LI Yan-fei +2 位作者 ZHOU Quan XU Hong-ming SHUAI Shi-jin 《Journal of Central South University》 SCIE EI CAS CSCD 2022年第7期2266-2278,共13页
This paper studied a supervisory control system for a hybrid off-highway electric vehicle under the chargesustaining(CS)condition.A new predictive double Q-learning with backup models(PDQL)scheme is proposed to optimi... This paper studied a supervisory control system for a hybrid off-highway electric vehicle under the chargesustaining(CS)condition.A new predictive double Q-learning with backup models(PDQL)scheme is proposed to optimize the engine fuel in real-world driving and improve energy efficiency with a faster and more robust learning process.Unlike the existing“model-free”methods,which solely follow on-policy and off-policy to update knowledge bases(Q-tables),the PDQL is developed with the capability to merge both on-policy and off-policy learning by introducing a backup model(Q-table).Experimental evaluations are conducted based on software-in-the-loop(SiL)and hardware-in-the-loop(HiL)test platforms based on real-time modelling of the studied vehicle.Compared to the standard double Q-learning(SDQL),the PDQL only needs half of the learning iterations to achieve better energy efficiency than the SDQL at the end learning process.In the SiL under 35 rounds of learning,the results show that the PDQL can improve the vehicle energy efficiency by 1.75%higher than SDQL.By implementing the PDQL in HiL under four predefined real-world conditions,the PDQL can robustly save more than 5.03%energy than the SDQL scheme. 展开更多
关键词 supervisory charge-sustaining control hybrid electric vehicle reinforcement learning predictive double q-learning
在线阅读 下载PDF
基于Double Deep Q-learning的无线通信节点覆盖优化 被引量:1
8
作者 李忠涛 《电子技术与软件工程》 2021年第14期1-3,共3页
本文拟采用Double Deep Q-learning模型进行算法设计,该算法是强化学习中的一种values-based算法,实现一种神经网络模型来代替表格Q-Table,解决了系统状态过多导致的Q-Table过大问题。
关键词 无线通信节点 最优路径 double Deep q-learning
在线阅读 下载PDF
CNOP-P-based parameter sensitivity for double-gyre variation in ROMS with simulated annealing algorithm 被引量:3
9
作者 YUAN Shijin ZHANG Huazhen +1 位作者 LI Mi MU Bin 《Journal of Oceanology and Limnology》 SCIE CAS CSCD 2019年第3期957-967,共11页
Reducing the error of sensitive parameters by studying the parameters sensitivity can reduce the uncertainty of the model,while simulating double-gyre variation in Regional Ocean Modeling System(ROMS).Conditional Nonl... Reducing the error of sensitive parameters by studying the parameters sensitivity can reduce the uncertainty of the model,while simulating double-gyre variation in Regional Ocean Modeling System(ROMS).Conditional Nonlinear Optimal Perturbation related to Parameter(CNOP-P)is an effective method of studying the parameters sensitivity,which represents a type of parameter error with maximum nonlinear development at the prediction time.Intelligent algorithms have been widely applied to solving Conditional Nonlinear Optimal Perturbation(CNOP).In the paper,we proposed an improved simulated annealing(SA)algorithm to solve CNOP-P to get the optimal parameters error,studied the sensitivity of the single parameter and the combination of multiple parameters and verified the effect of reducing the error of sensitive parameters on reducing the uncertainty of model simulation.Specifically,we firstly found the non-period oscillation of kinetic energy time series of double gyre variation,then extracted two transition periods,which are respectively from high energy to low energy and from low energy to high energy.For every transition period,three parameters,respectively wind amplitude(WD),viscosity coefficient(VC)and linear bottom drag coefficient(RDRG),were studied by CNOP-P solved with SA algorithm.Finally,for sensitive parameters,their effect on model simulation is verified.Experiments results showed that the sensitivity order is WD>VC>>RDRG,the effect of the combination of multiple sensitive parameters is greater than that of single parameter superposition and the reduction of error of sensitive parameters can effectively reduce model prediction error which confirmed the importance of sensitive parameters analysis. 展开更多
关键词 parameter sensitivity double GYRE Regional Ocean Modeling System(ROMS) CONDITIONAL Nonlinear Optimal Perturbation(CNOP-P) simulated annealing(SA)algorithm
在线阅读 下载PDF
A blockchain bee colony double inhibition labor division algorithm for spatio-temporal coupling task with application to UAV swarm task allocation 被引量:7
10
作者 WU Husheng LI Hao XIAO Renbin 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2021年第5期1180-1199,共20页
It is difficult for the double suppression division algorithm of bee colony to solve the spatio-temporal coupling or have higher dimensional attributes and undertake sudden tasks.Using the idea of clustering,after clu... It is difficult for the double suppression division algorithm of bee colony to solve the spatio-temporal coupling or have higher dimensional attributes and undertake sudden tasks.Using the idea of clustering,after clustering tasks according to spatio-temporal attributes,the clustered groups are linked into task sub-chains according to similarity.Then,based on the correlation between clusters,the child chains are connected to form a task chain.Therefore,the limitation is solved that the task chain in the bee colony algorithm can only be connected according to one dimension.When a sudden task occurs,a method of inserting a small number of tasks into the original task chain and a task chain reconstruction method are designed according to the relative relationship between the number of sudden tasks and the number of remaining tasks.Through the above improvements,the algorithm can be used to process tasks with spatio-temporal coupling and burst tasks.In order to reflect the efficiency and applicability of the algorithm,a task allocation model for the unmanned aerial vehicle(UAV)group is constructed,and a one-to-one correspondence between the improved bee colony double suppression division algorithm and each attribute in the UAV group is proposed.Task assignment has been constructed.The study uses the self-adjusting characteristics of the bee colony to achieve task allocation.Simulation verification and algorithm comparison show that the algorithm has stronger planning advantages and algorithm performance. 展开更多
关键词 bee colony double inhibition labor division algorithm high dimensional attribute sudden task reforming the task chain task allocation model
在线阅读 下载PDF
Constrained Optimization Algorithm Based on Double Populations 被引量:1
11
作者 Xiaojun B Lei Zhang Yan Cang 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2016年第2期66-71,共6页
In order to improve the distribution and convergence of constrained optimization algorithms,this paper proposes a constrained optimization algorithm based on double populations. Firstly the feasible solutions and infe... In order to improve the distribution and convergence of constrained optimization algorithms,this paper proposes a constrained optimization algorithm based on double populations. Firstly the feasible solutions and infeasible solutions are stored separately through two populations,which can avoid direct comparison between them. The usage of efficient information carried by the infeasible solutions will enlarge exploitation scope and strength diversity of populations. At the same time,adopting the presented concept of constraints domination to update the infeasible set may keep good variety of population and give consideration to convergence. Also the improved mutation operation is employed to further raise the diversity and convergence.The suggested algorithm is compared with 3 state- of- the- art constrained optimization algorithms on standard test problems g01- g13. Simulation results show that the presented algorithm has certain advantages than other algorithms because it can ensure good convergence accuracy while it has good robustness. 展开更多
关键词 CONSTRAINED optimization problems CONSTRAINT HANDLING evolution algorithms double POPULATIONS CONSTRAINT domination.
在线阅读 下载PDF
Relocation of the 1998 Zhangbei-Shangyi earthquake sequence using the double difference earthquake location algorithm 被引量:1
12
作者 YANG Zhi-xian(杨智娴) +1 位作者 CHEN Yun-tai(陈运泰) 《Acta Seismologica Sinica(English Edition)》 CSCD 2004年第2期125-130,共6页
On January 10, 1998, at 11h50min Beijing Time (03h50min UTC), an earthquake of ML=6.2 occurred in the border region between the Zhangbei County and Shangyi County of Hebei Province. This earthquake is the most signifi... On January 10, 1998, at 11h50min Beijing Time (03h50min UTC), an earthquake of ML=6.2 occurred in the border region between the Zhangbei County and Shangyi County of Hebei Province. This earthquake is the most significant event to have occurred in northern China in the recent years. The earthquake-generating structure of this event was not clear due to no active fault capable of generating a moderate earthquake was found in the epicentral area, nor surface ruptures with any predominate orientation were observed, no distinct orientation of its aftershock distribution given by routine earthquake location was shown. To study the seismogenic structure of the Zhangbei- Shangyi earthquake, the main shock and its aftershocks with ML3.0 of the Zhangbei-Shangyi earthquake sequence were relocated by the authors of this paper in 2002 using the master event relative relocation technique. The relocated epicenter of the main shock was located at 41.145癗, 114.462癊, which was located 4 km to the NE of the macro-epicenter of this event. The relocated focal depth of the main shock was 15 km. Hypocenters of the aftershocks distributed in a nearly vertical plane striking 180~200 and its vicinity. The relocated results of the Zhangbei-Shangyi earthquake sequence clearly indicated that the seismogenic structure of this event was a NNE-SSW-striking fault with right-lateral and reverse slip. In this paper, a relocation of the Zhangbei-Shangyi earthquake sequence has been done using the double difference earthquake location algorithm (DD algorithm), and consistent results with that obtained by the master event technique were obtained. The relocated hypocenters of the main shock are located at 41.131癗, 114.456癊, which was located 2.5 km to the NE of the macro-epicenter of the main shock. The relocated focal depth of the main shock was 12.8 km. Hypocenters of the aftershocks also distributed in a nearly vertical N10E-striking plane and its vicinity. The relocated results using DD algorithm clearly indicated that the seismogenic structure of this event was a NNE-striking fault again. 展开更多
关键词 Zhangbei-Shangyi earthquake double difference earthquake location algorithm earthquake relocation seismogenic structure source process
在线阅读 下载PDF
Optimizing the Double Inverted Pendulum′s Performance via the Uniform Neuro Multiobjective Genetic Algorithm 被引量:3
13
作者 Dony Hidayat Al-Janan Hao-Chin Chang +1 位作者 Yeh-Peng Chen Tung-Kuan Liu 《International Journal of Automation and computing》 EI CSCD 2017年第6期686-695,共10页
An inverted pendulum is a sensitive system of highly coupled parameters, in laboratories, it is popular for modelling nonlinear systems such as mechanisms and control systems, and also for optimizing programmes before... An inverted pendulum is a sensitive system of highly coupled parameters, in laboratories, it is popular for modelling nonlinear systems such as mechanisms and control systems, and also for optimizing programmes before those programmes are applied in real situations. This study aims to find the optimum input setting for a double inverted pendulum(DIP), which requires an appropriate input to be able to stand and to achieve robust stability even when the system model is unknown. Such a DIP input could be widely applied in engineering fields for optimizing unknown systems with a limited budget. Previous studies have used various mathematical approaches to optimize settings for DIP, then have designed control algorithms or physical mathematical models.This study did not adopt a mathematical approach for the DIP controller because our DIP has five input parameters within its nondeterministic system model. This paper proposes a novel algorithm, named Uni Neuro, that integrates neural networks(NNs) and a uniform design(UD) in a model formed by input and response to the experimental data(metamodel). We employed a hybrid UD multiobjective genetic algorithm(HUDMOGA) for obtaining the optimized setting input parameters. The UD was also embedded in the HUDMOGA for enriching the solution set, whereas each chromosome used for crossover, mutation, and generation of the UD was determined through a selection procedure and derived individually. Subsequently, we combined the Euclidean distance and Pareto front to improve the performance of the algorithm. Finally, DIP equipment was used to confirm the settings. The proposed algorithm can produce 9 alternative configured input parameter values to swing-up then standing in robust stability of the DIP from only 25 training data items and 20 optimized simulation results. In comparison to the full factorial design, this design can save considerable experiment time because the metamodel can be formed by only 25 experiments using the UD. Furthermore, the proposed algorithm can be applied to nonlinear systems with multiple constraints. 展开更多
关键词 double inverted pendulum(DIP) Uni Neuro-hybrid UD multiobjective genetic algorithm(HUDMOGA) uniform design(UD) metamodel euclidean distance
原文传递
A Vision-based Robotic Navigation Method Using an Evolutionary and Fuzzy Q-Learning Approach
14
作者 Roberto Cuesta-Solano Ernesto Moya-Albor +1 位作者 Jorge Brieva Hiram Ponce 《Journal of Artificial Intelligence and Technology》 2024年第4期363-369,共7页
The paper presents a fuzzy Q-learning(FQL)and optical flow-based autonomous navigation approach.The FQL method takes decisions in an unknown environment and without mapping,using motion information and through a reinf... The paper presents a fuzzy Q-learning(FQL)and optical flow-based autonomous navigation approach.The FQL method takes decisions in an unknown environment and without mapping,using motion information and through a reinforcement signal into an evolutionary algorithm.The reinforcement signal is calculated by estimating the optical flow densities in areas of the camera to determine whether they are“dense”or“thin”which has a relationship with the proximity of objects.The results obtained show that the present approach improves the rate of learning compared with a method with a simple reward system and without the evolutionary component.The proposed system was implemented in a virtual robotics system using the CoppeliaSim software and in communication with Python. 展开更多
关键词 CoppeliaSim evolutionary algorithm fuzzy q-learning optical flow reinforced learning vision-based control navigation
在线阅读 下载PDF
Hydraulic Optimization of a Double-channel Pump's Impeller Based on Multi-objective Genetic Algorithm 被引量:12
15
作者 ZHAO Binjuan WANG Yu +2 位作者 CHEN Huilong QIU Jing HOU Duohua 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2015年第3期634-640,共7页
Computational fluid dynamics(CFD) can give a lot of potentially very useful information for hydraulic optimization design of pumps, however, it cannot directly state what kind of modification should be made to impro... Computational fluid dynamics(CFD) can give a lot of potentially very useful information for hydraulic optimization design of pumps, however, it cannot directly state what kind of modification should be made to improve such hydrodynamic performance. In this paper, a more convenient and effective approach is proposed by combined using of CFD, multi-objective genetic algorithm(MOGA) and artificial neural networks(ANN) for a double-channel pump's impeller, with maximum head and efficiency set as optimization objectives, four key geometrical parameters including inlet diameter, outlet diameter, exit width and midline wrap angle chosen as optimization parameters. Firstly, a multi-fidelity fitness assignment system in which fitness of impellers serving as training and comparison samples for ANN is evaluated by CFD, meanwhile fitness of impellers generated by MOGA is evaluated by ANN, is established and dramatically reduces the computational expense. Then, a modified MOGA optimization process, in which selection is performed independently in two sub-populations according to two optimization objectives, crossover and mutation is performed afterword in the merged population, is developed to ensure the global optimal solution to be found. Finally, Pareto optimal frontier is found after 500 steps of iterations, and two optimal design schemes are chosen according to the design requirements. The preliminary and optimal design schemes are compared, and the comparing results show that hydraulic performances of both pumps 1 and 2 are improved, with the head and efficiency of pump 1 increased by 5.7% and 5.2%, respectively in the design working conditions, meanwhile shaft power decreased in all working conditions, the head and efficiency of pump 2 increased by 11.7% and 5.9%, respectively while shaft power increased by 5.5%. Inner flow field analyses also show that the backflow phenomenon significantly diminishes at the entrance of the optimal impellers 1 and 2, both the area of vortex and intensity of vortex decreases in the whole flow channel. This paper provides a promising tool to solve the hydraulic optimization problem of pumps' impellers. 展开更多
关键词 double-channel pump's impeller multi-objective genetic algorithm artificial neural network computational fluid dynamics(CFD) UNI
在线阅读 下载PDF
Double Optimal Regularization Algorithms for Solving Ill-Posed Linear Problems under Large Noise
16
作者 Chein-Shan Liu Satya N.Atluri 《Computer Modeling in Engineering & Sciences》 SCIE EI 2015年第1期1-39,共39页
A double optimal solution of an n-dimensional system of linear equations Ax=b has been derived in an affine m-dimensional Krylov subspace with m <<n.We further develop a double optimal iterative algorithm(DOIA),... A double optimal solution of an n-dimensional system of linear equations Ax=b has been derived in an affine m-dimensional Krylov subspace with m <<n.We further develop a double optimal iterative algorithm(DOIA),with the descent direction z being solved from the residual equation Az=r0 by using its double optimal solution,to solve ill-posed linear problem under large noise.The DOIA is proven to be absolutely convergent step-by-step with the square residual error ||r||^2=||b-Ax||^2 being reduced by a positive quantity ||Azk||^2 at each iteration step,which is found to be better than those algorithms based on the minimization of the square residual error in an m-dimensional Krylov subspace.In order to tackle the ill-posed linear problem under a large noise,we also propose a novel double optimal regularization algorithm(DORA)to solve it,which is an improvement of the Tikhonov regularization method.Some numerical tests reveal the high performance of DOIA and DORA against large noise.These methods are of use in the ill-posed problems of structural health-monitoring. 展开更多
关键词 ILL-POSED LINEAR equations system double OPTIMAL solution Affine Krylov subspace double OPTIMAL iterative algorithm double OPTIMAL REGULARIZATION algorithm
在线阅读 下载PDF
Assembly Line Balancing Based on Double Chromosome Genetic Algorithm
17
作者 刘俨后 左敦稳 张丹 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2014年第6期622-628,共7页
Aiming at assembly line balancing problem,a double chromosome genetic algorithm(DCGA)is proposed to avoid trapping in local optimum,which is a disadvantage of standard genetic algorithm(SGA).In this algorithm,there ar... Aiming at assembly line balancing problem,a double chromosome genetic algorithm(DCGA)is proposed to avoid trapping in local optimum,which is a disadvantage of standard genetic algorithm(SGA).In this algorithm,there are two chromosomes of each individual,and the better one,regarded as dominant chromosome,determines the fitness.Dominant chromosome keeps excellent gene segments to speed up the convergence,and recessive chromosome maintains population diversity to get better global search ability to avoid local optimal solution.When the amounts of chromosomes are equal,the population size of DCGA is half that of SGA,which significantly reduces evolutionary time.Finally,the effectiveness is verified by experiments. 展开更多
关键词 double chromosome genetic algorithm assembly line balancing mathematical model global optimum
在线阅读 下载PDF
A Routing Algorithm for Distributed Optimal Double Loop Computer Networks
18
作者 Li Layuan(Department of Electrical Engineering and Computer Science.Wuhan University of Water Transportation, Wuhan 430063, P. R. China) 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 1994年第1期37-43,共7页
A routing algorithm for distributed optimal double loop computer networks is proposed and analyzed. In this paper, the routing algorithm rule is described, and the procedures realizing the algorithm are given. The pr... A routing algorithm for distributed optimal double loop computer networks is proposed and analyzed. In this paper, the routing algorithm rule is described, and the procedures realizing the algorithm are given. The proposed algorithm is shown to be optimal and robust for optimal double loop. In the absence of failures,the algorithm can send a packet along the shortest path to destination; when there are failures,the packet can bypasss failed nodes and links. 展开更多
关键词 Computer networks double loop Routing algorithm
在线阅读 下载PDF
Dynamic Self-Adaptive Double Population Particle Swarm Optimization Algorithm Based on Lorenz Equation
19
作者 Yan Wu Genqin Sun +4 位作者 Keming Su Liang Liu Huaijin Zhang Bingsheng Chen Mengshan Li 《Journal of Computer and Communications》 2017年第13期9-20,共12页
In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based o... In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems. 展开更多
关键词 Improved Particle SWARM Optimization algorithm double POPULATIONS MULTI-OBJECTIVE Adaptive Strategy CHAOTIC SEQUENCE
在线阅读 下载PDF
Design and Test Verification of Energy Consumption Perception AI Algorithm for Terminal Access to Smart Grid
20
作者 Sheng Bi Jiayan Wang +2 位作者 Dong Su Hui Lu Yu Zhang 《Energy Engineering》 2025年第10期4135-4151,共17页
By comparing price plans offered by several retail energy firms,end users with smart meters and controllers may optimize their energy use cost portfolios,due to the growth of deregulated retail power markets.To help s... By comparing price plans offered by several retail energy firms,end users with smart meters and controllers may optimize their energy use cost portfolios,due to the growth of deregulated retail power markets.To help smart grid end-users decrease power payment and usage unhappiness,this article suggests a decision system based on reinforcement learning to aid with electricity price plan selection.An enhanced state-based Markov decision process(MDP)without transition probabilities simulates the decision issue.A Kernel approximate-integrated batch Q-learning approach is used to tackle the given issue.Several adjustments to the sampling and data representation are made to increase the computational and prediction performance.Using a continuous high-dimensional state space,the suggested approach can uncover the underlying characteristics of time-varying pricing schemes.Without knowing anything regarding the market environment in advance,the best decision-making policy may be learned via case studies that use data from actual historical price plans.Experiments show that the suggested decision approach may reduce cost and energy usage dissatisfaction by using user data to build an accurate prediction strategy.In this research,we look at how smart city energy planners rely on precise load forecasts.It presents a hybrid method that extracts associated characteristics to improve accuracy in residential power consumption forecasts using machine learning(ML).It is possible to measure the precision of forecasts with the use of loss functions with the RMSE.This research presents a methodology for estimating smart home energy usage in response to the growing interest in explainable artificial intelligence(XAI).Using Shapley Additive explanations(SHAP)approaches,this strategy makes it easy for consumers to comprehend their energy use trends.To predict future energy use,the study employs gradient boosting in conjunction with long short-term memory neural networks. 展开更多
关键词 Energy consumption perception terminal access smart grid AI Model SHAP q-learning algorithm
在线阅读 下载PDF
上一页 1 2 89 下一页 到第
使用帮助 返回顶部