检索结果-内蒙古大学图书馆

4th International Conference on Natural Computation (ICNC 2008)

作者： Jiang, Huilan Jia, Mengdan Lin, Liu Tianjin Univ Minist Educ Key Lab Power Syst Simulat & Control Tianjin 300072 Peoples R China High Voltage power supplied Co Tianjin 3002250 Peoples R China

ISBN: (纸本)9780769533049

This paper presents a voltage/reactive power global optimization control method in the substation by adaptive ant colony algorithm. It can dynamically adjust pheromone updating strategy and probability of paths selection according to the distribution uniformity of solutions in the optimal process. This method, comprehensively considering the voltage of low-voltage side, the reactive at high-voltage side and the constraint of action numbers of capacitors and transformer taps in one day, makes the control strategy used assure that the voltage, reactive and adjusting times of transformer taps and capacitors can achieve their integrated optimality. Take the practical triple-wound substation for instance, the result of simulating it proves the effectiveness of the method which is presented in this paper, and achieves the desired effect.

关键词： voltage and reactive optimization control adaptive ant colony algorithm substation

来源：评论

学校读者我要写书评

暂无评论

Optimization of Air Route Network Nodes to Avoid ″Three Areas″ Based on An adaptive ant colony algorithm

引用

Transactions of Nanjing University of Aeronautics and Astronautics 2016年第4期33卷 469-478页

作者： Wang Shijin Li Qingyun Cao Xi Li Haiyun College of Civil Aviation Nanjing University of Aeronautics and Astronautics

Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe ***,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid *** finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an *** on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided *** optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.

关键词： air route network planning three area avoidance optimization of air route network node adaptive ant colony algorithm grid environment

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Scheduling Method for Logistics Supply Chain Based on adaptive ant colony algorithm

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS 2024年第1期17卷 1-15页

作者： Zhang, Yinxia Wang, Liang Hebei Profess Coll Polit Sci & Law Dept Econ & Trade Law Shijiazhuang 050000 Peoples R China Shijiazhuang Inst Railway Technol Dept Econ Management Shijiazhuang 050000 Peoples R China

To reduce the dynamic scheduling cost of logistics supply chain and improve customer satisfaction, this paper proposes a dynamic scheduling method for logistics supply chain based on adaptive ant colony algorithm. First, determine the goal of dynamic scheduling in the logistics supply chain. Second, considering supplier satisfaction, transportation costs, and maximum delivery distance constraints, a dynamic scheduling model for logistics supply chain is constructed. Then by smoothing the pheromones and designing a transition function, adjusting factors are introduced to update the pheromone rules. Finally, based on the adaptive ant colony algorithm, the solution of the dynamic scheduling function of the logistics supply chain is solved to achieve the dynamic scheduling of the current logistics supply chain. The experimental results show that after 19 iterations, the method can search for the optimal route A1 group with a length of 33.85 km, with fewer iterations and shorter paths. The total cost is 114,290 yuan, and the degree of cargo loss is low, with a maximum of only 0.14%. The task completion time is short, customer satisfaction is above 0.85, and the scheduling accuracy is 99.9%. It can effectively control costs, improve customer satisfaction, and accurately arrange logistics supply chains.

关键词： adaptive ant colony algorithm Logistics supply chain Dynamic scheduling Multiple constraint conditions

来源：评论

学校读者我要写书评

暂无评论

Using adaptive ant colony algorithm optimized BP neural network to identify the DGA fault

Using adaptive ant colony algorithm optimized BP neural netw...

引用

IEEE International Conference of Region 10 (TENCON)

作者： Zhang, Cai-Tian Zhao, An-Xin Henan Econ & Trade Vocat Coll Dept Elect Engn Zhengzhou Peoples R China Xian Univ Sci & Technol Network Ctr Xian Peoples R China

ISBN: (纸本)9781479928255;9781479928279

The BP network uses the rule of local decline to slow convergence speed and easy to fall into local optimum. With the increase of BP input parameters lead to the dimension disaster. Taking into consideration the above problems, Using adaptive ant colony optimization algorithm optimized the training process of BP network referred to as AACOABP. The BP network and the BP network optimized by adaptive ant colony algorithm to (AACOABP) were used to identify the faulty type of the collecting samples about DGA fault test data, AACOABP can make the fault identification accuracy is greatly increased, the recognition accuracy from 50% similar to 75% to 87.5% similar to 100%.

关键词： dissolved gas-in-oil analysis (DGA) fault identification BP neural network adaptive ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on the Shortest Path of Mine Emergency Rescue Based on Path Weight adaptive ant colony algorithm

Research on the Shortest Path of Mine Emergency Rescue Based...

引用

International Conference on Computer-Aided Design, Manufacturing, Modeling and Simulation (CDMMS 2011)

作者： Wang, Kai Jiang, Shuguang Wu, Zhengyan Zou, Wei China Univ Ming & Technol State Key Lab Coal Resource & Safe Ming Xuzhou 221116 Peoples R China

ISBN: (纸本)9783037852361

Finding the shortest path is an important issue of coal mine emergency rescue. In this paper, based on Analytic Hierarchy Process theory, the roadway path weight is calculated, thus, influential factors weight on walking speed by roadway attribute is obtained. The establishment of the roadway equivalent length system constitutes roadway equivalent length adjacency matrix combined with path weight. Using adaptive ant colony algorithm and MATLAB software to simulate local roadway of a coal mine domestic, we get the shortest path in mine emergency rescue system, which is more reasonable and less time needed.

关键词： Mine emergency rescue Analytic Hierarchy Process equivalent length adaptive ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

