期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到8,050篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Quantum-inspired ant algorithm for knapsack problems 认领 引用 被引量：5
1
作者 Wang Honggang Ma Liang +1 位作者 Zhang Huizhen Li Gaoya 《Journal of Systems Engineering and Electronics》 SCIE EI 2009年第5期1012-1016,共5页
The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard.This paper proposes a new algorithm called quantum-inspired ant algorithm(QAA)to solve the knapsack problem.Q... The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard.This paper proposes a new algorithm called quantum-inspired ant algorithm(QAA)to solve the knapsack problem.QAA takes the advantage of the principles in quantum computing,such as qubit,quantum gate,and quantum superposition of states,to get more probabilistic-based status with small colonies.By updating the pheromone in the ant algorithm and rotating the quantum gate,the algorithm can finally reach the optimal solution.The detailed steps to use QAA are presented,and by solving series of test cases of classical knapsack problems,the effectiveness and generality of the new algorithm are validated. 展开更多
关键词 knapsack problem,quantum computing ant algorithm,quantum-inspired ant algorithm.
暂未订购 下载PDF
A DISTRIBUTED QOS ROUTING BASED ON ANT ALGORITHM FOR LEO SATELLITE NETWORK 认领 引用 被引量：7
2
作者 Xu Hui Huang Fei Wu Shiqi 《Journal of Electronics(China)》 2007年第6期765-771,共7页
Low Earth Orbit (LEO) satellites provide short round-trip delays and are becoming in- creasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algor... Low Earth Orbit (LEO) satellites provide short round-trip delays and are becoming in- creasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algorithms. To satisfy the QoS requirements of multimedia applications, satellite routing protocols should consider handovers and minimize their effect on the active connections. A distributed QoS routing scheme based on heuristic ant algorithm is proposed for satisfying delay bound and avoiding link congestion. Simulation results show that the call blocking probabilities of this al- gorithm are less than that of Shortest Path First (SPF) with different delay bound. 展开更多
关键词 Low Earth Orbit （LEO） satellite network Routing Ant algorithm QoS
暂未订购 下载PDF
Multi-Hop Routing Optimization Method Based on Improved Ant Algorithm for Vehicle to Roadside Network 认领 引用 被引量：2
3
作者 Hao Dong Xiaohui Zhao +2 位作者 Liangdong Qu Xuefen Chi Xinyu Cui 《Journal of Bionic Engineering》 SCIE EI CSCD 2014年第3期490-496,共7页
This paper proposes a route optimization method to improve the performance of route selection in Vehicle Ad-hoc Network(VANET).A novel bionic swarm intelligence algorithm,which is called ant colony algorithm,was intro... This paper proposes a route optimization method to improve the performance of route selection in Vehicle Ad-hoc Network(VANET).A novel bionic swarm intelligence algorithm,which is called ant colony algorithm,was introduced into a traditional ad-hoc route algorithm named AODV.Based on the analysis of movement characteristics of vehicles and according to the spatial relationship between the vehicles and the roadside units,the parameters in ant colony system were modified to enhance the performance of the route selection probability rules.When the vehicle moves into the range of several different roadsides,it could build the route by sending some route testing packets as ants,so that the route table can be built by the reply information of test ants,and then the node can establish the optimization path to send the application packets.The simulation results indicate that the proposed algorithm has better performance than the traditional AODV algorithm,especially when the vehicle is in higher speed or the number of nodes increases. 展开更多
关键词 multi-hop routing optimization ant colony algorithm VANET bionic swarm intelligence algorithm
A Shortest-path Routing Based on Ant Algorithm 认领 引用 被引量：1
4
作者 Lianying Min Jinyong Yang 《通讯和计算机（中英文版）》 2005年第9期67-69,74,共3页
In this paper, we first analyze the theory of ant algorithm and its mathematic model, and then we put forward a novel approach to solve the shortest-path routing problem with the ant algorithm. Finally we set up an ex... In this paper, we first analyze the theory of ant algorithm and its mathematic model, and then we put forward a novel approach to solve the shortest-path routing problem with the ant algorithm. Finally we set up an experiment to testify the validity and efficiency of our approach. 展开更多
关键词 Ant Algorithm The Shortest-path Routing
暂未订购 下载PDF
Research on Route Optimization of Battlefield Collection Equipment Based on Improved Ant Algorithm 认领 引用
5
作者 Haigen Yang Wang Sun +2 位作者 Xiao Fu Gang Li Luyang Li 《国际计算机前沿大会会议论文集》 EI 2021年第1期154-162,共9页
Accurate battlefield collection plays a crucial role in the end of thewar. How to effectively improve the ability of accurate battlefield collection hasbecome a hot issue of research. However, the existing support for... Accurate battlefield collection plays a crucial role in the end of thewar. How to effectively improve the ability of accurate battlefield collection hasbecome a hot issue of research. However, the existing support force is limited. Tosolve the problem, an improved ant algorithm is applied to the path optimizationproblem of battlefield collection equipment. A model for solving the collectionpath optimization problem of battlefield collection vehicles was designed, andan example was used to simulate calculations. The final results show that thealgorithm is effective and practical,which improves the army’s ability to accuratelycollect equipment in the modern battlefield. 展开更多
关键词 Ant algorithm Battlefield collection Path optimization Simulation calculation
Fault Self-Healing Cooperative Strategy of New Energy Distribution Network Based on Improved Ant Colony-Genetic Hybrid Algorithm 认领 引用 被引量：1
6
作者 Fengchao Chen Aoqi Mei +2 位作者 Zheng Liu Ruhao Wu Qiwei Li 《Energy Engineering》 EI 2026年第4期247-267,共21页
With the high proportion of new energy access,the traditional fault self-healing mechanism of the distribution network is challenged.Aiming at the demand for fast recovery of new distribution network faults,this paper... With the high proportion of new energy access,the traditional fault self-healing mechanism of the distribution network is challenged.Aiming at the demand for fast recovery of new distribution network faults,this paper proposes a fault self-healing cooperative strategy for the new energy distribution network based on an improved ant colony-genetic hybrid algorithm.Firstly,the graph theory adjacency matrix is used to characterize the topology of the distribution network,and the dynamic positioning of new energy nodes is realized.Secondly,based on the output model and load characteristic model of wind,photovoltaic,and energy storage,a two-layer cooperative self-healing model of the distribution network is constructed.The upper layer is based on the improved depth-breadth hybrid search(DFS-BFS)to divide the island,with the maximum weight load recovery and the minimum number of switching actions as the goal,combined with the load priority to dynamically restore the key load.The lower layer uses the improved ant colony-genetic hybrid algorithm to solve the fault recovery path with the minimum total power loss load and the minimum network loss as the goal,generate the optimal switching sequence,and verify the power flow constraints.Finally,the simulation results based on the IEEE 33-bus system show that the proposed method can guarantee the power supply of key loads in the distribution network with high-tech energy penetration,restore the power supply of more load nodes with the least switching operation,and effectively reduce the line loss,which verifies the effectiveness and superiority of the method. 展开更多
关键词 Fault recovery identification of topology improved ant colony-genetic hybrid algorithm distribution network self-healing
暂未订购 下载PDF
A Load-Balancing Routing Algorithm Based on Ant Colony Optimization and Reinforcement Learning for LEO Satellite Networks 认领 引用
7
作者 Deng Xia Lin Wucheng +3 位作者 Hu Yingxin Hao Miaomiao Chang Le Huang Jiawei 《China Communications》 SCIE EI CSCD 2025年第12期281-294,共14页
Low earth orbit (LEO) satellite networkscan provide wider service coverage and lower latencythan traditional terrestrial networks, which haveattracted considerable attention. However, the unevendistribution of human p... Low earth orbit (LEO) satellite networkscan provide wider service coverage and lower latencythan traditional terrestrial networks, which haveattracted considerable attention. However, the unevendistribution of human population and data trafficon the ground incurs unbalanced traffic load inLEO satellite networks. To this end, we proposea load-balancing routing algorithm for LEO satellitenetworks based on ant colony optimization and reinforcementlearning. In the ant colony algorithm,we improve the pheromone update rule by introducingload-aware heuristic information, e.g., the currentnode transmission overhead, delay and load status, andreinforcement learning-based link quality evaluation.It enables the routing algorithm to select the lightlyloaded node as the next hop to balance the networkload. We simulate and verify the proposed algorithmusing the NS2 simulation platform, and the resultsshow that our algorithm improves the data delivery ratioand throughput while ensuring lower latency andtransmission overhead. 展开更多
关键词 ant colony algorithm low earth orbit(LEO)satellite network reinforcement learning
暂未订购 下载PDF
Rescheduling of observing spacecraft using fuzzy neural network and ant colony algorithm 认领 引用 被引量：21
8
作者 Li Yuqing Wang Rixin Xu Minqiang 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2014年第3期678-687,共10页
This paper aims at rescheduling of observing spacecraft imaging plans under uncertainties. Firstly, uncertainties in spacecraft observation scheduling are analyzed. Then, considering the uncertainties with fuzzy featu... This paper aims at rescheduling of observing spacecraft imaging plans under uncertainties. Firstly, uncertainties in spacecraft observation scheduling are analyzed. Then, considering the uncertainties with fuzzy features, this paper proposes a fuzzy neural network and a hybrid rescheduling policy to deal with them. It then establishes a mathematical model and manages to solve the rescheduling problem by proposing an ant colony algorithm, which introduces an adaptive control mechanism and takes advantage of the information in an existing schedule. Finally, the above method is applied to solve the rescheduling problem of a certain type of earth-observing satellite. The computation of the example shows that the approach is feasible and effective in dealing with uncertainties in spacecraft observation scheduling. The approach designed here can be useful in solving the problem that the original schedule is contaminated by disturbances. 展开更多
关键词 Ant colony algorithm Planning and scheduling Rescheduling Spacecraft observing Uncertainty
暂未订购 下载PDF
Algorithm for Low Altitude Penetration Aircraft Path Planning with Improved Ant Colony Algorithm 认领 引用 被引量：30
9
作者 叶文 马登武 范洪达 《Chinese Journal of Aeronautics》 EI CAS 2005年第4期304-309,共6页
The ant colony algorithm is a new class of population basic algorithm. The path planning is realized by the use of ant colony algorithm when the plane executes the low altitude penetration, which provides a new method... The ant colony algorithm is a new class of population basic algorithm. The path planning is realized by the use of ant colony algorithm when the plane executes the low altitude penetration, which provides a new method for the path planning. In the paper the traditional ant colony algorithm is improved, and measures of keeping optimization, adaptively selecting and adaptively adjusting are applied, by which better path at higher convergence speed can be found. Finally the algorithm is implemented with computer simulation and preferable results are obtained. 展开更多
关键词 ant colony algorithm path planning keeping optimization adaptively adiusting low altitude penetration
暂未订购 下载PDF
Improved Ant Colony-Genetic Algorithm for Information Transmission Path Optimization in Remanufacturing Service System 认领 引用 被引量：12
10
作者 Lei Wang Xu-Hui Xia +2 位作者 Jian-Hua Cao Xiang Liu Jun-Wei Liu 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2018年第6期106-117,共12页
The information transmission path optimization(ITPO) can often a ect the e ciency and accuracy of remanufactur?ing service. However, there is a greater degree of uncertainty and complexity in information transmission ... The information transmission path optimization(ITPO) can often a ect the e ciency and accuracy of remanufactur?ing service. However, there is a greater degree of uncertainty and complexity in information transmission of remanu?facturing service system, which leads to a critical need for designing planning models to deal with this added uncer?tainty and complexity. In this paper, a three?dimensional(3D) model of remanufacturing service information network for information transmission is developed, which combines the physic coordinate and the transmitted properties of all the devices in the remanufacturing service system. In order to solve the basic ITPO in the 3D model, an improved 3D ant colony algorithm(Improved AC) was put forward. Moreover, to further improve the operation e ciency of the algorithm, an improved ant colony?genetic algorithm(AC?GA) that combines the improved AC and genetic algorithm was developed. In addition, by taking the transmission of remanufacturing service demand information of certain roller as example, the e ectiveness of AC?GA algorithm was analyzed and compared with that of improved AC, and the results demonstrated that AC?GA algorithm was superior to AC algorithm in aspects of information transmission delay, information transmission cost, and rate of information loss. 展开更多
关键词 Remanufacturing service Information transmission Path optimization Ant colony algorithm Genetic algorithm
暂未订购 下载PDF
Improved Multi-objective Ant Colony Optimization Algorithm and Its Application in Complex Reasoning 认领 引用 被引量：4
11
作者 WANG Xinqing ZHAO Yang +2 位作者 WANG Dong ZHU Huijie ZHANG Qing 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2013年第5期1031-1040,共10页
The problem of fault reasoning has aroused great concern in scientific and engineering fields.However,fault investigation and reasoning of complex system is not a simple reasoning decision-making problem.It has become... The problem of fault reasoning has aroused great concern in scientific and engineering fields.However,fault investigation and reasoning of complex system is not a simple reasoning decision-making problem.It has become a typical multi-constraint and multi-objective reticulate optimization decision-making problem under many influencing factors and constraints.So far,little research has been carried out in this field.This paper transforms the fault reasoning problem of complex system into a paths-searching problem starting from known symptoms to fault causes.Three optimization objectives are considered simultaneously: maximum probability of average fault,maximum average importance,and minimum average complexity of test.Under the constraints of both known symptoms and the causal relationship among different components,a multi-objective optimization mathematical model is set up,taking minimizing cost of fault reasoning as the target function.Since the problem is non-deterministic polynomial-hard(NP-hard),a modified multi-objective ant colony algorithm is proposed,in which a reachability matrix is set up to constrain the feasible search nodes of the ants and a new pseudo-random-proportional rule and a pheromone adjustment mechinism are constructed to balance conflicts between the optimization objectives.At last,a Pareto optimal set is acquired.Evaluation functions based on validity and tendency of reasoning paths are defined to optimize noninferior set,through which the final fault causes can be identified according to decision-making demands,thus realize fault reasoning of the multi-constraint and multi-objective complex system.Reasoning results demonstrate that the improved multi-objective ant colony optimization(IMACO) can realize reasoning and locating fault positions precisely by solving the multi-objective fault diagnosis model,which provides a new method to solve the problem of multi-constraint and multi-objective fault diagnosis and reasoning of complex system. 展开更多
关键词 fault reasoning ant colony algorithm Pareto set multi-objective optimization complex system
暂未订购 下载PDF
Weapon target assignment problem satisfying expected damage probabilities based on ant colony algorithm 认领 引用 被引量：27
12
作者 Wang Yanxia Qian Longjun +1 位作者 Guo Zhi Ma Lifeng 《Journal of Systems Engineering and Electronics》 SCIE EI 2008年第5期939-944,共6页
A weapon target assignment(WTA)model satisfying expected damage probabilities with an ant colony algorithm is proposed.In order to save armament resource and attack the targets effectively,the strategy of the weapon a... A weapon target assignment(WTA)model satisfying expected damage probabilities with an ant colony algorithm is proposed.In order to save armament resource and attack the targets effectively,the strategy of the weapon assignment is that the target with greater threat degree has higher priority to be intercepted.The effect of this WTA model is not maximizing the damage probability but satisfying the whole assignment result.Ant colony algorithm has been successfully used in many fields,especially in combination optimization.The ant colony algorithm for this WTA problem is described by analyzing path selection,pheromone update,and tabu table update.The effectiveness of the model and the algorithm is demonstrated with an example. 展开更多
关键词 weapon target assignment ant colony algorithm optimization.
暂未订购 下载PDF
Ant colony ATTA clustering algorithm of rock mass structural plane in groups 认领 引用 被引量：13
13
作者 李夕兵 王泽伟 +1 位作者 彭康 刘志祥 《Journal of Central South University》 SCIE EI CAS 2014年第2期709-714,共6页
Based on structural surface normal vector spherical distance and the pole stereographic projection Euclidean distance,two distance functions were established.The cluster analysis of structure surface was conducted by ... Based on structural surface normal vector spherical distance and the pole stereographic projection Euclidean distance,two distance functions were established.The cluster analysis of structure surface was conducted by the use of ATTA clustering methods based on ant colony piles,and Silhouette index was introduced to evaluate the clustering effect.The clustering analysis of the measured data of Sanshandao Gold Mine shows that ant colony ATTA-based clustering method does better than K-mean clustering analysis.Meanwhile,clustering results of ATTA method based on pole Euclidean distance and ATTA method based on normal vector spherical distance have a great consistence.The clustering results are most close to the pole isopycnic graph.It can efficiently realize grouping of structural plane and determination of the dominant structural surface direction.It is made up for the defects of subjectivity and inaccuracy in icon measurement approach and has great engineering value. 展开更多
关键词 rock mass discontinuity cluster analysis ant colony ATTA algorithm distance function Silhouette index
暂未订购 下载PDF
Optimizing Fresh Logistics Distribution Route Based on Improved Ant Colony Algorithm 认领 引用 被引量：5
14
作者 Daqing Wu Ziwei Zhu +1 位作者 Dong Hu Romany Fouad Mansour 《Computers, Materials & Continua》 SCIE EI 2022年第10期2079-2095,共17页
With the rapid development of the fresh cold chain logistics distribution and the prevalence of low carbon concept,this paper proposed an optimization model of low carbon fresh cold chain logistics distribution route ... With the rapid development of the fresh cold chain logistics distribution and the prevalence of low carbon concept,this paper proposed an optimization model of low carbon fresh cold chain logistics distribution route considering customer satisfaction,and combined with time,space,weight,distribution rules and other constraints to optimize the distribution model.At the same time,transportation cost,penalty cost,overloading cost,carbon tax cost and customer satisfaction were considered as the components of the objective function,and the thought of cost efficiency was taken into account,so as to establish a distribution model based on the ratio of minimum total cost to maximum satisfaction as the objective function.Then,the improved A∗algorithm and ant colony algorithm were used to construct the model solution.Through the simulation analysis results of different calculation examples,the effectiveness,efficiency and correctness of the design of the single target low-carbon fresh agricultural products cold chain model by using the improved ant colony algorithm were verified. 展开更多
关键词 Carbon tax cost vehicle routing problem cold chain ant colony algorithm
暂未订购 下载PDF
Planning of a Single Flow Channel in Valve Blocks Based on Additive Manufacturing and the Ant Colony Algorithm 认领 引用 被引量：3
15
作者 Jin Zhang Ziyang Li +3 位作者 Yuying Zhang Yandong Liu Ying Li Xiangdong Kong 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2024年第5期191-202,共12页
As electro-hydrostatic actuator(EHA)technology advances towards lightweight and integration,the demand for enhanced internal flow pathways in hydraulic valve blocks intensifies.However,owing to the constraints imposed... As electro-hydrostatic actuator(EHA)technology advances towards lightweight and integration,the demand for enhanced internal flow pathways in hydraulic valve blocks intensifies.However,owing to the constraints imposed by traditional manufacturing processes,conventional hydraulic integrated valve blocks fail to satisfy the demands of a more compact channel layout and lower energy dissipation.Notably,the subjectivity in the arrangement of internal passages results in a time-consuming and labor-intensive process.This study employed additive manufacturing technology and the ant colony algorithm and B-spline curves for the meticulous design of internal passages within an aviation EHA valve block.The layout environment for the valve block passages was established,and path optimization was achieved using the ant colony algorithm,complemented by smoothing using B-spline curves.Three-dimensional modeling was performed using SolidWorks software,revealing a 10.03%reduction in volume for the optimized passages compared with the original passages.Computational fluid dynamics(CFD)simulations were performed using Fluent software,demonstrating that the algorithmically optimized passages effectively prevented the occurrence of vortices at right-angled locations,exhibited superior flow characteristics,and concurrently reduced pressure losses by 34.09%-36.36%.The small discrepancy between the experimental and simulation results validated the efficacy of the ant colony algorithm and B-spline curves in optimizing the passage design,offering a viable solution for channel design in additive manufacturing. 展开更多
关键词 Hydraulic valve block Flow channel B-spline curve Additive manufacturing Ant colony algorithm
暂未订购 下载PDF
Improved Ant Colony Algorithm for Vehicle Scheduling Problem in Airport Ground Service Support 认领 引用 被引量：5
16
作者 Yaping Zhang Ye Chen +2 位作者 Yu Zhang Jian Mao Qian Luo 《Journal of Harbin Institute of Technology(New Series)》 CAS 2023年第1期1-12,共12页
Support vehicles are part of the main body of airport ground operations,and their scheduling efficiency directly impacts flight delays.A mathematical model is constructed and the responsiveness of support vehicles for... Support vehicles are part of the main body of airport ground operations,and their scheduling efficiency directly impacts flight delays.A mathematical model is constructed and the responsiveness of support vehicles for current operational demands is proposed to study optimization algorithms for vehicle scheduling.The model is based on the constraint relationship of the initial operation time,time window,and gate position distribution,which gives an improvement to the ant colony algorithm(ACO).The impacts of the improved ACO as used for support vehicle optimization are compared and analyzed.The results show that the scheduling scheme of refueling trucks based on the improved ACO can reduce flight delays caused by refueling operations by 56.87%,indicating the improved ACO can improve support vehicle scheduling.Besides,the improved ACO can jump out of local optima,which can balance the working time of refueling trucks.This research optimizes the scheduling scheme of support vehicles under the existing conditions of airports,which has practical significance to fully utilize ground service resources,improve the efficiency of airport ground operations,and effectively reduce flight delays caused by ground service support. 展开更多
关键词 airport surface traffic ground service support vehicle scheduling topology model improved ant colony algorithm response value
暂未订购 下载PDF
Ant Colony Algorithm for Path Planning Based on Grid Feature Point Extraction 认领 引用 被引量：13
17
作者 李二超 齐款款 《Journal of Shanghai Jiaotong university(Science)》 EI 2023年第1期86-99,共14页
Aimed at the problems of a traditional ant colony algorithm,such as the path search direction and field of view,an inability to find the shortest path,a propensity toward deadlock and an unsmooth path,an ant colony al... Aimed at the problems of a traditional ant colony algorithm,such as the path search direction and field of view,an inability to find the shortest path,a propensity toward deadlock and an unsmooth path,an ant colony algorithm for use in a new environment is proposed.First,the feature points of an obstacle are extracted to preprocess the grid map environment,which can avoid entering a trap and solve the deadlock problem.Second,these feature points are used as pathfinding access nodes to reduce the node access,with more moving directions to be selected,and the locations of the feature points to be selected determine the range of the pathfinding field of view.Then,based on the feature points,an unequal distribution of pheromones and a two-way parallel path search are used to improve the construction efficiency of the solution,an improved heuristic function is used to enhance the guiding role of the path search,and the pheromone volatilization coefficient is dynamically adjusted to avoid a premature convergence of the algorithm.Third,a Bezier curve is used to smooth the shortest path obtained.Finally,using grid maps with a different complexity and different scales,a simulation comparing the results of the proposed algorithm with those of traditional and other improved ant colony algorithms verifies its feasibility and superiority. 展开更多
关键词 ant colony algorithm mobile robot path planning feature points Bezier curve grid map
暂未订购 下载PDF
Global optimal path planning for mobile robot based onimproved Dijkstra algorithm and ant system algorithm 认领 引用 被引量：23
18
作者 谭冠政 贺欢 Aaron Sloman 《Journal of Central South University of Technology》 2006年第1期80-86,共7页
A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK ... A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning. 展开更多
关键词 mobile robot global optimal path planning improved Dijkstra algorithm ant system algorithm MAKLINK graph free MAKLINK line
暂未订购 下载PDF
Knowledge-Domain Semantic Searching and Recommendation Based on Improved Ant Colony Algorithm 认领 引用 被引量：3
19
作者 Mingyang Liu Shufen Liu +2 位作者 Xiaoyan Wang Ming Qu Changhong Hu 《Journal of Bionic Engineering》 SCIE EI CSCD 2013年第4期532-540,共9页
To obtain accurate search results and advocate the use of human effort in discovering knowledge,we propose a method based on Ant Colony Algorithm(ACA).The proposed method simulates the behavior of ants searching for f... To obtain accurate search results and advocate the use of human effort in discovering knowledge,we propose a method based on Ant Colony Algorithm(ACA).The proposed method simulates the behavior of ants searching for food.Specific features such as the behavior of ants searching for food,their established search paths,and the ant"neighborhood"profile are investigated.The investigation results reveal that the behavior of people searching for useful information resembles that of ants searching for food.We also use semantic annotation and the decreasing matrix dimension approach to accelerate the food searching process an.d shorten the distance between the query starting points and the ultimate answers.A user behavior model is constructed based on personal and domain ontologies.Experimental evaluation with the enhanced ACA has two parts:(1)estimating the efficiency of information retrieval with user interests considered and(2)identifying how to weigh usage and rate user data during recommendation. 展开更多
关键词 Ant Colony Algorithm(ACA) search ontology Knowledge Advantage Machine(KaM) Collaborative Filtering(CF) Singular Value Decomposition(SVD)
Satellite Constellation Design with Adaptively Continuous Ant System Algorithm 认领 引用 被引量：7
20
作者 He Quan Han Chao 《Chinese Journal of Aeronautics》 SCIE EI CAS 2007年第4期297-303,共7页
The ant system algorithm(ASA)has proved to be a novel meta-heuristic algorithm to solve many multivariable problems.In this paper,the earth coverage of satellite constellation is analyzed and a n+1^-fold coverage rate... The ant system algorithm(ASA)has proved to be a novel meta-heuristic algorithm to solve many multivariable problems.In this paper,the earth coverage of satellite constellation is analyzed and a n+1^-fold coverage rate is put forward to evaluate the coverage performance of a satellite constellation.An optimization model of constellation parameters is established on the basis of the coverage performance.As a newly developed method,ASA can be applied to optimize the constellation parameters.In order to improve the ASA,a rule for adaptive number of ants is proposed,by which the search range is obviously enlarged and the convergence speed increased.Simulation results have shown that the ASA is more quick and efficient than other methodV211.71s. 展开更多
关键词 ant system algorithm satellite constellation optimization design coverage performance adaptive adjusting
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