历史查询   



 为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法，我们为您准备了出自英文原文的大量英语例句，供您参考。 
Based on the state transition rule, the local updating rule and the global updating rule of ant colony algorithm, we propose an improved ant colony algorithm of the leastcost quality of service (QoS) unicast routing.


One final modification must be made to the state transition rule.


Nonuniform CA differ from their uniform counterpart in the state transition rule diversity exhibited by the nonuniform ones.




 WT5BZ]In order to have the cutting tool complete the specific pocket machining efficiently within given boundaries, the existence problem of the intersection between the trimmed offset and Voronoi polygon based on the object oriented Voronoi diagram theory were studied. At the same time, the intersection number determination lemma is also studied in this paper with bottleneck. According to the intersection state transition rule, we present the offset generating and the optimal tool path planning algorithm... WT5BZ]In order to have the cutting tool complete the specific pocket machining efficiently within given boundaries, the existence problem of the intersection between the trimmed offset and Voronoi polygon based on the object oriented Voronoi diagram theory were studied. At the same time, the intersection number determination lemma is also studied in this paper with bottleneck. According to the intersection state transition rule, we present the offset generating and the optimal tool path planning algorithm for pocket machining in linear time with three stacks: Tstack,Istack and Pstack. The above algorithms have been applied to NC machining successfully. And the feasibility and efficiency are fully verified.  基于面向对象的Voronoi图理论 ,研究了整齐等距线与Voronoi多边形的交点存在性问题及在有瓶颈的情况下交点个数的判别定理 ,并根据交点状态变换 (IST)规则 ,应用三种堆栈 (Tstack ,Istack和Pstack) ,以线性的时间复杂度实现了整齐等距线的生成和型腔加工的最优刀具轨迹规划算法。该算法已成功地应用于NC加工中。  A new method for the optimization of continuous problems is proposed based on the forage behavior of real ants,which extends ant colony system.The distribution of pheromone on the continuous space is simulated with normal distribution.A random generator is used with this distribution as the state transition rule to choose the next point to move to,and pheromone is updated by adjusting parameters of the distribution according to the transitions of ant colony.Ants aggregate gradually around the optimal... A new method for the optimization of continuous problems is proposed based on the forage behavior of real ants,which extends ant colony system.The distribution of pheromone on the continuous space is simulated with normal distribution.A random generator is used with this distribution as the state transition rule to choose the next point to move to,and pheromone is updated by adjusting parameters of the distribution according to the transitions of ant colony.Ants aggregate gradually around the optimal food source under the direction of pheromone.Furthermore,the eugenic strategy and mutation strategy are incorporated to enhance the exploitation and exploration of ant colony,and hybrid continuous ant colony system(HCACS) is constructed.The experiments on optimization of test functions show that HCACS well fits for the optimization of continuous problems,and it gains comparative advantages when applied to highdimension complex problems or problems with larger search space.HCACS involves fewer control parameters,which can be set easily.  受生物蚂蚁觅食行为的启发,拓展蚁群系统的性能,以正态分布模拟信息素的密度分布,并以此进行随机数抽样,构成蚁群的状态转移规则。系统将随着蚂蚁的移动调整分布函数,实施信息素更新,蚁群在信息素的引导下逐步向最优食物源聚集。系统还引入优进策略和变异策略,加强局部挖掘和全局探索机制,提高蚁群的寻优能力,构建为混合连续蚁群系统(hybrid continuous ant colony system,HCACS)。经多种经典函数的测试,表明HCACS适用于连续优化问题,性能良好,对于维数较高和搜索空间较宽广的问题,更具优势。HCACS算法的参数较少,设置简单,实用性较强。  An Adaptive Hybrid Ant Colony Algorithm(AHACA) based on the twophase construction procedure of feasible solution was established to solve the Vehicle Routing Problem with Hard Time Window(VRPHTW).There were two phases in the construction of feasible solutions of VRPHTW.In the first phase,ant colony algorithm was applied to construct these subtours and the twophase subtour construction procedure was used in its state transition rule.In the second phase,the subtours were composed of feasible solutions... An Adaptive Hybrid Ant Colony Algorithm(AHACA) based on the twophase construction procedure of feasible solution was established to solve the Vehicle Routing Problem with Hard Time Window(VRPHTW).There were two phases in the construction of feasible solutions of VRPHTW.In the first phase,ant colony algorithm was applied to construct these subtours and the twophase subtour construction procedure was used in its state transition rule.In the second phase,the subtours were composed of feasible solutions by means of the feasibility process of approximate solution which could increase the number of optimal feasible solutions in larger scale.Moreover,to increase the ability of optimization and avoid the stagnation phenomenon,some approaches were introduced into the algorithm such as timewindowbased urgency degree factor and match degree factor,CW saving algorithm and 2opt approach.Experimental results showed that the performance of AHACA was comparable with other metaheuristic algorithms and could be used in practical VRPHTW with sufficient reliability and speed.  为求解有硬时间窗的车辆路径问题,提出了一种基于可行解两阶段构造策略的自适应混合蚁群算法。在第一阶段,用蚂蚁的局部遍历代替传统的全局遍历,每个蚂蚁采用蚁群算法进行局部遍历,构造一个回路,蚂蚁转移采用回路两阶段构路策略;在第二阶段,由前一阶段所构造的回路通过采用近似解可行化策略来组合形成可行解。此外,为提高算法的寻优能力,在转移规则中引入了基于时间窗的紧迫性因子和匹配度因子,并与节约算法和爬山法有机结合。实验结果表明,自适应混和蚁群算法性能优良,能够有效地求解有硬时间窗的车辆路径问题。   << 更多相关文摘 
相关查询  


