1) line-up competition algorithm
列队竞争算法
1.
Solving scheduling of multiproduct batch processes with line-up competition algorithm;
列队竞争算法求解多产品间歇生产过程排序问题
2.
Application of line-up competition algorithm to optimization of variable weight tree pipe network;
基于列队竞争算法的变权值树状管网优化布置
3.
A novel stochastic optimization technique based on line-up competition algorithm(LCA),a simple evolutionary algorithm,was proposed in this paper to overcome this difficulty,and herein selection strategy and mutation are introduced.
由于组合爆炸特性,多目的厂的调度问题很难求解大规模甚至中等规模的问题,本研究采用一种新的随机型进化搜索算法———列队竞争算法对该问题进行求解,引入新的选择策略和变异方法。
3) procession-competition evolutionary algorithm
立队竞争演化算法
1.
Aiming at the minimized cost,the algorithm is based on the procession-competition evolutionary algorithm to find a multicast routing tree involving the branches to constrain delay,delay jitter,bandwidth,error-rate in association with cost optimization,thus solving integrally the problem to assign routing and wavelength in a single process with network load balancing also taken into account.
该算法以最小化费用为目标,基于立队竞争演化算法,寻找一棵延迟、延迟抖动、带宽及出错率受限且费用优化的组播路由树,一体化解决路由与波长分配问题,同时兼顾网络负载均衡。
5) competitive algorithm
竞争算法
1.
On-Line Problem of Dealing with Accident Products and Its Competitive Algorithms;
局内故障产品处理问题与竞争算法
2.
The concepts of competitive algorithm are introduced and competitive algorithm for on line multiprocessor scheduling is obtained.
介绍了局内问题的竞争算法,给出了多种任务加工表局内问题的竞争算法,估计了竞争率,并且证明了2-1m是该竞争算法竞争率的最好上界,其中m是机器台数。
3.
The on_line problem and the competitive algorithm try to explore a strategy which can produce a solution that is in a certain range proportional to the optimal solution for a given problem even in the worst cases.
局内问题与竞争算法则是针对特定的优化问题提出一种策略,对已知条件变化的每一个特例都能给出一个方案,使得该方案的解离最优方案的解总在一定的比例之内。
6) Queue algorithm
队列算法
补充资料:列队
排列成队伍:~游行 ㄧ群众~欢迎贵宾。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条