共查询到19条相似文献,搜索用时 156 毫秒
1.
针对以往战场环境中目标跟踪背景下多传感器调度算法收敛性差、求解精度低的问题,在CS算法(布谷鸟搜索算法)的基础上,提出了一种基于差分进化的布谷鸟搜索算法.在跟踪目标模型的基础上,以跟踪精度、任务完成率以及传感器资源能源消耗为指标,建立多传感器调度模型;借鉴差分进化思想,对布谷鸟搜索算法进行改进;利用改进后的布谷鸟搜索算法(DE-CS算法)求解传感器调度模型.将DE-CS算法与基础CS算法进行仿真比较,仿真结果表明,改进后的算法在收敛速度和精度方面都得到了有效改善,证明改进后的算法有较好的求解质量. 相似文献
2.
在资源受限项目调度问题中,将可再生资源进一步拓展为具有能力差异的柔性资源,建立考虑能力差异的柔性资源受限的多模式项目调度问题模型,该模型是对传统资源约束项目调度问题(RCPSP)更接近实际的拓展。提出了基于粒子群算法的求解算法,粒子群算法求解该模型的思路为,利用蒙特卡洛方法根据资源-能力矩阵与活动模式-能力矩阵得到活动模式-资源矩阵,将考虑能力差异的柔性资源受限的多模式项目调度问题转换为常规的多模式项目调度问题,然后利用基于任务序列与模式表示的粒子群算法对该多模式项目调度问题进行求解。用数值实例说明了模型的合理性与算法的有效性。 相似文献
3.
针对军队建设项目中长期规划编制中的任务安排问题,探索运用项目调度理论和方法提供一种辅助的定量分析手段.以传统资源受限项目调度问题模型为基础,考虑军费预算定期划拨的特点,增加资源可用时间区间作为约束条件,构建了带资源时间约束的多项目调度模型,提出了一种集成动态遗传算法和启发式算法的逐阶段迭代多项目调度算法.该模型和求解算法能够在有限时间和预算条件下,充分利用各年度预算并达成项目规划预期收益.仿真实验表明,本文提出的逐阶段迭代多项目调度算法能够快速求解大规模算例,避免早熟并获得满意解,在求解速度和质量方面具有一定优势. 相似文献
4.
5.
6.
7.
提出一种基于分治策略的多星观测分层调度框架,在该框架下,用蚁群优化算法把任务分配至各轨道圈次上,并利用自适应模拟退火算法求解各轨道圈次的调度问题。根据各轨道圈次调度结果的反馈情况,再调整任务分配方案,重复上述过程直到达到算法终止条件。为了提高算法的性能,在设计蚁群算法的启发式信息模型时,应充分考虑卫星调度问题的领域知识;在模拟退火算法中设计两个邻域结构,采用动态选择策略在优化过程中确定最佳邻域搜索结构。仿真实验表明,该方法有效地降低了问题求解的复杂度,尤其在求解大规模多星观测调度问题时表现出优异的性能。 相似文献
8.
9.
抢险救灾非战争军事行动包括道路抢修和物资运输等任务,而这两类任务在灾后应急资源调度中存在关联性的影响,且面临路网结构可变及需求随机模糊等挑战,对此,提出了一种非确定性应急资源调度网络双层规划模型,设计了基于蒙特卡洛方法与遗传算法耦合的智能启发式求解策略.通过对典型情境下应急资源调度案例进行分析建模和数值求解,说明了该模型和算法的合理性和有效性. 相似文献
10.
基于遗传模拟退火算法的空袭兵力分配及优化 总被引:1,自引:0,他引:1
对遗传模拟退火算法中的交叉、变异操作进行了改进,并实施了最优保留策略,形成了改进遗传模拟退火算法.以突击效果最大化和兵力损失最小化为目标函数,以空袭兵力总量的限制、空袭兵器挂载类型的限制等为约束条件,建立了空袭兵力分配及优化模型.在考虑兵力分配模型特点的基础上,利用改进遗传模拟退火算法求解.通过与多目标数学规划和标准遗传算法优化进行的比较表明,该方法能够有效地解决带约束的多目标优化问题. 相似文献
11.
12.
13.
In this article, we describe a new algorithm for solving all-integer, integer programming problems. We generate upper bounds on the decision variables, and use these bounds to create an advanced starting point for a dual all-integer cutting plane algorithm. In addition, we use a constraint derived from the objective function to speed progress toward the optimal solution. Our basic vehicle is the dual all-integer algorithm of Gomory, but we incorporate certain row- and column-selection criteria which partially avoid the problem of dual-degenerate iterations. We present the results of computational testing. 相似文献
14.
15.
在对模拟退火遗传算法改进的基础上,结合建立的通信装备维修资源分配模型,给出了该算法的实现过程,并利用此算法对模型进行了最优化求解。实例的计算结果表明该算法对于模型的求解具有较好的收敛性。 相似文献
16.
17.
To deal with the radio frequency threat posed by modern complex radar networks to aircraft, we researched the unmanned aerial vehicle (UAV) formations radar countermeasures, aiming at the solution of radar jamming resource allocation under system countermeasures. A jamming resource allocation method based on an improved firefly algorithm (FA) is proposed. Firstly, the comprehensive factors affecting the level of threat and interference efficiency of radiation source are quantified by a fuzzy comprehensive evaluation. Besides, the interference efficiency matrix and the objective function of the allocation model are determined to establish the interference resource allocation model. Finally, A mutation operator and an adaptive heuristic are integtated into the FA algorithm, which searches an interference resource allocation scheme. The simulation results show that the improved FA algorithm can compensate for the deficiencies of the FA algorithm. The improved FA algorithm provides a more sci-entific and reasonable decision-making plan for aircraft mission allocation and can effectively deal with the battlefield threats of the enemy radar network. Moreover, in terms of convergence accuracy and speed as well as algorithm stability, the improved FA algorithm is superior to the simulated annealing algorithm (SA), the niche genetic algorithm (NGA), the improved discrete cuckoo algorithm (IDCS), the mutant firefly algorithm (MFA), the cuckoo search and fireflies algorithm (CSFA), and the best neighbor firefly algorithm (BNFA). 相似文献
18.
This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms. 相似文献