提出了一种求解置换流水车间调度的蚁群优化算法。
An ant colony optimization based algorithm for permutation flow shop scheduling was proposed.
针对具有时间窗口和数传资源限制卫星数传调度问题，提出了基于解构造图模型的蚁群优化算法。
For satellite data transmission scheduling problem (SDTSP) restrained with time Windows and resources, ant colony optimization algorithm based on solution construction graph model is proposed.
将该图书仓库布局模型分别基于装箱问题结构和广义指派问题结构，设计了两种不同的蚁群优化算法。
Two different Ant Colony Optimization heuristics based separately on Bin-packing Problem structure and Generalized Assignment Problem structure were designed for Books Warehouse Layout Problem.
在原有标准蚁群算法的基础上采用了新的状态转移规则，讨论了各种不同的轨迹更新规则对仿真结果的影响，并通过统计数据验证了改进型蚁群算法优于标准的蚁群优化算法。
The novel transition rule and the different pheromone reinforcement rules are discussed in this paper when ant colony systems are applied to minimizing the make-span in job shop scheduling problem.
蚁群算法是一种新型的模拟进化算法，为求解复杂的组合优化问题提供了一种新的思路。
Ant colony system is a novel simulated evolutionary algorithm, which provides a new method for complicated combinatorial optimization problems.
蚁群算法是一种新型的模拟进化算法，它通过模拟蚁群在觅食过程中寻找最短路径的方法来求解优化问题。
Ant Colony optimization (ACO) is a new-style simulating evolution algorithm. The behavior of real ant colonies foraging for food is simulated and used for solving optimization problems.
蚁群算法是一种新颖的求解复杂组合优化问题的模拟进化算法，它具有典型的群体智能的特性。
Ant Colony algorithm is a novel simulated evolvement algorithm solving complicated combinatorial optimization problem and its typical feature is swarm intelligence.
本文在介绍求解复杂组合优化问题而提出的蚁群算法的基础上，提出一种基于连续不确定区域的蚁群算法。
A new sequential uncertainty domain method called SUACO is presented on the basis of ant colony optimization, which is adapted to solve complex combination optimization problems.
介绍了一种使用蚁群算法求解矩形件优化排料问题的新方法。
The paper presents a new optimal layout for rectangular part method using ant colony system algorithm.
本文研究了蚁群优化算法在机器人结构空间规划的问题。
Ant colony optimization algorithms are investigated in this paper for robot planning in configuration space.
然后总结了近年来蚁群算法在组合优化、数据挖掘等领域的应用进展；
Then, the recent applications of the ant colony algorithm in discrete optimization, data mining and other field are summarized.
从而证明了蚁群算法应用于天然气输送管道的优化设计是可行的。
So it is proved the ant colony algorithms are feasible in the optimized design of gas transmission pipelines.
并重点讨论了蚁群算法对配送路线的优化。
And especially discusses the optimization of distribution route with ant colony algorithm.
本文提出了一种基于蚁群优化算法求解路径规划问题的新方法及其实现。
This thesis puts forward a new method and implementation for the Path PlanningProblem based on ACOA (Ant Colony Optimization Algorithm).
蚁群算法是基于群体的一种仿生算法，为求解复杂的组合优化问题提供了一种新思路。
Ant algorithm is a kind of population based bionic algorithm, which provides new methods for complex combinatory optimization.
蚁群算法是受自然界蚂蚁觅食过程中，基于信息素的最短路径搜索食物行为启发，提出的一种智能优化算法。
Ant Colony Algorithm (ACA) is an intelligence-optimized algorithm coming from the illumination of food-seeking behavior by ants based on the shortest route of daumone.
蚁群算法是基于群体的一种仿生算法，为求解复杂的组合优化方法问题提供了一种新思路。
The ant algorithm is a class of population based bionic algorithm, which provides new methods for complex combinatorial optimization problem.
目前，群智能理论研究领域有两种主要的算法：微粒群优化算法和蚁群优化算法。
The basic and typical algorithm of swarm intelligence is particle swarm optimization and Ant colony oprimation.
借鉴蚁群优化算法和粒子群优化算法的思想，提出了一种用于求解约束优化问题的连续域蚁群算法。
Using the idea of both ant colony optimization algorithm and particle swam optimization algorithm, a continuous domains ant colony algorithm for solving constrained optimization problem was proposed.
针对蚁群算法在求解连续优化问题上相对较弱的特点，提出了基于网格划分的蚁群算法，将传统的用于求解离散空间优化问题的蚁群算法进行了扩展。
Puts forward a new ACA based on grid division to overcome the weakness of ACA in solving continuous function optimization problem, and expands the discrete space to the continuous space.
利用蚁群算法对物流配送优化问题进行求解，是本文的重点研究问题之一。
It is the point research problems of this paper that applying ant colony algorithm to solve the optimization of logistics distribution routine problem.
为求解该模型，并综合考虑优化质量和通信开销，采用了基于粗粒度模型的并行蚁群算法。
Considering the communication cost and optimization qualities, an ant colony algorithm based on the coarse-grain model is designed to solve the problem of this model.
文章将蚁群算法应用于计划调度的工期-费用优化问题之中，得到一种精确、全面，求解效率高的优化方法。
The paper applies ant colony algorithm to network planning time-cost optimization problems, thereby getting a accurate, comprehensive and efficient solution optimization method.
采用基于动态信息素更新策略的改进蚁群优化算法，在保证优化目标的基础上，迅速收敛并得到最优解，从而提高调度系统的可行性，增强系统稳定性。
Secondly, the algorithm based on the dynamic pheromone updating ensures the quick convergence and the optimal solution, thus improving the feasibility and the stability of the schedule system.
对于连续优化问题，提出了基于蚁群算法思想的求解算法，并与网格法作了比较。
Based on the ant colony optimization idea, a new algorithm for continuous optimization problem is presented.
蚁群算法是一种新型的模拟进化算法，重点始于组合优化问题的求解。
Ant colony algorithm is a brand-new type of simulative evolution algorithm, which focus on its solution to conform optimized question.
蚁群算法是一种新型的模拟进化算法，重点始于组合优化问题的求解。
Ant colony algorithm is a brand-new type of simulative evolution algorithm, which focus on its solution to conform optimized question.
应用推荐