This problem has vide applications in real areas , such as the design of water and electricity supply networks , and communication networks , etc . at the same time , the problem is also closely related with some classical combinatorial optimization problems , including the steiner problem and the travelling salesman problem , which are well - known . so , it is of great importance to study it 所谓欧几里德2 -连通steiner网络问题,就是对于给定的平面点集p ,确定它的长度最小的2 -连通steiner网络,该问题与组合最优化中著名的steiner问题和旅行售货员问题有关,同时在水、电供应网络和通讯网络等设计中也有非常广泛的应用,所以对该问题的研究具有重要的意义。
Vsp is both a pivotal tache in logistic distribution optimization and indispensable in electronic commerce . it can increase logistic economic benefit and realize logistic rationalization . the systemic study on the theory and method of vsp is the base on the growth of logistic intensivism , the establishment of modem chain of command , the development of its and ec . now , the problem is not only applied to the field of auto transportation , but also to ship avigation communication electricity industry management computer application etc . the algorithm has been applied into many combinatorial optimization problems such as the trainman ' s shift arrangement in avigation the optimization design of cargo arrangement in ship company 对货运车辆进行调度优化,可以提高物流经济效益、实现物流科学化。对货运车辆调度优化理论与方法进行系统研究是物流集约化发展、建立现代调度指挥系统、发展智能交通运输系统和开展电子商务的基础。目前,问题的形式已有很大发展,该问题以不仅仅局限于汽车运输领域,在水运、航空、通讯、电力、工业管理、计算机应用等领域也有一定的应用,其算法已用于航空乘务员轮班安排、轮船公司运送货物经过港口与货物安排的优化设计、交通车线路安排、生产系统中的计划与控制等多种组合优化问题。
It can be boiled down to combinatorial optimization problem in mathematics . on the basis of summarizing the complexity and structural features of hmb and rules of its design and manufacture and analyzing the spatial relationship in 3d layout of hmb , the expressions of relevant variants are put forward using the object - oriented approach 在全面总结液压集成块设计问题的复杂性特点,以及集成块类零部件的结构特征和设计、制造信息组成规律的基础上,本文深入分析了集成块立体布局的空间关系,用面向对象方法定义了与该问题有关的特征变量的示性表达式,给出优化目标和约束条件,进而确立了集成块设计问题的数学优化模型。
In recent years , the theory and algorithm for semidefinite programming have developed greatly , and it ' s most important applications are found in system theory , control theory , combinatorial optimization and mobile cotmnunication . semidefinite programming is a new and important research field in mathematical programming 近年来其理论和算法取得了很大的进展,并且在系统论、控制论、组合优化和移动通信等领域中获得广泛的应用,成为数学规划领域中一个新的活跃的研究方向
Scenario model , visualization of state model and effectiveness evaluation model are introduced too , and some crucial problems implementing the models are discussed , such as the algorithm about evaluation of emitter threat level , and the combinatorial optimization method about decision - making for jamming resources ' distribution in virtue of neural network 还介绍了该仿真系统模型实现中的几个关键问题,包括辐射源威胁等级的确定算法,以及神经网络应用于干扰资源分配的组合优化方法。
The pheromone - based parameterized probabilistic model for the aco algorithm is presented as the solution construction graph that the combinatorial optimization problem can be mapped on . based on the solution construction graph , the unified framework of the aco algorithm is presented . an iterative update procedure of the solutions distribution in the problem ' s probabilistic model is proposed , that will converge to the optimal solutions with probability one , then the minimum cross - entropy pheromone update rule is proposed to approximate the iterative update procedure by minimizing the cross - entropy distance and monte - carlo sampling 基于解空间参数化概率分布模型,首先提出了一个以概率1收敛于最优解的解空间概率分布的迭代更新过程,然后提出了通过最小化不同分布间的交互熵距离以及蒙特卡洛采样来逼近此迭代过程的最小交互熵信息素更新规则,接着分别给出了弧模式以及结点模式信息素分布模型下的最小交互熵等式。
Analyzed the similarity between scheme solving problem and traveling salesman problem ( tsp ) , the scheme solving problem for conceptual design is transformed into an optimal path problem in combinatorial optimization , where the dynamic programming based solution space model and the longest path based optimization model are developed 摘要通过分析概念设计方案求解问题与旅行商问题的相似性,将方案求解问题转化为组合优化的最优路径问题,建立了基于动态规划的解空间模型和基于最长路径的优化模型。
The cores of the task planning in joint campaign are tasks and actions . the aim of the task planning in joint campaign is how to distribute the combat resources to each task efficiently . taking every constraints of the distribution process into account , this distribution problem is actually a combinatorial optimization problem 联合作战任务计划的核心是任务和行动,其目的就是如何有效的将作战资源分配到各个任务中去,考虑到分配过程中的各种约束,对这一问题的求解即是解决一个组合优化问题。
Three - dimensional packing ( tdp ) is a combinatorial optimization and hp - complete problem and applied widely to the mechanical manufacture and traffic transportation industries . up to now there are varieties of heuristic algorithms to solve the tdp because of its high complication , we discuss the heuristic algorithm deeply in this paper and apply the simulated annealing ( sa ) algorithm to the packing system 三维布局问题属于组合最优化问题和np完全问题,具有高度复杂性,用一般的数学方法根本无法求解,目前解决三维布局问题多为各种启发式方法,本文在对启发式方法进行深入探讨的基础上,采用了用于解决一般三维布局问题的模拟退火算法作为布局系统的操作算法。
The parametrization work of eck et al . , and the b - spline construction scheme of peters . the main contribution of this procedure are : it presents a combinatorial optimization method for builing a quadrilateral domain from a triangular one ; it presents an efficient method for fitting a gl b - spline surface of arbitrary topological type to unorganized points ; it introduces a scheme for adaptive refinement of the quadrilateral patch network 论文工作利用了以前hoppe的表面重构工作, eck的参数化工作和peters的b样条重构方案,主要贡献在于:提出了从三角形域构造四边形域的组合优化方法;提出了从无序点重构具有任意拓扑结构g1连续nurbs曲面的有效方法;提出了四边形网格自适应细分的方案。
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.