An adaptive ant colony algorithm for Dynamic Traveling Salesman Problem

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2019年第6期35卷 1263-1277页

作者： Ma, An-Xiang Zhang, Xiao-Hong Zhang, Chang-Sheng Zhang, Bin Gao, Yan Northeastern Univ Sch Comp Sci & Engn Shenyang 110819 Liaoning Peoples R China

Compared with the traditional static traveling salesman problem, it is more practical to study the dynamic traveling salesman problem in dynamic environment. In this paper, the dynamic optimization problem is considered as a combination of a series of static optimization problems, and an adaptive ant colony algorithm is proposed to solve the dynamic traveling salesman problem. When traveling salesman problem changes, we firstly analyze the environmental changing degree of traveling salesman problem, then an adaptive pheromone initialization mechanism adaptable to changing degree is presented, so as to ensure faster convergence speed without affecting the accuracy of problem solving. In addition, to further improve the quality of solution, we propose an optimization guidance based search mechanism and integrate it into the adaptive ant colony algorithm proposed. Finally, the algorithm is analyzed and compared with the related algorithms on several common real data sets. The results show that the adaptive ant colony algorithm proposed in this paper can solve the dynamic traveling salesman problem more effectively.

关键词： ant colony algorithm adaptive ant colony algorithm dynamic traveling sales-man problem optimization guidance

来源：评论

学校读者我要写书评

暂无评论

Research of distribution route optimization based on adaptive ant colony algorithm cloud logistics

Research of distribution route optimization based on adaptiv...

引用

2015 International Industrial Informatics and Computer Engineering Conference(IIICEC 2015)

作者： Zhigao Chen Hu Nan vocational institute of science & technology

Cloud Manufacturing is developed in the cloud computing,which is based on the idea of "Made in service" *** manufacturing mode connect all sorts of manufacturing resources and capability together and form standard manufacturing services which customers can obtain according to their demand at any *** mode should coincide with manufacturing mode for the certain correlation between logistics and manufacturing process,so the production and development of cloud manufacturing mode had the logistics mode *** this paper we present a cloud manufacturing service composition method considering execution reliability based on ant algorithm,to optimize the use of composite service execution path to save the costs.

关键词： Path Optimization adaptive ant colony algorithm Cloud logistics

来源：评论

学校读者我要写书评

暂无评论

Concurrent Design Activities Scheduling Based on adaptive ant colony algorithm

Concurrent Design Activities Scheduling Based on Adaptive An...

引用

第三十届中国控制会议

作者： ZHANG Jinbiao,WANG Jinwen,DUAN Zongyin Department of Mechanical,Tongling University,Tongling 244000,P.R.China

Activities scheduling in concurrent product development process is of great significance to shorten development lead time and minimize the ***,it can eliminate the unnecessary redesign periods and guarantee that serial activities can be executed as concurrently as *** paper presents a constraint satisfaction adaptive ant colony algorithm(AACA) combined approach for concurrent activities *** the combined approach,the heuristic algorithm is used to obtain feasible solutions of the scheduling problem based on sequence and resource(work team) constrains,the ant colony algorithm is used to obtain the solution *** is improved form ant colony algorithm,by the ant path selecting,pheromone intensity updating and mutating *** have shown that the proposed AACA is efficient and feasible with respect to concurrent activities scheduling.

关键词： Concurrent Design Activities Scheduling adaptive ant colony algorithm Constraints Satisfaction

来源：评论

学校读者我要写书评

暂无评论

An adaptive ant colony algorithm for Classification Rule Mining

An Adaptive Ant Colony Algorithm for Classification Rule Min...

引用

2016 2nd International Conference on Artificial Intelligence and Industrial Engineering (AIIE2016)

作者： Xiaomeng Zhang Wensheng Sun School of Information and Communication Engineering Beijing University of Posts and Telecommunications

ISBN: (纸本)9781510835368

ant-Miner algorithm is a typical classification rule mining algorithm which can improve the classification accuracy and generate simple ***,it also has a few disadvantages,such as complicated computing method for heuristic factor,long calculation time,slow evolution and so *** on the ant-Miner algorithm,this paper adjusted the probability of the deterministic selection and the volatility coefficient dynamically and *** not only guarantees the convergence speed but also improves the global search *** verify the effectiveness of the algorithm,we used public database UCI datasets for algorithm *** with the ant-Miner algorithm,the proposed algorithm improves the classification accuracy rate and gives more concise rules.

关键词： data mining adaptive ant colony algorithm classification rule pheromone

来源：评论

学校读者我要写书评

暂无评论

Approximate Inference algorithm based on adaptive ant colony and Artificial Fish Swarm algorithm for Credal Networks

Approximate Inference Algorithm based on Adaptive Ant Colony...

引用

International Conference on Information Science, Automation and Material System

作者： Qu, Ying Zhou, Pang Hebei Univ Sci & Technol Sch Econ & Management Shijiazhuang 050018 Peoples R China Beijing Inst Technol Dept Management & Econ Beijing 100081 Peoples R China Hebei Univ Sci & Technol Shijiazhuang 050018 Peoples R China

ISBN: (纸本)9783037850817

This paper presents a new algorithm for approximate inference in credal networks (that is, models based on directed acyclic graphs and interval-valued probabilities). Approximate inference in credal networks can be considered as multistage decision in this paper. It is looked as combinatorial optimization problems that obtaining the extreme posteriors from the combinations of various vertices in credal networks. Based on this, the paper combines two intelligence swarm algorithms (ant colony algorithm and artificial fish swarm algorithm) to obtain interval posterior probabilities of query variable for the states of given evidence variables.

关键词： Credal network approximate inference adaptive ant colony algorithm artificial fish swarm algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：