共查询到20条相似文献,搜索用时 673 毫秒
1.
2.
针对分布式多站雷达协同定位下的功率分配问题,提出一种改进凸松弛的启发式算法。给出了分布式多站雷达定位误差的克劳美罗下界(CRLB),建立功率约束下最小化CRLB迹的功率分配模型。设计了一种改进凸松弛算法,通过迭代修正松弛参数和快速功率调整策略解决非凸优化问题消除松弛带来的误差。仿真实验表明,相对于均匀功率分配算法和基于凸松弛的功率分配算法,改进凸松弛启发式功率分配算法下目标的定位性能更优。 相似文献
3.
4.
5.
当前装备供应保障系统中维修器材存在短缺、积压以及配送系统效率低下等问题,亟须对生产、库存和配送作业环节进行集成优化。为客观反映各个决策环节,将该问题公式化为一个混合整数线性规划模型,针对该模型多变量、多约束的特点,提出了一个基于数学规划的两阶启发式算法对其进行求解。结合算例,检验模型的可行性,并选取求解器CPLEX和一个类似的迭代算法与该算法在求解质量和运算时间方面进行对比与分析。结果表明,提出的模型是合理可行的,该算法在求解不同规模实例时表现出优异的性能。 相似文献
6.
7.
提出一种基于分治策略的多星观测分层调度框架,在该框架下,用蚁群优化算法把任务分配至各轨道圈次上,并利用自适应模拟退火算法求解各轨道圈次的调度问题。根据各轨道圈次调度结果的反馈情况,再调整任务分配方案,重复上述过程直到达到算法终止条件。为了提高算法的性能,在设计蚁群算法的启发式信息模型时,应充分考虑卫星调度问题的领域知识;在模拟退火算法中设计两个邻域结构,采用动态选择策略在优化过程中确定最佳邻域搜索结构。仿真实验表明,该方法有效地降低了问题求解的复杂度,尤其在求解大规模多星观测调度问题时表现出优异的性能。 相似文献
8.
9.
针对红外观测站部署问题,在研究观测站位置对定位精度影响的基础上,提出了基于粒子群优化的观测站部署算法。首先对ECEF坐标系下的CRLB矩阵进行推导;然后将观测站优化部署问题抽象为非线性规划模型,并将红外传感器联合定位的CRLB作为目标函数;最后采用粒子群优化算法求解该模型,避免了传统的非线性规划算法需要求解目标函数梯度的难题。结果表明,本文的部署算法具有一定的理论依据和工程意义;可以为实际红外观测站的静态部署和动态部署提供参考。 相似文献
10.
为解决传统基于贝叶斯理论的概率模糊聚类(Bayesian Fuzzy Clustering,BFC)算法在处理大规模数据集聚类时的时间开销和存储代价瓶颈,提出基于数据分块的单程自适应加权BFC算法,算法在大规模数据集分块的基础上,设计了基于数据加权的改进BFC算法,用于数据分块内数据聚类,以挑选出对聚类贡献最具代表的标识数据及其自适应权值,在块间迭代聚类过程中,将标识数据及其权值合并到下一数据块中并参与聚类,从而将上一数据块的聚类信息有效地传递到下一数据块中,最后分析算法的收敛性和时间复杂度.实验结果表明,算法在继承传统BFC算法良好聚类性能基础上,减少计算复杂度,有效提高聚类效率,适用于大规模数据集聚类. 相似文献
11.
12.
This paper presents an algorithm for solving the integer programming problem possessing a separable nonlinear objective function subject to linear constraints. The method is based on a generalization of the Balas implicit enumeration scheme. Computational experience is given for a set of seventeen linear and seventeen nonlinear test problems. The results indicate that the algorithm can solve the nonlinear integer programming problem in roughly the equivalent time required to solve the linear integer programming problem of similar size with existing algorithms. Although the algorithm is specifically designed to solve the nonlinear problem, the results indicate that the algorithm compares favorably with the Branch and Bound algorithm in the solution of linear integer programming problems. 相似文献
13.
This paper investigates a new procedure for solving the general-variable pure integer linear programming problem. A simple transformation converts the problem to one of constructing nonnegative integer solutions to a system of linear diophantine equations. Rubin's sequential algorithm, an extension of the classic Euclidean algorithm, is used to find an integer solution to this system of equations. Two new theorems are proved on the properties of integer solutions to linear systems. This permits a modified Fourier-Motzkin elimination method to be used to construct a nonnegative integer solution. An experimental computer code was developed for the algorithm to solve some test problems selected from the literature. The computational results, though limited, are encouraging when compared with the Gomory all-integer algorithm. 相似文献
14.
This paper tackles the general single machine scheduling problem, where jobs have different release and due dates and the objective is to minimize the weighted number of late jobs. The notion of master sequence is first introduced, i.e., a sequence that contains at least an optimal sequence of jobs on time. This master sequence is used to derive an original mixed‐integer linear programming formulation. By relaxing some constraints, a Lagrangean relaxation algorithm is designed which gives both lower and upper bounds. The special case where jobs have equal weights is analyzed. Computational results are presented and, although the duality gap becomes larger with the number of jobs, it is possible to solve problems of more than 100 jobs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003 相似文献
15.
This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
16.
In this article we present some advanced basis or block-pivoting, relaxation, and feasible direction methods for solving linear programming problems. Preliminary computational results appear to indicate that the former two types of simplex-based procedures may hold promise for solving linear programming problems, unlike the third type of scheme which is shown to be computationally unattractive. 相似文献
17.
A branch and bound algorithm is developed for a class of allocation problems in which some constraint coefficients depend on the values of certain of the decision variables. Were it not for these dependencies, the problems could be solved by linear programming. The algorithm is developed in terms of a strategic deployment problem in which it is desired to find a least-cost transportation fleet, subject to constraints on men/materiel requirements in the event of certain hypothesized contingencies. Among the transportation vehicles available for selection are aircraft which exhibit the characteristic that the amount of goods deliverable by an aircraft on a particular route in a given time period (called aircraft productivity and measured in kilotons/aircraft/month) depends on the ratio of type 1 to type 2 aircraft used on that particular route. A model is formulated in which these relationships are first approximated by piecewise linear functions. A branch and bound algorithm for solving the resultant nonlinear problem is then presented; the algorithm solves a sequence of linear programming problems. The algorithm is illustrated by a sample problem and comments concerning its practicality are made. 相似文献
18.
徐培德 《国防科技大学学报》1993,15(2):105-110
本文讨论了变量有界的线性目标规划问题,给出了求解这类问题的一个对偶算法,此方法与变量有界线性规划问题的对偶算法相类似。文中证明了算法的有效性,并举例说明了计算过程。 相似文献
19.
针对海量电磁数据中雷达信号难以进行快速准确分选的问题,提出一种新的聚类分选方法,即改进k-means算法的Map Reduce并行化实现方法。通过引入初始聚类中心个数k1、最大聚类中心个数kmax和距离门限rt3个参数,克服了k-means算法需要事先确定k值和易受孤立点影响的局限;基于Hadoop平台实现了对改进k-means算法的Map Reduce并行化,克服了k-means算法串行实现时间复杂度高的局限。最后,实验表明改进k-means算法取得了更高的分选准确率,Map Reduce并行化后具有良好的加速比和扩展性,能够很好地对海量电磁数据中雷达信号进行高效分选。 相似文献
20.
盲数字水印是数字作品版权保护系统的关键技术之一。由于在检测时没有原始图像作为参考 ,所以水印检测器的设计成为盲水印算法的核心。基于图像小波变换系数的局部平稳高斯模型 ,提出了一种新的盲水印检测器。实验结果表明该检测器与被广泛应用的线性相关检测器相比具有更好的鲁棒性 相似文献