共查询到20条相似文献，搜索用时 0 毫秒
1.
在对联合作战目标协同研究内容分析的基础上,提出了多任务部队与多作战目标的协同目标分配模型,其融合了目标综合价值、目标打击有效性、目标威胁适配度、目标类型匹配、目标距离匹配等因素。通过对各因素量化并将协同目标分配模型转换为指派问题进行求解,验证了分析方法的可行性。 相似文献
2.
3.
4.
Many important problems in Operations Research and Statistics require the computation of nondominated (or Pareto or efficient) sets. This task may be currently undertaken efficiently for discrete sets of alternatives or for continuous sets under special and fairly tight structural conditions. Under more general continuous settings, parametric characterisations of the nondominated set, for example through convex combinations of the objective functions or ε‐constrained problems, or discretizations‐based approaches, pose several problems. In this paper, the lack of a general approach to approximate the nondominated set in continuous multiobjective problems is addressed. Our simulation‐based procedure only requires to sample from the set of alternatives and check whether an alternative dominates another. Stopping rules, efficient sampling schemes, and procedures to check for dominance are proposed. A continuous approximation to the nondominated set is obtained by fitting a surface through the points of a discrete approximation, using a local (robust) regression method. Other actions like clustering and projecting points onto the frontier are required in nonconvex feasible regions and nonconnected Pareto sets. In a sense, our method may be seen as an evolutionary algorithm with a variable population size. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
5.
The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature. 相似文献
6.
7.
We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
8.
本文涉及的是在赋双权的二部图中求关于第一个权最大的限制下、第二个权最小的完美匹配的网络模型,给出了这一模型的有效算法,并用此算法解决了企业的优化组合分工中的挖潜问题。 相似文献
9.
10.
韩德 《装甲兵工程学院学报》2006,20(1):94-98
将指派问题的匈牙利解法用于货郎担问题,通过恰当地添加大正数构造效率矩阵,得到了计算货郎担问题较快的算法。文中给出的2个例子具体地说明了算法实施过程,该算法具有一定的实用性。 相似文献
11.
基于模糊匈牙利算法的炮兵火力单位分配问题 总被引：1，自引：0，他引：1
发挥诸火力单位的整体协调优势,寻求在给定约束条件下总的射击效果最好的分配方案,是火力单位最优分配的基本任务.匈牙利算法是求解传统的指派问题的一种较好的方法,运用模糊匈牙利算法在决策过程中将主观因素与客观因素有机地结合起来,解决火力单位分配方案决策中多指标指派问题,从而可以有效地解决炮兵火力单位分配最优化问题. 相似文献
12.
互连网络是大规模并行计算机的重要组成部分,路由算法是其中决定网络性能的重要因素,本文在直接网络结构基础上对路由算法进行讨论,给出了一种分类方法,并着重对采用虫孔路由开关技术的自适应路由算法进行分析,为进一步的评价和设计新的算法提供了参考。 相似文献
13.
14.
This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of ‐hardness of the TRSP is presented, along with exact and heuristic algorithms. Computational results on challenging instances are provided.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 119–130, 2014 相似文献
15.
16.
经马氏修正的Poisson过程的极大似然估计 总被引：1，自引：0，他引：1
近年来 ,隐马氏模型成为研究相依随机变量的一个十分有用的工具。实际应用过程中的一个很重要的问题是如何对隐马氏模型的参数进行估计。将一类连续时间隐马氏模型的问题转化为离散时间隐马氏模型的问题 ,给出了具体的隐马氏模型———经马氏修正的Poisson过程的极大似然估计及其算法。此类过程被广泛用来对复杂电信网络的交通流进行建模 相似文献
17.
18.
19.
Bence Nemeth 《Defense & Security Analysis》2016,32(4):321-335
Hungary, a former communist state, adapted a Western-style defense planning system during the 1990s and 2000s. Although on the surface the elements of this planning system were similar to the planning programming budgeting system (PPBS) developed by the US Department of Defense, strategic guidance for defense planning has not been properly developed until recently. Thus, albeit PPBS-based defense plans were developed in the Hungarian Ministry of Defense (Hungarian MoD) regularly, they lacked both an expression of clear priorities and strategic focus. This article delineates the evolution of strategic guidance in the Hungarian MoD concentrating on current developments, and introduces the newly elaborated analytical concepts and tools, which helped to create needed strategic guidance in Hungary. 相似文献
20.
We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献