助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[13]条 当前为第1条到13条
 

相关语句
新的启发式算法
    Double-optimization Method—A New Heuristic Algorithm for the VRP
    车辆路线问题的一种新的启发式算法——二重优化法
    Mathematical Model for Bus Scheduling Problem And Its New Heuristic Algorithm
    客车调度问题(BSP)的数学模型及一种新的启发式算法
    For the quadratic network programming problems in practice management and economics,a new optimal direction and a new heuristic algorithm for quadratic network programming are proposed.
    针对现实经济管理活动中常见的二次网络规划问题,给出了二次网络规划基解的一个新的优化方向,并获得了二次网络规划的一个新的启发式算法
    Since 1990s, some scientists put forward a new heuristic algorithm, which is called Ant Colony Optimization Algorithm(ACOA).
    蚁群优化算法是20世纪90年代初才发展起来的一种新的启发式算法
    On the basis of some related work in this area, we present a new heuristic algorithm, called STBMR.
    我们在研究已有算法的基础上,提出一个新的启发式算法,称为STBMR算法。
    As a new heuristic algorithm, Ant Colony Optimization (ACO) algorithm whose main characteristics are positive feedback, distributed computation and constructive greedy heuristic can solve many NP-complete combination optimization problems successfully.
    蚁群算法作为一种新的启发式算法,它具有正反馈、分布式计算以及结构性的贪心启发等特点,使其能够成功地解决许多NP-完全的组合优化问题。
    The paper concerns a new heuristic algorithm for linear multiple-objective programs with 0-1 variables. The algorithm improves the coefficient limitation in old algorithm with new role and assessment standard,which will be suitable for any 0-1 linear multiple -objective programming especially for large scaleplanning.
    提出了一个0-1线性目标规划新的启发式算法.该算法以新的算法准则及评价标准,改进了旧算法中的系数限制,并能通用于任何0-1线性目标规划问题,特别能够有效地解决大规模0-1线性目标规划问题.
    Lot scheduling problem with idle time transfer between processes to minimize mean flow time is very important because to minimize mean flow time is to minimize work in process. But the problem is NP hard and no polynomial algorithm exists to guarantee optimal solution. Based the analysis the mathematical structure of the problem, the paper presents a new heuristic algorithm.
    以极小化平均流程时间为目标的批排序问题是十分重要的,因为极小化平均流程时间等价于极小化平均在制品占用.由于这一问题属于NP-难题,不存在多项式算法保证求得最优解.基于对该问题模型结构分析,本文提出了一个新的启发式算法.计算机模拟结果表明,该算法简便且优度高.
    A new heuristic algorithm(H1) is used to produce initial upper bound of the Lagrangian relaxation of the capacity constraints of CSLLSP.
    对能力约束进行松驰后的Lagrangian问题的求解 ,构造了新的启发式算法 ;
    In this paper we first summarize the exist heuristic algorithms for flow shop problem which the objective is minimize makespan and then on the basis of NEH algorithm, we propose a new heuristic algorithm for flow shop to minimize the makespan.
    对该问题有很多求解目标 ,如最小加工周期 ( min makespan) ,工件的最小平均在系统的停留时间 ( min mean flow tim e)等 . 本文以求解最小加工周期为目标 ,基于目前已知的性能最好的算法 NEH算法的基本思想 ,提出了一种新的启发式算法 -组合指标算法 .
    This paper discusses an equilibrium scheduling problem for dependent tasks in multiprocessors,proves that the scheduling problem is a NP complete problem and presents a new heuristic algorithm to solve the problem.
    本文讨论了多处理机系统中的一种相关任务均衡调度问题 ,证明了该问题是 NP完全问题 ,并给出了一个新的启发式算法
    On the base of describing the optimization of the multicast routing with delay and bandwidth constrained,the paper presents a new heuristic algorithm. Then some experiments have been given to analyze the performances.
    本文分析了网络中基于延时和带宽受限的组播路由优化问题 ,提出了一种新的启发式算法 ,并进行了实验和分析。
    This article proposes a new heuristic algorithm for capacitated P-median problem.
    针对约束P-中位问题的特点,提出了一种新的启发式算法
 

首页上一页1下一页尾页 

 
CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社