共查询到19条相似文献,搜索用时 142 毫秒
1.
2.
3.
4.
5.
多工位装配序列粒子群优化算法 总被引:1,自引:0,他引:1
针对传统单工位装配序列求解上的不足,将粒子群算法应用于多工位多目标装配序列优化的求解,提出一种面向复杂多工位产品的装配序列优化方法。采用优先序列图(Assembly precedence graph,APG)来描述零件间的优先约束关系,构建优先关系矩阵、装配干涉矩阵、工位能力表和装配信息表,描述装配部件干涉及工位之间的关系;给出粒子群算法编码体系和装配关系算法模型表达方法;综合考虑装配操作成本、装配工具更换成本和装配夹装变更成本和运输成本的影响,提出有工程意义的适应度函数的表达式;根据APG生成随机的可行初始装配序列,并利用粒子群算法(Particle swarm algorithm,PSO)对装配序列和装配工位进行优化。以飞机起落架装配序列规划实例验证多工位粒子群装配序列优化算法有效性。 相似文献
6.
7.
8.
9.
基于遗传模拟退火算法的产品装配序列规划方法 总被引:3,自引:0,他引:3
为有效地获取方便可行的装配序列,在分析了装配序列的几何可行推理约束之后,建立了包含稳定性、聚合性及装配方向改变次数因素的优化评价模型。采用遗传模拟退火算法进行产品装配序列规划,通过分析算法的相关参数的变化趋势和大致范围,利用正交试验(初步定位)和对比试验(精确定位)相结合的方法,确定算法的近优运行参数,最后以8E150ZLC柴油机油泵为例,与遗传算法运行结果对比,验证了该方法是一种高效的、具有工程实际意义的复杂产品装配序列规划方法。 相似文献
10.
《计算机集成制造系统》2014,(4)
针对装配序列规划问题的特点,重新定义了应用于连续空间优化的萤火虫算法的各种相关操作,并对萤火虫算法的迭代规则进行了改进,提出了面向装配序列规划问题的改进型离散萤火虫算法。将改进型离散萤火虫算法和标准型离散萤火虫算法的实验结果进行了比较,同时也将改进型离散萤火虫算法与在装配规划领域应用最广泛的遗传算法进行了比较,验证了改进型离散萤火虫算法的优越性。在适应度函数构造方面,对传统的装配序列规划研究进行了改进,提出了装配序列工具—零件干涉次数评价指标,并通过实例验证了该评价指标的可行性和合理性。 相似文献
11.
基于最大-最小蚁群系统的装配序列规划 总被引:8,自引:0,他引:8
提出一种结合了蚁群系统与最大-最小蚂蚁系统优点的装配序列规划(Assembly sequence planning, ASP)方法。对近十年基于蚁群优化的ASP文献中采用的优化指标、装配信息模型、实例零件数等进行综述和比较。为提高序列的装配效率区分度,研究方向性、并行性、连续性、稳定性和辅助行程等5项指标的自动量化方法,将其融入到蚁群优化多目标启发式函数和适应值函数中。为提高对最优序列的搜索能力,以装配几何可行性为基础,从蚂蚁数量的确定、最大-最小信息素的界定、初始零件分配位置的绩效考核机制以及对并行零件组强制优化机制等方面,设计针对性解决方案,提出基于最大-最小蚁群系统的ASP算法。开发基于Siemens NX的装配规划系统AutoAssem。以阀门为实例,验证了算法内部各项优化措施的有效性,同时与优先规则筛选法、遗传算法及粒子群算法进行比较,分析该算法在运行效率和序列性能方面的优势。 相似文献
12.
装配顺序规划是计算机辅助工艺设计的一个重要环节,影响着轿车车身的装配质量和效率.针对当前装配顺序规划易产生组合爆炸等问题,提出了基于粒子群算法的装配顺序规划算法.装配偏差是影响装配质量的重要因素,因此应用装配体的装配偏差评价装配顺序.在装配顺序规划过程中,首先将装配顺序编码为粒子,根据所建立的判断规则进行识别粒子的可行性,并通过装配偏差评估可行粒子的适应度值,然后根据粒子群算法过程规划装配顺序,最后采用前翼子板案例阐述装配顺序的生成和优化过程. 相似文献
13.
面向ASP与DFA集成系统的装配模型技术 总被引:5,自引:0,他引:5
针对并行工程中的产品装配设计与优化分析 ,提出了一种装配顺序规划与为装配而设计相集成的产品装配分析系统。重点分析研究了集成系统中的产品装配建模方法。首先对现有的各种典型的装配模型技术进行分析比较 ;其次 ,根据 ASP与DFA集成系统的需求 ,设计出了一种包含装配草图、装配关联图信息、装配结构树图、零件设计参数和连接参数等信息的装配模型结构。并结合实例分析了该装配模型的计算机实现方法 相似文献
14.
Y.W. Bai Z.N. Chen H.Z. Bin J. Hun 《The International Journal of Advanced Manufacturing Technology》2005,27(1-2):96-105
An integration strategy for assembly sequence planning and sequence scheme evaluation is proposed. This strategy can be used
to plan a reasonable assembly sequence, to optimize a sequence scheme, and to predict whether a collision will occur between
the assembly tool and assembled components by considering factors like target components and assembly resources.
A hybrid method is presented for assembly sequence modeling that combines human-computer interactive operations to manually
build a hierarchical assembly sequence main model and a hybrid graph method to automatically generate sub-assembly sequence
schemes of the main model. An optimization algorithm based on time-cost is introduced to handle a best candidate components
selection. This relieves the problem of limited capability found when handling large size assembly models with traditional
methods. The essential issues involved in system implementation are discussed as well; these include a representation method
for the assembly consequence model, an optimization model of assembly sequence planning, and an object-oriented system architecture
model employed with multi-agent technology for visually evaluating the assembling process.
This system, KM computer-aided assembly process planning, KMCAAPP, has been developed on the basis of our previous work, KMCAD3;
KMCAAPP uses the presented approach. KMCAAPP can be integrated with CAD model from KMCAD3D. A case study shows that the presented
approach can use large CAD assembly models and delivers a feasible and effective way to integrate the assembly sequence planning
process with scheme evaluation by visually evaluating the assembling process. This allows the identification of design errors
in a timely manner and mitigates economic loss. 相似文献
15.
基于最短路径的复杂机械产品装配过程质量控制点公差带在线优化方法 总被引:1,自引:0,他引:1
为提高复杂机械产品的装配精度和装配质量稳定性,提出一种基于最短路径的复杂机械产品装配过程质量控制点公差带在线优化方法。对关键工序的质量控制点公差带进行细粒度划分;从装配精度角度出发,引入田口工序能力指数构建质量损失—公差函数;综合考虑装配过程中两种作业(基本作业和辅助作业)类型的时间调整损失,建立装配时间调整费用—公差函数;在上述两函数的基础上,通过加权聚类建立装配损失—公差函数模型,以描述质量控制点的总损失与公差的关系;构建基于最短路径的公差带在线优化模型,将装配损失—公差函数作为权函数,以最小损失为目标进行搜索,实现对后续质量控制点公差带的在线优化。以某型发动机缸盖螺栓拧紧过程为应用实例,验证了上述方法的可行性和有效性。 相似文献
16.
Integrated assembly and machining planning for electronic products using a genetic algorithm approach 总被引:1,自引:1,他引:0
Yuan-Jye Tseng Chi-Hung Lin Yu-Hua Lin 《The International Journal of Advanced Manufacturing Technology》2008,36(1-2):140-155
To produce an electronic product, both assembly operations and machining operations are required in the process plan. In most
cases, the assembly operations and machining operations need to be combined in a continued order with an integrated sequence.
This is different from the traditional process planning approaches in which machining operations and assembly operations are
separated as two independent tasks with no interactions. For an electronic product, the two types of operations and the associated
costs may affect each other in an interactive way. Therefore, the sequence planning of assembly operations and machining operations
must be analyzed with an integrated model. In this research, a graph-based model is presented to represent the assembly and
machining operations in an integrated model. The related operation cost functions are developed to evaluate the costs for
the integrated assembly and machining sequences. The integrated sequence planning problem is solved using a genetic algorithm
approach with an objective of lowest operation costs. As a result, the assembly operations and machining operations can be
planned in an integrated sequence suitable for producing electronic products. The result shows that the developed method using
the genetic algorithm approach is efficient for solving the integrated sequence planning problem. Example products are demonstrated
and discussed. 相似文献
17.
18.
19.
Qiang Su 《The International Journal of Advanced Manufacturing Technology》2007,33(1-2):58-57
Assembly sequence planning (ASP) is the foundation of the assembly process planning and design for assembly (DFA). In ASP,
geometric feasibility is the prerequisite in the valid assembly sequences searching. The assembly precedence relations’ (APRs)
deriving and fulfilling are the essential tasks in the geometric feasible assembly sequence planning. In this paper, a systematical
approach called geometric constraint analysis (GCA) is proposed and the corresponding software system is developed and integrated
with CAD system. Using this system, only with a few mouse clicks on CAD draft, assembly precedence relations (APRs) can be
derived correctly and completely. Then, all the geometric feasible assembly sequences can be inferred out automatically. Moreover,
an optimal algorithm is designed and realized in the GCA method, by which, the most optimal assembly sequence in terms of
the operation convenience can be found out from the immense geometric feasible sequences.
An erratum to this article can be found at 相似文献