Three - dimensional component packing is a combinatorial optimization and np - complete problem . it is difficult to find its exact global optimum 三维布局问题属于组合最优化问题和np完全问题,在一定时间内求其精确全局最优解是相当困难的。
( 4 ) a combinatorial optimization model for process scheme , based on genetic algorithms , is presented , and the corresponding algorithms are designed ( 4 )提出了基于遗传算法的加工方案组合优化方法,建立了加工方案组合优化的数学模型。
The optimization of gear parameters in designing movements of clocks and watches is a combinatorial optimization problem . it is difficult to solve the problem 钟手表机芯设计中齿轮参数的优化设计问题是一个组合优化问题,很难用传统优化方法解决。
Scheduling is one kind of important combinatorial optimization problem , which use some processors , machines or resources to accomplish optimally a batch of given tasks or jobs 排序问题研究的是若干个任务要在一些机器上进行加工,如何安排机器和任务使得某些要求(目标函数)达到最优的问题。
Firstly , the cardinal theories of markov random field , map - mrf based image classification algorithm and the combinatorial optimization methods during its implementation are elaborated 在详细讨论markov随机场基本理论的基础上,论述了基于map - mrf框架的图像分类算法及该算法实现过程中的组合优化问题。
Recently , genetic algorithm has been tyied to resolve variable combinatorial optimization problems , such as job scheduling problem , but but has began just now in vsp 近些年来,人们在用遗传算法解决现实中的各种组合优化问题上进行了探索,如在生产调度问题中的应用,但在车辆调度问题中的应用才刚刚开始。
Some feasible outline schemes of horizontal directional drilling were order - sorted based on the combinatorial optimization of outsourcing parts schemes with standards of evaluation mark , cost and ratio of performance & price 以评价积分、成本和性价比为组合标准,在外购件方案组合优化基础上,对水平定向钻机整机设计方案进行了排序优选。
In the rest of the thesis , we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems . in chapter 2 , we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems 在第二章至第五章中,我们分别研究了四个组合优化问题的近似算法,并给出了它们的性能分析。
Due to the advantage which other method can " t provide , in solving the large space , non - linear , global optimization and other complex problems , this algorithm has got amazing application in task scheduling and combinatorial optimization 该算法在解决大空间、非线性、全局寻优等复杂问题时具有传统方法所不具备的独特优势,使ga在任务调度与组合优化方面取得了较好的应用。
Ant colony optimization ( aco ) algorithm is a nature - inspired metaheuristic algorithm . it has experienced more than 10 years ’ development since it was proposed and has become an efficient tool for solving combinatorial optimization problem 蚁群优化算法是一种基于自然启发的metaheuristic算法,从其提出到现在历经10多年的发展到目前已经成为一种解决组合优化问题的有效工具。
In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.Schrijver, p.