optimization problem造句

1、Layout problem is a combinatory optimization problem.

2、It is a typical combinatorial optimization problem.

3、The third stage is the optimization problem.

4、Scheduling problem is an important combination optimization problem.

5、The maximum flow problem is a classical combinatorial optimization problem.

6、In the optimization problem, the more common is combinatorial optimization problem.

7、Minimax problem is a kind of important optimization problems.

8、Advanced evolutionary algorithm used in multi-objective constrained optimization problem

9、The scheduling of logistic processes is a combinatorial optimization problem.

10、The assignment problem is a kind of combinatorial optimization problems.

11、Network reconfiguration is a multi-objective nonlinear combinatorial optimization problem.

12、According to the description of the optimization problem, it presents the differences between the robust optimization and the deterministic optimization.

13、Topology optimization of a continuum structure is essentially a 0-1 discrete variable optimization problem.

14、The problem of resource allocation in this scheme is a non-convex non-linear optimization problem.

15、Layout problem is an important offshoot of Operation Research; it belongs to complex combinatorial optimization problem.

16、Binary code usually deals with searching for optimization in Genetic Algorithms(GA). BCD code is used to solve optimization problem.

17、Multimethod collaborative optimization algorithm based on serial collaboration is advanced to get better global optima of complex optimization problem.

18、Formulate the optimization problem. Select and apply an appropriate optimization technique after some initial sampling of the design space.

19、Immune algorithm is a new optimization algorithm imitating the immune system to solve the multi-modal function optimization problem.

20、Reactive power optimization is a main measure of power grid optimization and its nature is a multi-object and nonlinear mixed optimization problem.

21、The cast grouping and ordering problem of steelmaking continuous casting hot rolling (SM-CC) is a combinatorial optimization problem.

22、A maximum profit flows (MPF) problem is a network optimization problem aiming to get maximum transport profit.

23、Distribution network reconfiguration is a multi - objective , multi - constraint, discrete nonlinear combinatory optimization problem.

24、Experimental results show that the approach is effective for energy-constrained prefetching optimization problem.

25、Variational method could naturally convert complex segmentation into a variational functional optimization problem.

26、The maximum flow problem is one of the classical combinatorial optimization problems.

27、Solving Traveling Salesman problem (TSP) is an important problem in Genetic Algorithm's Application, it is an optimization problem of the TSP path encoding in essence.

28、Abstr: in evolutionary structural optimization (ESO) method, evolutionary step length of element density is one of key factors to obtain global optimal solution of optimization problem.

29、IMSP and PPIGA have been combined to solve the optimization problem of the displacement restrictor parameters, which is significant for the optimization design of the shock isolation system.

30、The tabu search (TS) method is one of the modern optimization algorithms developed from local search. It is generally used in combinatorial optimization problem.

31、An optimal apportionment of reliability problem of complex system is a nonlinear optimization problem with a large number of local extreme values.

32、The proposed method transfers the real factorization problem into a numeric optimization problem, which is solved by an evolutionary algorithm based on hybrid crossovers and intermittent mutation.

33、Distribution system planning is a complicated combinatorial optimization problem, which is characterized by multi-constrains, non-linearity and discreteness.

34、The non linear optimization problem with constraint has been solved by use of the sequential unconstrained minimization technique (SUMT).

35、Regarding the workshop technique of manufacture, the swarm intelligence algorithms are used to solve the facility layout optimization problem.

36、Essentially, optimal reactive power dispatch is the multi-restraint overall optimization problem with plentiful local minima and discrete variables.

37、In this paper, a new auxiliary function with one parameter on box constrained for escaping the current local minimizer of global optimization problem is proposed.

38、1. A tight semidefinite relaxation of the quadratically constrained quadratic -11 optimization problem is obtained, which improves several previous SDP relaxations in the literature.

39、The optimization problem of constructing a K-edge-connected directed graph from any given directed graph by adding a minimum set of edges is studied.

40、GA to solve constrained optimization problem is searching the feasibility answers satisfied the constraint condition in the global genetic type space.

41、Keep it in mind the next time you're facing an intractable performance optimization problem — it may just be the magic bullet that can save you a major redesign.

42、By translating a geometric constraint problem into an optimization problem, the global optimum of a multi-variation function was sought for and the local traps were ignored by using chaos method in the algorithm.

43、Kevin Johnson took issue with the notion that scalability is an "optimization problem", and identified other factors to consider in the "up front costs that may bite you later" category.

44、In order to achieve the most effective results of TMD system applied in diminishing the vibrations, there exists an optimization problem such as the optimum frequency ratio and optimum damp ratio.

45、Interval algorithm of constrained multiobjective optimization problems

46、A Bi-level multi-population particle swarm optimization algorithm for solving complicated optimization problems

47、Bacterial chemotaxis optimization is a novel category of bionic algorithm for optimization problems.