Aggregate Homotopy Methods for Solving a Kind of Constrained Sequential Max-Min Problems; Homotopy method for getting a local minimum of unconstrained non-convex programming 同伦方法求解无约束非凸优化问题的局部极小
Max-min ant system ( MMAS) has great ability of searching the whole best solution and availability of avoiding premature convergence, but at the same time there is defect of slow speed of convergence. 最大-最小蚂蚁系统(MMAS)具有较强的全局最优解搜索能力,能够有效避免早熟收敛,但收敛速度较慢。
A max-min ant system based on simulated annealing is presented. 介绍了一种基于模拟退火策略的最大-最小蚂蚁系统。
A novel method for Robot's path planning based on ant max-min ant system 一种新的基于MMAS的机器人路径规划方法
An Efficient Algorithm for Solving Inverse Max-min Eigenvalue Problem of Symmetric Arrow-head Matrices 对称箭形矩阵最大最小特征对的逆特征值问题的一个有效算法
MAX-MIN Ant System and its Convergence MAX-MIN蚂蚁系统算法及其收敛性证明
Using Pareto dominance relationship among individuals and max-min distance density, the algorithm improves the selection operation of differential evolution, ensures the convergence of the algorithm, and realizes the solution of multi-objective optimization problems by differential evolution. 并根据个体间的Pareto支配关系和极大极小距离密度改进了微分进化的选择操作,保证了算法的收敛性,实现了利用微分进化算法求解多目标优化问题。
In addition, the max-min method, linear weighting method and the distance method of fuzzy optimization theory have been applied to solve the multi-objective problem. 同时应用结构模糊优化理论中的最大量小法,线性加权法及贴近度法解决多目标优化问题。
This paper proposes an ant colony optimization algorithm for bottleneck travelling salesman problem, which combines a local search mechanism and a MAX-MIN strategy. Series of problem instances are solved through micro-computers that give satisfactory results. 对瓶颈TSP问题给出了一种融合局部搜索机制和MAX-MIN策略的蚂蚁优化算法,在通用微机上求解了一系列实例问题,获得了满意的效果。
An analytical model of fuzzy closed-loop systems is presented by analyzing the MAX-MIN compositional operator in fuzzy systems, and based on the theory of fuzzy sets, the method to analyze the stability of fuzzy control systems with the relation matrix if fuzzy systems is proposed. 本文在分析模糊控制系统推理机制的基础上,给出了模糊控制系统的闭环分析模型,并利用其模糊关系矩阵,在模糊集合理论基础上,提出了模糊闭环控制系统稳定的充分和必要条件。
In this paper, we first introduce the max-min fairness and proportional fairness based on a wide area network model. Then we design an optimal rate iteration algorithm through the utility function approach. 根据一广域网模型,介绍了带宽分配的最大&最小公平性和比例公平性,并采用效用函数方法设计了一种带宽分配的最优速率迭代算法。
At last, a centralized algorithm to solve the generalized multi-rate multicast weight-based fair rate allocation problem is presented, and its correctness is also proved. 最后给出了一个解决通用多速率组播加权Max-Min公平速率分配问题的集中式算法,并证明了该算法的正确性。
Based on the model, the concept of generalized multi-rate multicast weight-based max-min fairness is defined, and the theory of generalized multi-rate multicast weight-based max-min fair rate allocation is established. 在此基础上,定义了通用多速率组播加权Max-Min公平概念,建立了通用多速率组播加权Max-Min公平速率分配基本理论。
We propose three strategies called max-max, max-sum and max-min to select the best combination. 本文讨论了三种选择策略:max-max,max-sum和max-min。
In this paper, new definitions for the fuzzy subsets of input variables and output variables of fuzzy controller are given. 本文提出了一种新的输入变量和输出变量模糊子集的定义方法,利用Zadeh的max-min推理合成算法得到了一种通用的模糊逻辑控制算法。
By max-min difference and variance analysis, the remarkably influencing factors of each judging target were finded out. 并对试验所测的基础数据进行了极差分析和方差分析,找出了各个指标的显著性影响因素。
MAX-MIN ant system algorithm is one of the best approaches to resolve the traveling salesman problem and the quadratic assignment problem. MAX-MIN蚂蚁系统算法是解决旅行商问题及二次分配问题的最好方法之一。
Application of max-min fair rates allocation algorithm in layered multicast 分层组播中maxmin公平速率分配算法的运用
Nonlinear max-min systems consist in many real systems such as communication networks, digital circuits, manufacturing plants, etc. 非线性极大极小系统是用极大极小函数描述的离散事件动态系统,为通讯网络、数字电路、制造等真实系统提供了实用的模型。
So this paper proposed multipath routing algorithm based on the ACS ant colony algorithm, and combined the ant-net algorithm and the max-min ant colony, algorithm. 因此,本文基于ACS蚁群算法,并结合ant-net算法、max-min蚁群算法,提出了一种多路径路由算法。
Simulation results show that this algorithm which searches for the best path average solution is shorter than ant system and max-min ant system. 仿真结果表明,该算法搜索到最佳路径平均解比蚂蚁系统和最大最小蚂蚁系统均有缩短。
In this paper, Max-Min Ant Colony System is taken as the main algorithm for this system, which can transform problems with constrains to problems without constrains and simplify problem, so that makes great conveniences for solving problems. 选择最大&最小蚁群系统作为核心控制算法,将有约束条件的问题转化为无约束的数学问题,使问题简单化,为问题的解决提供了便利条件。
The max-min bandwidth fairness allocation in HWNs is NP-hard problem, so an approximation algorithm of polynomial-time is designed to obtain suboptimal result. 异构无线网络中取得max-min公平带宽分配是一个NP-hard问题,设计了多项式时间算法来获得次优的近似解。
To solve this problem, we propose an ant colony optimization algorithm. It is a MAX-MIN ant system combined with a post-optimization procedure, which is implemented in the hyper-cube framework. 构建了求解问题的蚁群优化算法,该算法是一个集成了后优化过程的在超立方框架下执行的MAX-MIN蚂蚁系统。
An improving of ant colony algorithm is applied by adding 'initial nodes switch operator' and 'ants out' strategy to the MAX-MIN ant colony algorithm. 在最大最小蚁群算法的基础上,通过引入初始节点开关算子和淘汰蚂蚁的策略,对蚁群算法做了进一步改进。
Aimed at any overlay multicast tree, we proposed a rate allocation algorithm based on receivers under max-min fairness. 主要内容包括:1、针对任意一棵已经存在的Overlay组播树,研究max-min公平性条件下的基于接收端的速率分配算法。
A dynamic adaptive Max-Min ant colony algorithm is proposed by this paper. 本文提出了一种动态自适应最大最小蚁群算法。
The dissertation makes a systematic analysis of the convergence, fault-tolerance, and storage capacity for max-min and max-product FAM. Some improved algorithms are proposed, and the results are generalized to max-T norm FAM. 本文系统地分析了最大-最小与最大-乘积FAM网络的收敛性、容错性和记忆容量等问题,提出了一些改进算法,并将其结果推广到最大-T模FAM网络。
Genetic algorithms are discussed in two areas: discrete space and continuous space. Max-Min Ant System algorithm, which could be used in real soccer robot system by optimizing the environment model, is introduced. 其中遗传算法分为离散空间和连续空间两种情况来详细讨论,蚁群算法则对环境模型进行了优化得到了适用于实际情况的最大最小蚂蚁系统算法。
By setting weighing value for each data stream, this algorithm can realize Max-Min fair allocation with multi-priority. 通过设置各个流的权重,该算法可以实现多优先级的Max-Min公平分配。