排序方式: 共有142条查询结果,搜索用时 281 毫秒
81.
82.
83.
基于模糊聚类的多目标跟踪算法 总被引:2,自引:0,他引:2
提出了一种新的基于模糊聚类的多目标跟踪算法,该算法通过一种改进的模糊聚类算法,首先得到可能的目标数和测量点迹与目标预测位置之间的隶属度,然后结合Kalman滤波将隶属度作为权值系数对预测新息向量进行加权,来实现目标状态估计的更新。仿真结果表明,传统数据融合多目标跟踪算法,一般需要假定目标数并且在多目标密集时易产生关联错误而导致跟踪发散,新算法通过模糊聚类客观有效地确定了目标数并且通过加权过程保证了对多目标密集时的高精度。 相似文献
84.
将蚁群算法应用于图像分割领域,提出了一种新的基于蚁群算法的图像边缘检测方法。详细阐述了蚁群算法与该方法的基本原理和具体实现过程。为了提高算法效率,进行两处改进,第一将蚂蚁初始位置由随机放置修改为放置在图像边缘附近,可取一图像灰度梯度阈值来实现,第二将信息激素强度和启发式引导函数值均定义为像素点灰度梯度值的函数。大量实验结果证明了该算法能有效地检测出图像边缘,而且具有适应性强、效率高等特点。 相似文献
85.
86.
提出了一种新的用于未知数量稀疏源盲分离的统一方法。为了改善聚类分离的精度,该方法选取混合空间中半径给定的、中心位于原点的超球面以外的所有数据点,然后将这些数据点映射到中心位于原点的单位超球面上以得到集合Cy。由此,原来的聚类变为致密聚类,各聚类互相重叠的现象几乎消失。随后,先通过关于Cy的聚类分离来估计混合矩阵,再根据混合矩阵估计源,其中最佳不相似阈值和相应的聚类数量是自动生成的。计算机仿真结果验证了该方法对具有不同程度稀疏性源的有效性。当源充分稀疏时,重构信噪比大约是300 dB。因此,该方法精确、便利。 相似文献
87.
Complexity and workload considerations in product mix decisions under the theory of constraints
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
The literature on the product mix decision (or master production scheduling) under the Theory of Constraints (TOC), which was developed in the past two decades, has addressed this problem as a static operational decision. Consequently, the developed solution techniques do not consider the system's dynamism and the associated challenges arising from the complexity of operations during the implementation of master production schedules. This paper aims to address this gap by developing a new heuristic approach for master production scheduling under the TOC philosophy that considers the main operational factors that influence actual throughput after implementation of the detailed schedule. We examine the validity of the proposed heuristic by comparison to Integer Linear Programming and two heuristics in a wide range of scenarios using simulation modelling. Statistical analyses indicate that the new algorithm leads to significantly enhanced performance during implementation for problems with setup times. The findings show that the bottleneck identification approach in current methods in the TOC literature is not effective and accurate for complex operations in real‐world job shop systems. This study contributes to the literature on master production scheduling and product mix decisions by enhancing the likelihood of achieving anticipated throughput during the implementation of the detailed schedule. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 357–369, 2015 相似文献
88.
为分析不同区域物资动员潜力差异,并对其进行分类,从总体实力和产值结构两方面出发,建立了区域物资动员潜力指标体系。以我国行政区域为研究样本,通过SPSS18软件,结合年度统计数据进行分析。采用主成分分析法对方案层指标进行简化,将形成的综合得分标准化并分析主成分上的载荷,然后采用层次分析法得到总体实力得分。再将研究对象按照总体实力与产值结构进行ward聚类分析,得到6个区域类别,分析其特点,提出动员建议。 相似文献
89.
90.
Wieslaw
Kubiak Yanling Feng Guo Li Suresh P. Sethi Chelliah Sriskandarajah 《海军后勤学研究》2020,67(4):272-288
Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of view. Herein we focus on the scheduling problem of minimizing the makespan in a flexible two-center job shop. The first center consists of one machine and the second has k parallel machines. An easy-to-perform approximate algorithm for minimizing the makespan with one-unit-time operations in the first center and k-unit-time operations in the second center is proposed. The algorithm has the absolute worst-case error bound of k − 1 , and thus for k = 1 it is optimal. Importantly, it runs in linear time and its error bound is independent of the number of jobs to be processed. Moreover, the algorithm can be modified to give an optimal schedule for k = 2 . 相似文献