首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
The generalized complementarity problem includes the well-known nonlinear complementarity problem and linear complementarity problem as special cases.In this paper, based on a class of smoothing functions, a smoothing Newton-type algorithm is proposed for solving the generalized complementarity problem.Under suitable assumptions, the proposed algorithm is well-defined and global convergent.  相似文献   

2.
二分图是图论当中一种特殊的模型,求带权二分图的最佳匹配算法对许多具有最优解的实际应用问题的解决是准确和高效的。针对多机系统的操作系统的一类多机调度问题进行了分析,建立了该问题的二分图模型并给出了二分图匹配的算法,对所给算法的复杂度进行了分析和讨论。实验结果验证了所提出方法的有效性。  相似文献   

3.
INTRODUCTION Most packing problems (Dowsland and Dow-sland, 1992) are NP-hard (Garey and Johnson, 1979); among which are bin-packing, floorplan, rectangle packing, packing a set of circles into a large circle or square, non-rectangular packing problems and so on (Li and Milenkovic, 1995; Liang et al., 2002; Lip-nitskii, 2002; Milenkovic and Daniels, 1996; Milenk-ovic et al., 1991; Osogami and Okano, 2003; Wang, 2002). Some of these such as bin-packing problem and rectangle packing p…  相似文献   

4.
Wavelength and bandwidth allocation is important for multicast communication in optical networks. In this paper, a new method based on scheduling theory is proposed. The proposed method formulates wavelength bandwidth capacity as a large rectangle and these multicast stream bandwidth requirements as small rectangles. It treats the wavelength and bandwidth allocation question as a rectangle packing problem. The proposed algorithm solves the problem by taking quasi-human strategy with Euclidian distance. It is an effective heuristic algorithm to quickly solve multicast stream bandwidth allocation problem in optical networks by theoretic analysis. Further simulation experiments show the bandwidth allocation algorithm can increase network utilization and have a good fairness performance for unicast stream and multicast stream in optical networks. The results indicate the effectiveness of the algorithm.  相似文献   

5.
装配线平衡问题是生产管理中重要且比较难解决的问题,其中如何分配工人到不同的工作站以提高生产效率是问题的关键。针对包含工人分配问题的装配线平衡问题,提出一种基于Pareto的问题无关的适应值计算方法的多目标遗传算法。算法中首先建立ALB-wa问题的数学模型,提出一个基于随机键编码的基因表达方式;使用匹配指定的染色体结构和ALB-wa问题的遗传操作;使用基于Pareto支配关系的评价函数来代替使用基于偏好的评价函数。最后,通过实验数值验证该方法的性能。结果表明,该方法具有较高的收敛性和效率,改进了现有的其他遗传算法。  相似文献   

6.
对广泛应用于金融及经济等实际问题中的一类带有多乘积约束的线性规划问题提出一种全局优化算法.利用对数的性质和线性化技术,建立了问题的等价问题的松弛线性规划,并通过对可行域的细分以及一系列求解过程的讨论,从理论上证明了算法收敛到问题的全局最优解,并用数值结果验证了方法的可行性.  相似文献   

7.
研究了多用户场景下多载波码分多址系统(MC—CDMA)的下行信道和功率分配,并将吞吐最大化问题建模成一个混合整数优化问题.为了简化分析,将问题分成2个低复杂度的子问题:功率分配和信道分配.这2个子问题可分别被一个次最优自适应功率分配算法(APA)和一个最优自适应信道分配算法(ACA)解决.通过联合APA和ACA算法,进一步提出了一个自适应信道和功率的分配方案.仿真结果表明:与传统的均匀功率分配算法相比,提出的APA算法更加适用于MC—CDMA系统;此外,提出的自适应信道和功率分配方案可以显著地提高系统吞吐量性能.  相似文献   

8.
This paper presents a new method based on an immune-tabu hybrid algorithm to solve the thermal unit commitment (TUC) problem in power plant optimization. The mathematical model of the TUC problem is established by analyzing the generating units in modem power plants. A novel immune-tabu hybrid algorithm is proposed to solve this complex problem. In the algorithm, the objective function of the TUC problem is considered as an antigen and the solutions are considered as antibodies, which are determined by the affinity computation. The code length of an antibody is shortened by encoding the continuous operating time, and the optimum searching speed is improved. Each feasible individual in the immune algorithm (IA) is used as the initial solution of the tabu search (TS) algorithm after certain generations of IA iteration. As examples, the proposed method has been applied to several thermal unit systems for a period of 24 h. The computation results demonstrate the good global optimum searching performance of the proposed immune-tabu hybrid algorithm. The presented algorithm can also be used to solve other optimization problems in fields such as the chemical industry and the power industry.  相似文献   

