查询词典 optimization problem

Vehicle routing problem is a typical combinatorial optimization problem, which is a simplified form of various complex problems.

车辆路径问题( Vehicle routing problem，简记VRP)是一个经典的组合优化问题，是多种复杂问题的一种简化形式。

On the other hands, the application of the particle swarm optimization algorithm in discrete optimization problem—resources constrained project scheduling problem, which is always used in continuous optimization problem, provides some important train of thought and method for resources constrained project scheduling problem as well as widening the application area of particle swarm optimization algorithm.

同时将在连续优化问题中得到成功应用的PSO算法用于离散域的RCPSP，既拓展了PSO算法的应用领域，也为RCPSP的求解提供了一种新的思路和方法。

A novel hybrid algorithm, which combines predictor-corrector primal-dual interior point method and genetic algorithm, is presented for dynamic and static reactive optimization in this dissertation. The algorithm fully make use of the advantage of interior point method in solving successive optimization problem and the advantage of genetic algorithm in solving discrete optimization problem. The original problem is divided into three parts: total successive problem, discrete problem and successive problem.

结合内点法和遗传算法，本文提出了一种新颖的混合算法用于求解动、静态无功优化问题，算法充分利用了内点法易于求解连续优化问题和遗传算法易于求解离散优化问题的优势，将原优化问题分解为初步的连续优化问题、离散变量优化问题、连续变量优化问题这三个子问题分别求解。

Based on the ICMmethod,the discrete topological optimization problem about spot-weld's existence or not is transformed into the continuous optimization problem on[0,1].The optimization model is founded with maximizing the structural stiffness as objective and structural strength as constraints.The problem of multi-objectives and multi-constraints is transformed into the problem of single-objective and single-constraint with the K-S function.The displacement and stress are transformed into the explicit function of design variables with the Response Surface Methodology.The optimization model is solved with Sequential Quadratic Program.

基于ICM（Independent Continuous Mapping，即独立、连续、映射）方法，将焊点有无的离散拓扑优化问题转化为[0，1]区间上的连续优化问题；建立了以结构刚度最大为目标、结构强度为约束的连续拓扑优化模型；采用K-S函数将多目标和多约束问题转化为单目标和单约束问题；运用响应面方法将位移和应力转化为设计变量的显式函数，采用序列二次规划方法求解优化模型。

Perspective of the thesis is from the social development and enterprise progress, to enhance competitive advantage of technological enterprises as the goal, describe the necessary to resolve the issue of the organizational structure by a comparative analysis, as well as in practice, optimization of the organizational structure has practical significance, the thesis is on the basis of optimization analysis of organizational structure of Shenzhen MG technology company, and uses the four-cycle perspective to describe the cyclical dynamic reconfiguration of the organization optimization problem, through the planning, startup, diagnosis, design, reconstruction, monitoring , as well as steps to improve the optimization of organizational structure, provide a new way of thinking and problem-solving approach to improve the efficiency of organization for similarity technology enterprises.

本文从社会发展、企业进步的视角出发，以提升科技企业竞争优势为目标，阐述了解决企业组织结构问题在理论上的必要性，以及组织结构优化在实践中所具有的现实意义。本文在对深圳MG科技公司组织结构现状进行分析的基础上，采用四循环法这种以周期性的观点描述企业动态组织优化问题的方法，通过策划、启动、诊断、设计、重构、监控、以及改进等步骤逐步实现对深圳MG科技公司的组织结构优化，所得的研究成果为类似科技企业进行组织结构优化提供了新的解决思路和方案。

Graph Coloring Problem is one of the typical NP-hard problems in combinatorial optimization problem.

图着色问题（GCP，Graph Coloring Problem）是经典的NP-Hard组合优化问题之一。

For the single objective optimization, the decomposition and coordination method is adopted to build the decomposition and coordination model according to the existing sub-area division conditions of power networks. Then using the Augmented Lagrange method, the minimization problem of decomposition and coordination model can be changed to the saddle point problem of augmented Lagrangian function. Finally, the so called auxiliary problem principle is selected to decompose variables as well as the functions. This transforms the voltage and reactive optimization problem of the wholenetworks to some sub-problems in some sub-areas.

