T=题名(书名、题名),A=作者(责任者),K=主题词,P=出版物名称,PU=出版社名称,O=机构(作者单位、学位授予单位、专利申请人),L=中图分类号,C=学科分类号,U=全部字段,Y=年(出版发行年、学位年度、标准发布年)
AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
范例一:(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二:P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016
摘要:An adaptive ant colony algorithm is proposed based on dynamically adjusting the strategy of updating trail information. The algorithm can keep good balance between accelerating convergence and averting precocity and stagnation. The results of function optimization show that the algorithm has good searching ability and high convergence speed. The algorithm is employed to design a neuro-fuzzy controller for real-time control of an inverted pendulum. In order to avoid the combinatorial explosion of fuzzy rules due tσ multivariable inputs, a state variable synthesis scheme is employed to reduce the number of fuzzy rules greatly. The simulation results show that the designed controller can control the inverted pendulum successfully.
摘要:It took that the weight minimum and drive efficiency maximal were as double optimizing target,the optimization model had built the drilling string,and the optimization solution was used of the ant colony algorithm to find in *** a two-layer search of the continuous space ant colony algorithm with overlapping or variation global ant search operation strategy and conjugated gradient partial ant search operation strat- *** experiment indicates that the spiral drill weight reduces 16.77% and transports the efficiency enhance 7.05% through the optimization design,the ant colony algorithm application on the spiral drill optimized design has provided the basis for the system re- search screw coal mine machine.
摘要:Explaining the causes of infeasibility of Boolean formulas has many practical applications in electronic design automation and formal verification of ***,a minimum explanation of infeasibility that excludes all irrelevant information is generally of interest.A smallest-cardinality unsatisfiable subset called a minimum unsatisfiable core can provide a succinct explanation of infea-sibility and is valuable for ***,little attention has been concentrated on extraction of minimum unsatisfiable *** this paper,the relationship between maximal satisfiability and mini-mum unsatisfiability is presented and proved,then an efficient ant colony algorithm is proposed to derive an exact or nearly exact minimum unsatisfiable core based on the ***,ex-perimental results on practical benchmarks compared with the best known approach are reported,and the results show that the ant colony algorithm strongly outperforms the best previous algorithm.
摘要:In the real-world situation,the lunar missions’scale and terrain are different according to various operational regions or worksheets,which requests a more flexible and efficient algorithm to generate task paths.A multi-scale ant colony planning method for the lunar robot is designed to meet the requirements of large scale and complex terrain in lunar *** the algorithm,the actual lunar surface image is meshed into a gird map,the path planning algorithm is modeled on it,and then the actual path is projected to the original lunar surface and *** classical ant colony planning algorithm is rewritten utilizing a multi-scale method to address the diverse task ***,the path smoothness is also considered to reduce the magnitude of the steering ***,several typical conditions to verify the efficiency and feasibility of the proposed algorithm are presented.
摘要:Engineering change management is a special form of problem solving where many rules must be followed to satisfy the requirements of product *** engineering change has great influence on the cycle and the cost of product development,it is necessary to anticipate design changes(DCs)in advance and estimate the influence effectively.A process simulation-based method for engineering change management is proposed incorporating multiple assessment ***,the change propagation model is established,which includes the formulation of change propagation influence,assessment score of DC *** the optimization process of DC solution is introduced based on ant colony optimization(ACO),and an optimization algorithm is detailed to acquire the optimal DC solution ***,a case study of belt conveyor platform is implemented to validate the proposed *** results show that changed requirement of product can be satisfied by multiple DC solutions and the optimal one can be acquired according to the unique characteristics of each solution.
摘要: 1引言 通过考察和研究蚂蚁寻找事物的方法,意大利学者Macro Dorigo等人于1991年提出了蚂蚁系统.该算法具有较好的性能.随后,Macro,Gambardella 又提出了蚁群系统(ACS,ant colony System).该算法的性能较蚂蚁系统又有所提高,但是这种改进算法仍有搜索解的速度慢、容易陷入局部最优等缺点.虽然如此,这种算法仍可较好地解决各种组合优化问题,如TSP问题、QAP问题等.并且已经有人将这种算法用于解决网络路由问题以及电路设计中的元件以及线路布局的问题,取得了很好的结果.然而,蚁群算法求解速度慢、容易陷入局部最优的缺点成为限制它应用范围的瓶颈.因此,不断有人提出改进算法.本文将在简单介绍蚁群算法的基础上,分析这种算法在全局更新规则上的不足,并提出一种新的改进算法.……
地址:宁波市钱湖南路8号浙江万里学院(315100)
Tel:0574-88222222
招生:0574-88222065 88222066
Email:yzb@zwu.edu.cn