最大最小系统

带变异算子的启发式最大最小蚂蚁系统求解流水车间调度问题

Application of heuristic max-min ant system with mutation operator to flow shop scheduling problem

仿真结果表明，该算法搜索到最佳路径平均解比蚂蚁系统和最大最小蚂蚁系统均有缩短。

Simulation results show that this algorithm which searches for the best path average solution is shorter than ant system and max-min ant system .

其中遗传算法分为离散空间和连续空间两种情况来详细讨论，蚁群算法则对环境模型进行了优化得到了适用于实际情况的最大最小蚂蚁系统算法。

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 .

接着针对经济调度模型提出了改进的免疫蚁群算法，在采用最大最小蚂蚁系统的信息素更新策略基础上，融入人工免疫算法，解决了人工蚁群算法初始解的随机性、易停滞等问题。

Then the modified immune ant colony algorithm was put forward aiming at the economic operation model . The artificial immune algorithm was introduced based on the information update strategy of the maximum and minimum the ant system .

主要工作如下：（1）针对基本蚁群算法收敛速度慢的缺点，提出了新的信息素更新机制，同时引入最大最小限制系统。

The main works are as follows : ( 1 ) According to the shortcomings of slow convergence in the basic ant colony algorithm , this thesis proposed a new pheromone update mechanism and added the maximum and minimum limit system .

同时在三个方面对基本蚁群算法进行改进：（1）挥发因子由常数变成变量函数；（2）引入奖惩机制；（3）最大最小蚁群系统。

Simultaneously in three areas to improve the basic ant colony algorithm . ( 1 ) volatile factor from constant to variable functions ;( 2 ) the introduction of the incentive mechanism ;( 3 ) Max Min Ant System ; The corresponding mathematical model .

最大-最小蚂蚁系统（MMAS）具有较强的全局最优解搜索能力，能够有效避免早熟收敛，但收敛速度较慢。

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），而且同时采用信息素的局部更新和全局更新规则，有效避免了陷入局部最优问题。

It can avoid falling into local optimization problem to a certain extent to apply the maximum-the smallest ant system ( MMAS ), during the period of having the ant colony algorithm and to use the local pheromone update and global update rules at the same time .

介绍了一种基于模拟退火策略的最大-最小蚂蚁系统。

A max-min ant system based on simulated annealing is presented .

以最大-最小蚁群系统为基础，为蚁群采用增加了嗅觉分辨能力，应用于粗粒度可配置结构芯片的路由问题。

In the paper , max-min ant system ( MMAS ) added the ability of smell is applied for the routing problem of coarse-grained reconfigurable architecture .

选择最大&最小蚁群系统作为核心控制算法，将有约束条件的问题转化为无约束的数学问题，使问题简单化，为问题的解决提供了便利条件。

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 .