对于单目标无功电压优化，根据实际电网分区情况，采用分解协调法复制各分区的边界节点，建立分解协调模型，采用增广拉格朗日法将求分解协调模型的极小值问题转化为求增广拉格朗日函数的鞍点问题，然后采用辅助问题原理分解变量和增广拉格朗日函数，从而将全网无功电压优化问题分解为多个分区的分布式并行优化问题。

A fine-grained genetic algorithm based algorithm which is for the parameters optimization problem of agent model is proposed. The fine-grained genetic algorithm is used to solve the parameters optimization problem of agent model. As to the parameters optimization problem of the agents colony model, the first step is to define the concept of "the parameters mode of the combat agents colony" to describe the parameters of the combat agent colony model. Then the genetic algorithm is used to solve the optimization problem with the parameters mode of the combat agent colony model as the genetic individual. Besides the algorithm, the algorithm dispatch tactic is also considered. And the two level sequence dispatch tactic and the two level nesting dispatch tactic are put forward for those complex parameters optimization problem. At last, the model parameters optimization under antagonism codition is studied. The means to solve this problem is to translate it into a kind of antagonism problem, then use the competitive co-evolutionary genetic algorithms to solve it.

其中：提出了一种基于细粒度模型的作战智能体模型参数优化求解算法，用细粒度模型遗传算法求解作战智能体模型参数优化问题；提出了"作战智能体群体参数模式"的概念，对作战智能体群体模型参数进行形式化描述，再以作战智能体群体参数模式为遗传个体，应用遗传算法求解作战智能体群体模型参数的优化问题；研究了上述优化问题求解算法的调度策略，提出了分层模型参数优化算法的双层顺序调度策略和双层嵌套调度策略，解决复杂的模型参数优化问题；将对抗条件下作战模型参数的优化问题转化为一种对抗性问题，应用竞争性共同进化遗传算法，进行求解。

We introduce convex,and in particular semidefinite,optimization methods,duality and complexity theory to shed new light to this relation for the single stock problem, given moments of the prices of the underlying assets,we show that we can find best possible bounds on option prices with general payoff funcations efficiently,either algorithmically(solving a semidefinite optimization problem)or in closed form, conversely,given observable option prices,we provide best possible bounds on moments of the prices of the underlying assets,as well as on the prices of the other options on the same asset by sovling linear optimization problems for options that are affected by multiple stocks either directly(the payoff of the option depends on multiple stocks)or indirectly(we have information on correlations between stock prices),we find on-optimal bounds using convex optimization methods,however,we show that it is NP-hard to find best possible bounds in multiple dimensions,we extend our results to incorporate transactions costs,this paper,in theory and practice can provide a reference to researchers and designers about Chinese financial derivative products,the full text is divided into six chapters as follows: ChapterⅠ:Papers on the background and significance of the subjects on a number of option pricing models as well as their advantages and shortcomings of the model and describes the status of research and writing papers and the main contents of the basic idea.

相应地，给定期权价格，也能够出标的资产瞬时价格的最有可能的最好的界。还有通过解决一个线性最优化问题，根据同一标的资产的其他期权的价格来找到这个期权的界值，对于期权受到多种股票价格直接影响(期权的收益依赖于多种股票)或者间接影响(我们有股票之间联系的有用信息)，如果使用凸规划方法我们就会发现没有最优的界，也能够证明对于多维情形确实是很难找到最优的最有可能的界值，最后将这一结论推广到考虑交易成本的情况。本文在理论和实践上给我国金融衍生产品研究者和设计者提供一定的参考。全文共分为六章，具体安排如下：第一章：阐述论文的选题背景和意义，介绍期权定价的一些模型以及这些模型的优点与缺点，并介绍国内外研究的现状以及论文的写作基本思路与主要内容。

Quadratic assignment problem is a NP-hard combinatorial optimization problem and has been applied in various fields. There are always many zero elements in the flow matrix or distance matrix of the quadratic assignment problem instances which are abstracted from the practical problems. Much computation time can be saved if we can first reduce the size of the problem by using its zero elements.

二次分配问题(quadratic assignment problem， QAP)是应用于诸多领域的组合优化NP-难题，许多从实际问题中抽象出来的二次分配问题，其流矩阵与距离矩阵中存在大量零元素，如果在该类二次分配问题的求解中，能够充分利用这些零元素的信息，将大大缩减问题的规模，节省大量运算时间。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。