排序方式: 共有103条查询结果,搜索用时 515 毫秒
21.
Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code. 相似文献
22.
A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017 相似文献
23.
针对区域矩需要计算全图像素的统计分布、计算量大的问题,构造了基于目标形状的仿射不变轮廓矩。首先采用PDE方法推导得到了6个仿射不变矩的数学模型,然后将积分区间变为目标区域的边界,计算得到基于目标形状的仿射不变轮廓矩,最后通过三类舰船不同姿态下的图像进行了实验验证并对其稳定性进行了分析。研究结果表明:仿射不变轮廓矩具有较好的稳健性及区分度,可将其作为不变特征用于舰船目标识别。 相似文献
24.
This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
25.
导弹光学告警系统及对抗技术综述 总被引:3,自引:0,他引:3
详述了导弹羽烟热辐射的光电高速采集方法 ,并实时对导弹逼近告警。同时介绍了国外红外告警技术的发展现状 相似文献
26.
提出并研究了布尔函数的Walsh谱绝对值分布.指出布尔函数Walsh谱绝对值分布在仿射变换下的不变性,计算了n(n≤5)元布尔函数的Walsh谱绝对值分布,研究了Walsh谱绝对值分布与Walsh谱支撑和Walsh谱中非零取值个数以及其他一些密码学难题的联系,最后研究了布尔函数的Walsh谱绝对值分布的大小. 相似文献
27.
28.
给出了用椭圆弧及双椭圆弧自适应逼近平面NURBS曲线的算法。算法所得到的椭圆样条能够G1连续 ,双椭圆样条还能够保形。与现行的圆弧逼近算法相比 ,本算法不需要求解非线性方程组 ,而是由给定的插补误差自动计算参数增量 ,得到椭圆曲线的特征点 ,还可以将误差控制在预期的范围之内 ;与现行的直线插补方法相比 ,不需要额外的时间和空间 ,也适用于CNC环境。本算法在腔体加工、二维轮廓加工等方面有特别的实用价值。 相似文献
29.
In this article, we consider the performance evaluation of a multicomponent, multiproduct assemble‐to‐order (ATO) system. Each component is managed independently using a base‐stock policy at a supply facility with limited production capacity and an infinite buffer. The arrivals of demands follow a multivariate Poisson process and unfilled demands are backlogged. Because exact analysis of the proposed system is not feasible, we propose two approximation methods which provide upper and lower bounds for various performance measures such as fill rate, average waiting time, and average number of backorders of the proposed system. Our computational experiments demonstrate the effectiveness of the two approximation methods under various system settings. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
30.
In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献