期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到106篇文章
< 1 2 … 6 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Rescheduling of observing spacecraft using fuzzy neural network and ant colony algorithm 认领 引用 被引量：21
1
作者 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
2
作者 叶文 马登武 范洪达 《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
Weapon target assignment problem satisfying expected damage probabilities based on ant colony algorithm 认领 引用 被引量：27
3
作者 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
Optimizing Fresh Logistics Distribution Route Based on Improved Ant Colony Algorithm 认领 引用 被引量：5
4
作者 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
Improved Ant Colony Algorithm for Vehicle Scheduling Problem in Airport Ground Service Support 认领 引用 被引量：5
5
作者 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
Knowledge-Domain Semantic Searching and Recommendation Based on Improved Ant Colony Algorithm 认领 引用 被引量：3
6
作者 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)
Ant Colony Algorithm for Path Planning Based on Grid Feature Point Extraction 认领 引用 被引量：13
7
作者 李二超 齐款款 《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
Planning of a Single Flow Channel in Valve Blocks Based on Additive Manufacturing and the Ant Colony Algorithm 认领 引用 被引量：2
8
作者 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
Research on UAV cloud control system based on ant colony algorithm 认领 引用 被引量：6
9
作者 ZHANG Lanyong ZHANG Ruixuan 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2022年第4期805-811,共7页
In the cloud era, the control objects are becoming larger and the information processing is more complex, and it is difficult for traditional control systems to process massive data in a timely manner. In view of the ... In the cloud era, the control objects are becoming larger and the information processing is more complex, and it is difficult for traditional control systems to process massive data in a timely manner. In view of the difficulty of data processing in the cloud era, it is extremely important to perform massive data operations through cloud servers. Unmanned aeriel vehicle(UAV) control is the representative of the intelligent field. Based on the ant colony algorithm and incorporating the potential field method, an improved potential field ant colony algorithm is designed. To deal with the path planning problem of UAVs, the potential field ant colony algorithm shortens the optimal path distance by 6.7%, increases the algorithm running time by39.3%, and increases the maximum distance by 24.1% compared with the previous improvement. The cloud server is used to process the path problem of the UAV and feedback the calculation results in real time. Simulation experiments verify the effectiveness of the new algorithm in the cloud environment. 展开更多
关键词 ant colony algorithm potential field method cloud server path planning
暂未订购 下载PDF
Path Planning for Lunar Surface Robots Based on Improved Ant Colony Algorithm 认领 引用 被引量：2
10
作者 SONG Ting SUN Yuqi +2 位作者 YUAN Jianping YANG Haiyue WU Xiande 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2022年第6期672-683,共12页
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 mu... 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 space.In 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 mission.The classical ant colony planning algorithm is rewritten utilizing a multi-scale method to address the diverse task problem.Moreover,the path smoothness is also considered to reduce the magnitude of the steering angle.Finally,several typical conditions to verify the efficiency and feasibility of the proposed algorithm are presented. 展开更多
关键词 ant colony algorithm grid map multi scale path smoothing
暂未订购 下载PDF
Multi-group ant colony algorithm based on simulated annealing method 认领 引用 被引量：3
11
作者 朱经纬 芮挺 +1 位作者 廖明 张金林 《Journal of Shanghai University(English Edition)》 2010年第6期464-468,共5页
To overcome the default of single search tendency, the ants in the colony are divided into several sub-groups. The ants in different subgroups have different trail information and expectation coefficients. The simulat... To overcome the default of single search tendency, the ants in the colony are divided into several sub-groups. The ants in different subgroups have different trail information and expectation coefficients. The simulated annealing method is introduced to the algorithm. Through setting the temperature changing with the iterations, after each turn of tours, the solution set obtained by the ants is taken as the candidate set. The update set is obtained by adding the solutions in the candidate set to the previous update set with the probability determined by the temperature. The solutions in the candidate set are used to update the trail information. In each turn of updating, the current best solution is also used to enhance the trail information on the current best route. The trail information is reset when the algorithm is in stagnation state. The computer experiments demonstrate that the proposed algorithm has higher stability and convergence speed. 展开更多
关键词 ant colony algorithm simulated annealing method multi-group candidate set update set
暂未订购 下载PDF
The Study of Extracting River Nets Based on Intelligence Ant Colony Algorithm on MODIS Remote Sensing Images 认领 引用 被引量：2
12
作者 时向勇 李先华 郑成建 《Journal of Donghua University(English Edition)》 EI CAS 2010年第5期673-680,共8页
How to extract river nets effectively is of great significance for water resources investigation,flood forecasting and environmental monitoring,etc.In the paper,combining with ant colony algorithm,a new approach of ex... How to extract river nets effectively is of great significance for water resources investigation,flood forecasting and environmental monitoring,etc.In the paper,combining with ant colony algorithm,a new approach of extracting river nets on moderate-resolution imaging spectroradiometer(MODIS)remote sensing images was proposed through analyzing two general extraction methods of river nets.The experiment results show that river nets can be optimized by ant colony algorithm efficiently,and difference ratio between the experimental vectorgraph and the data of National Fundamental Geographic Information System is down to 8.7%.The proposed algorithm can work for extracting river nets on MODIS remote sensing images effectively. 展开更多
关键词 ant colony algorithm river nets MODIS remote sensing images
暂未订购 下载PDF
Research on Data Routing Model Based on Ant Colony Algorithms 认领 引用 被引量：1
13
作者 龚跃 吴航 +2 位作者 鲍杰 王君军 张艳秋 《Defence Technology（防务技术）》 CAS 2010年第4期269-272,共4页
Improved traditional ant colony algorithms,a data routing model used to the data remote exchange on WAN was presented.In the model,random heuristic factors were introduced to realize multi-path search.The updating mod... Improved traditional ant colony algorithms,a data routing model used to the data remote exchange on WAN was presented.In the model,random heuristic factors were introduced to realize multi-path search.The updating model of pheromone could adjust the pheromone concentration on the optimal path according to path load dynamically to make the system keep load balance.The simulation results show that the improved model has a higher performance on convergence and load balance. 展开更多
关键词 computer software data transmission ant colony algorithm routing model
暂未订购 下载PDF
Ant colony algorithm based on genetic method for continuous optimization problem 认领 引用 被引量：1
14
作者 朱经纬 蒙培生 王乘 《Journal of Shanghai University(English Edition)》 2007年第6期597-602,共6页
A new algorithm is presented by using the ant colony algorithm based on genetic method （ACG） to solve the continuous optimization problem. Each component has a seed set. The seed in the set has the value of componen... A new algorithm is presented by using the ant colony algorithm based on genetic method （ACG） to solve the continuous optimization problem. Each component has a seed set. The seed in the set has the value of component, trail information and fitness. The ant chooses a seed from the seed set with the possibility determined by trail information and fitness of the seed. The genetic method is used to form new solutions from the solutions got by the ants. Best solutions are selected to update the seeds in the sets and trail information of the seeds. In updating the trail information, a diffusion function is used to achieve the diffuseness of trail information. The new algorithm is tested with 8 different benchmark functions. 展开更多
关键词 ant colony algorithm genetic method diffusion function continuous optimization problem.
暂未订购 下载PDF
Time-Based Dynamic Trust Model Using Ant Colony Algorithm 认领 引用 被引量：1
15
作者 TANG Zhuo LU Zhengding LI Kai 《Wuhan University Journal of Natural Sciences》 EI CAS 2006年第6期1462-1466,共5页
The trust in distributed environment is uncertain, which is variation for various factors. This paper introduces TDTM, a model for time-based dynamic trust. Every entity in the distribute environment is endowed with a... The trust in distributed environment is uncertain, which is variation for various factors. This paper introduces TDTM, a model for time-based dynamic trust. Every entity in the distribute environment is endowed with a trust-vector, which figures the trust intensity between this entity and the others. The trust intensity is dynamic due to the time and the inter-operation between two entities, a method is proposed to quantify this change based on the mind of ant colony algorithm and then an algorithm for the transfer of trust relation is also proposed. Furthermore, this paper analyses the influence to the trust intensity among all entities that is aroused by the change of trust intensity between the two entities, and presents an algorithm to resolve the problem. Finally, we show the process of the trusts＇ change that is aroused by the time＇s lapse and the inter-operation through an instance. 展开更多
关键词 dynamic trust ant colony algorithm Inter-operation time-based
暂未订购 下载PDF
Tower crane path planning based on improved ant colony algorithm 认领 引用 被引量：1
16
作者 HE Yumin HU Xiangyang +3 位作者 ZHANG Jinhua YAO Shipeng LIU Difang MEN Xinyan 《Journal of Measurement Science and Instrumentation》 CAS CSCD 2024年第4期509-517,共9页
In order to solve the problem of path planning of tower cranes,an improved ant colony algorithm was proposed.Firstly,the tower crane was simplified into a three-degree-of-freedom mechanical arm,and the D-H motion mode... In order to solve the problem of path planning of tower cranes,an improved ant colony algorithm was proposed.Firstly,the tower crane was simplified into a three-degree-of-freedom mechanical arm,and the D-H motion model was established to solve the forward and inverse kinematic equations.Secondly,the traditional ant colony algorithm was improved.The heuristic function was improved by introducing the distance between the optional nodes and the target point into the function.Then the transition probability was improved by introducing the security factor of surrounding points into the transition probability.In addition,the local path chunking strategy was used to optimize the local multi-inflection path and reduce the local redundant inflection points.Finally,according to the position of the hook,the kinematic inversion of the tower crane was carried out,and the variables of each joint were obtained.More specifically,compared with the traditional ant colony algorithm,the simulation results showed that improved ant colony algorithm converged faster,shortened the optimal path length,and optimized the path quality in the simple and complex environment. 展开更多
关键词 tower crane ant colony algorithm transition probability local path chunking strategy path planning
暂未订购 下载PDF
Research on the Optimum Configuration Strategy for the Adjustable Parameters in Ant Colony Algorithm 认领 引用 被引量：16
17
作者 Haibin Duan Daobo Wang Xiufen Yu 《通讯和计算机（中英文版）》 2005年第9期32-35,共4页
In order to investigate the relative strength and weaknesses of the optimum configuration strategy for the adjustable parameters in the Ant Colony Algorithm （ACA）, series of experiments are conducted in this paper. ... In order to investigate the relative strength and weaknesses of the optimum configuration strategy for the adjustable parameters in the Ant Colony Algorithm （ACA）, series of experiments are conducted in this paper. On the basis of the experimental results presented above, an effective ＂three-step＂ optimum configuration strategy for the adjustable parameters in ACA is drawn. 展开更多
关键词 Ant Colony Algorithm （ACA） Pheromone Optimum Configuration Three-step Adjustable Parameters
暂未订购 下载PDF
AN ANT COLONY ALGORITHM FOR MINIMUM UNSATISFIABLE CORE EXTRACTION 认领 引用 被引量：1
18
作者 Zhang Jianmin Shen Shengyu Li Sikun 《Journal of Electronics(China)》 2008年第5期652-660,共9页
Explaining the causes of infeasibility of Boolean formulas has many practical applications in electronic design automation and formal verification of hardware.Furthermore,a minimum explanation of infeasibility that ex... Explaining the causes of infeasibility of Boolean formulas has many practical applications in electronic design automation and formal verification of hardware.Furthermore,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 applications.However,little attention has been concentrated on extraction of minimum unsatisfiable core.In 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 relationship.Finally,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. 展开更多
关键词 Electronic Design Automation （EDA） Formal verification of hardware Minimum unsatisfiable core Ant colony algorithm Maximal satisfiable subformula
暂未订购 下载PDF
Parallel ant colony algorithm and its application in the capacitated lot sizing problem for an agile supply chain 认领 引用
19
作者 李树刚 吴智铭 庞小红 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2004年第5期573-578,共6页
In order to study the capacitated lot sizing problem for a supply chain of corporate multi-location factories to minimize the total costs of production, inventory and transportation under the system capacity restricti... In order to study the capacitated lot sizing problem for a supply chain of corporate multi-location factories to minimize the total costs of production, inventory and transportation under the system capacity restriction and product due date, while at the same time considering the menu distributed balance, the mathematical programming models are decomposed and reduced from the 3 levels into 2 levels according to the idea of just-in-time production. In order to overcome the premature convergence of ACA (ant colony algorithms), the idea of mute operation is adopted in genetic algorithms and a PACA (parallel ant colony algorithms) is proposed for supply chain optimization. Finally, an illustrative example is given, and a comparison is made with standard BAB (Branch and Bound) and PACA approach. The result shows that the latter is more effective and promising. 展开更多
关键词 multi-location factories supply chain capacitated lot sizing ant colony algorithm
暂未订购 下载PDF
A Routing Algorithm for Risk-Scanning Agents Using Ant Colony Algorithm in P2P Network 认领 引用
20
作者 TANG Zhuo LU Zhengding LI Ruixuan 《Wuhan University Journal of Natural Sciences》 EI CAS 2006年第5期1097-1103,共7页
This paper describes a routing algorithm for risk scanning agents using ant colony algorithm in P2P（peerto peer） network. Every peer in the P2P network is capable of updating its routing table in a real-time way, wh... This paper describes a routing algorithm for risk scanning agents using ant colony algorithm in P2P（peerto peer） network. Every peer in the P2P network is capable of updating its routing table in a real-time way, which enables agents to dynamically and automatically select, according to current traffic condition of the network, the global optimal traversal path. An adjusting mechanism is given to adjust the routing table when peers join or leave. By means of exchanging pheromone intensity of part of paths, the algorithm provides agents with more choices as to which one to move and avoids prematurely reaching local optimal path. And parameters of the algorithm are determined by lots of simulation testing. And we also compare with other routing algorithms in unstructured P2P network in the end. 展开更多
关键词 risk ant colony algorithm P2P
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 6 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