9.
ASecondOrderTrainingAlgorithmforMultilayerFeedforwardNeuralNetworksTanYing(谭营)HeZhenya(何振亚)(DepartmentofRadioEngineering,Sou...  相似文献   

10.
以优化形式描述的集合覆盖问题是一个NP难问题,设计快速有效的近似算法,具有重要的理论与现实意义.基于贪心算法思想,提出了一种求解带权集合覆盖问题的近似算法,并讨论了该算法的相对近似比.  相似文献   

11.
This paper considers a reentrant scheduling problem on parallel primary machines with a remote server machine, which is required to carry out the setup operation. In this problem, each job has three operations. The first and last operations are performed by the same primary machine, implying the reentrance, and the second operation is processed on the single server machine. The order of jobs is predetermined in our context. The challenge is to assign jobs to the primary machines to minimize the makespan. We develop a genetic algorithm(GA) to solve this problem. Based on a simple strategy of assigning jobs in batches on the parallel primary machines, the standardized random key vector representation is employed to split the jobs into batches. Comparisons among the proposed algorithm, the branch and bound(BB) algorithm and the heuristic algorithm, coordinated scheduling(CS), which is only one heuristic algorithm to solve this problem in the literature, are made on the benchmark data. The computational experiments show that the proposed genetic algorithm outperforms the heuristic CS and the maximum relative improvement rate in the makespan is 1.66%.  相似文献   

12.
先将非线性互补问题(NCP )转化为与其等价且有可行解的辅助问题,再将引入了信赖域方法思想的SQP方法与Filter技术相结合,提出一种求解NCP问题的信赖域-SQP-filter算法,并讨论了解的存在性和算法的全局收敛性。数值结果表明我们的算法是有效并收敛的。  相似文献   

13.
整线性相关问题是计算数论的中心问题之一.PSLQ算法是解整线性相关问题的重要算法.它是由Ferguson1987年提出(见文献[4]).它是一种非递归算法.本文介绍了PSLQ算法的相关定义及其发展现状,说明其基本思想.  相似文献   

14.
2004年孙春玲等研究了一维装箱问题,给出了一个近似程度最好的近似值为3/2的近似算法-交叉算法.遗憾的是他们的交叉算法的近似值分析是错误的,本文通过两个反例说明了他们的错误所在,并给出一个正确的近似值分析.  相似文献   

15.
为了解决基于启发式算法的资源分配和任务调度过程中由于没有考虑任务间的相互依赖关系而出现的任务死锁问题,提出了一种基于蚁群系统的改进算法.首先阐述了如何将分配调度问题映射到任务资源分配图的优化选择问题上和如何将信号量机制引入到最优任务资源分配图中来解决死锁问题.其次说明了基于蚁群系统如何利用网格信息素系统模型实现该算法,涉及任务资源分配图的构造,以及通过蚁群的正反馈和分布式并行计算机制优化任务资源分配图.最后模拟试验结果说明所提出的算法可以有效地解决网格中任务死锁问题.  相似文献   

16.
为解决FlexRay线控转向系统中常见的死锁问题,采用优先级置顶算法进行多任务动态调度。首先,分析FlexRay线控转向系统多任务动态调度过程中的死锁问题|然后深入研究优先级置顶算法防止死锁问题的原理|最后搭建双通道多冗余的FlexRay线控转向系统,进行重要系统参数配置。运行结果表明,未使用优先级置顶算法的FlexRay线控转向系统出现了死锁现象,使用优先级置顶算法进行动态任务调度之后,系统可正常运行,证明了算法有效性。  相似文献   

17.
太阳能电动汽车的复合能源系统优化匹配问题可以看成一个多目标优化问题,两个相互冲突的目标是极大化系统的峰值功率满足率和极小化系统的成本,前者关系到系统的可靠性后者涉及到样车能否量产,所以两个优化目标都很重要.本文提出了改进的粒子群算法优化配置太阳能电动汽车复合能源系统,这种改进的粒子群算法引进了遗传算法里的变异算子,并且打破常规算法里的加速因子为常数的惯例而使加速因子随时间改变.优化结果显示:改进的粒子群算法也能够很好地解决复合能源系统的多目标优化问题.  相似文献   

18.
This paper concerns with modeling and design of an algorithm for the portfolio selection problems with fixed transaction costs and minimum transaction lots. A mean-variance model for the portfolio selection problem is proposed, and the model is formulated as a non-smooth and nonlinear integer programming problem with multiple objective functions. As it has been proven that finding a feasible solution to the problem only is already NP-hard, based on NSGA-II and genetic algorithm for numerical optimization of constrained problems (Genocop), a multi-objective genetic algorithm (MOGA) is designed to solve the model. Its features comprise integer encoding and corresponding operators, and special treatment of constraints conditions. It is illustrated via a numerical example that the genetic algorithm can efficiently solve portfolio selection models proposed in this paper.This approach offers promise for the portfolio problems in practice.  相似文献   

19.
The quaternion coherence problem exists in the data model of the conventional dimensional reduced quaternion estimation of signal parameters via rotational invariance techniques(DRQ-ESPRIT), and DRQ-ESPRIT would lose degrees of freedom(DOFs)when it is used to implement the spatial smooth operation. An improved DRQ-ESPRIT algorithm based on 2-level nested vector-sensor array is proposed in this paper. The quaternion coherence problem is solved by switching the multiplication sequence of spatial direction vector and electric field. Meanwhile, nested array and Khatri-Rao subspace approach are used to increase the number of DOFs, thus the proposed algorithm can estimate more incident sources than DRQ-ESPRIT, and the estimations of direction of arrival( DOA)and polarization parameters are more accurate. Simulation results demonstrate the effectiveness of the proposed algorithm.  相似文献   

20.
烟花算法作为一种新型群体智能优化算法,在众多领域得到成功应用。联合采购品种的不断扩大对算法性能提出了巨大挑战。针对联合补货问题设计了基于烟花算法的求解方案,并利用基础算例证明方案有效性。随机生成的大规模算例表明,烟花算法相较于混合差分进化算法,在求解大规模联合补货问题时可获得更优的近似最优解,具有更快的收敛速度和更高的稳定性,验证了烟花算法在混合整数规划方面的应用效果。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号