Particle swarm optimization algorithm to maximize assembly efficiency

The demands on assembly accuracy require accurate operations both in machining and assembly in order to achieve the high performance of products. Although advanced machining technologies can be used to satisfy most of the demands on precision assembly, the corresponding manufacturing cost will also be increased. Selective assembly provides an effective way for producing high-precision assembly from relatively low-precision components. The accuracy of selective assembly is mainly based on the number of groups and the range of the group (allocated equally on the design tolerance). However, there are often surplus parts in some groups due to the imbalance of mating parts, especially in the cases of undesired dimensional distributions, which makes the methods developed and reported in the literature often not suitable for practice. In this work, a particle swarm optimization (PSO) algorithm is proposed by applying batch selective assembly method to a complex assembly with three mating components (as in ball bearing: an inner race, ball and outer race), to minimize the surplus parts and thereby maximizing the assembly efficiency. Due to the continuous nature of particle swarm optimization algorithm, standard PSO equations cannot be used to generate discrete combination of mating parts. An effective encoding scheme is developed to make the combination of mating parts feasible. The evolution performance of the PSO algorithm with different control parameter values is also analysed.     

Particle swarm optimization (PSO) algorithm for optimal machining allocation of clutch assembly

Nowadays tolerance optimization is increasingly becoming an important tool for manufacturing and mechanical design. This seemingly, arbitrary task of assigning dimension tolerance can have a large effect on the cost and performance of manufactured products. With the increase in competition in today’s market place, small savings in cost or small increase in performance may determine the success of a product. In practical applications, tolerances are most often assigned as informal compromises between functional quality and manufacturing cost. Frequently the compromise is obtained interactively by trial and error. A more scientific approach is often desirable for better performance. In this paper particle swarm optimization (PSO) is used for the optimal machining tolerance allocation of over running clutch assembly to obtain the global optimal solution. The objective is to obtain optimum tolerances of the individual components for the minimum cost of manufacturing. The result obtained by PSO is compared with the geometric programming (GP) and genetic algorithm (GA) and the performance of the result are analyzed .     

基于粒子群算法的机械零件多目标优化设计研究

机械零件多目标优化设计是工程设计中常遇到的优化设计问题.提出了一种基于粒子群算法的机械零件多目标优化设计方法与策略,对弹簧零件设计参数进行了多目标优化设计分析.结果表明该方法可用于弹簧参数的多目标优化设计,且计算参数调整简单,应用方便,可根据分目标侧重需要,得到不同分目标偏重的优化设计参数.     

用于车间作业调度的粒子群优化算法

设计了两种不同实现方式的粒子群算法解决车间作业调度问题,即基于粒子位置矢量更新的实现方式和基于遗传操作的实现方式.同时选择一些典型的Job-Shop调度问题作为算法的试验对象,试验结果表明上述两种不同实现方式的粒子群算法在求解小规模调度问题时都能得到较好的结果,在求解较大规模调度问题时基于遗传操作的粒子群算法可以得到更好的结果.这一方面说明了上述两种不同实现方式的粒子群算法在求解调度问题上的有效性,同时也表明基于遗传操作的粒子群算法在求解较大规模调度问题上具有更大的优势.     

基于PSO的车间柔性调度计算

在不确定车间信息环境下的调度策略问题中,提出多目标车间柔性调度的规划模型,并应用粒子群算法进行求解,给出具体的算法应用过程.实验结果验证该模型和算法的有效性及实用性.     

基于禁忌粒子群算法的混流装配线排序研究

为了更好地解决开放式作业域的混流装配线排序问题,建立了以最小化超载时间与平顺化零部件消耗为优化目标的混流装配线排序问题数学模型,并提出了一种禁忌粒子群算法求解该排序问题。针对标准粒子群算法在算法后期搜索精度不足以及容易陷入局部最优不能跳出的缺陷,引入了禁忌搜索算法建立了对最优微粒的重搜索机制来提高算法跳出局部最优的能力,同时给出了禁忌算法中候选解、禁忌表长度、禁忌对象、藐视准则的设置方法,并采用了随机权重的惯性权重更新方式来平衡算法的全局和局部搜索能力,最后建立了禁忌粒子群的算法流程。通过比较禁忌粒子群算法与遗传算法的实例计算结果,验证了禁忌粒子群算法在求解开放式作业域的混流装配线排序问题中的有效性和优越性。     

开放式动态网络车辆路径问题的粒子群算法

针对现有车辆路径问题模型对动态性和开放性的约束限制,建立了开放式动态网络车辆路径的数学模型,使用连续时间依赖函数表示动态网络,并提出了基于惯性权重自适应调整和状态分类更新的粒子群算法求解该问题。根据社会认知理论,每个粒子依据当前位置与种群最优位置和自身历史最优位置的相对关系,动态调整自身的惯性权重。为避免早熟收敛,增加群体的多样性,使用分类更新策略。对于优秀的粒子,通过计算信息熵,使用特殊的状态更新公式计算其状态;对于适应度低的粒子,通过公告板统计出现的频率,进行粒子更新。通过实验仿真,对算法的参数进行了分析,并通过与其他算法的比较,验证了该算法的有效性。     

半导体炉管区批调度问题的粒子群优化算法研究

为改善粒子群算法对大规模问题求解的性能,提出了一种基于文化进化的并行粒子群算法,详细阐述了该算法的原理和具体实施方案.针对半导体炉管区批调度问题,设计了双层粒子群算法,外层应用基于文化进化的并行粒子群算法进行批量计划问题的求解,内层采用传统的粒子群算法求解调度问题.通过对其他文献中的仿真实例进行计算和结果比较表明,该算法优于文献中的启发式算法和蚂蚁算法.     

选配优化在复杂装配中的应用研究

对于结构复杂,装配尺寸精度要求高的产品装配时,为了得到最优的装配组合,考虑封闭环对装配尺寸的影响程度,给出了三种有利于复杂装配优化选配的方法,并行法、主次法和底层优先法.对复杂装配体的选配问题也进行了描述,分析了装配体的装配类型.     

A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines

This research is motivated by our interactions with an electronics manufacturer who assembles and tests printed circuit boards (PCBs) used in consumer products. Environmental stress screening (ESS) chambers are commonly used to test PCBs to detect early failures before they are used in the field. The chambers are capable of testing multiple PCBs simultaneously (i.e., batch processing machines). The minimum testing time of each PCB and their size are known. The objective is to group these PCBs into batches and schedule the batches formed on ESS chambers such that the makespan is minimized. The ESS chambers can process a batch of jobs as long as its capacity is not violated. Each ESS chamber is unique with respect to its capacity. The problem is NP-hard. Consequently, a particle swarm optimization (PSO) algorithm is proposed. The effectiveness of the PSO algorithm is evaluated by comparing its results to a random-key genetic algorithm and a commercial solver used to solve a mixed-integer linear program. A thorough experimental study conducted indicates that the PSO algorithm reports better quality solution in a short time on larger problem instances.     

Particle swarm optimization for achieving the minimum profile error in honing process

Gears are among the most important mechanical components of the modern industry. The topography of the gears’ tooth flank has an intricate and complex form and requires great finishing and quality. Commonly, traditional grinding processes are applied to finishing gear profile. However, the use of honing process has grown in recent years to provide the best finishing in industrial products. In this study, the honing process was improved applying a particle swarm optimization. Pinions of steering systems were used as work pieces to testify the optimization technique. The input parameters were the spindle speed, feed rate in X direction, feed rate in Z direction, oscillation time, and spark out time. The experimental measures were compared with simulation tests using the responses total profile deviation (f_α), total helix deviation (f_β), and total cumulative pitch deviation (f_p). The results showed that profile error was minimized, and the quality was improved based a set of strategies that were held simultaneously in the input parameters.     

Particle swarm optimization for scheduling batch processing machines in a permutation flowshop

Batch processing machines are capable of processing several jobs in a batch simultaneously. These machines are used in many real-life applications. This paper presents solution approaches to schedule batch processing machines arranged in a permutation flowshop in order to minimize its makespan (or completion time of the last batch). The processing time of each job on all the machines and their sizes are given. Each machine can process a batch of jobs as long as its capacity is not violated. The batch processing time is equal to the longest processing job in the batch. Since the problem under study is NP-hard, commercial mixed-integer solvers may require prohibitively long run time to solve even modest sized problems. Consequently, a particle swarm optimization (PSO) algorithm is proposed. Three heuristics to update the particle’s positions are also proposed. The effectiveness of the proposed PSO algorithm is compared with a commercial solver (which was used to solve a mathematical model) and several heuristics from the literature. The experimental study conducted indicates that the proposed PSO algorithm outperforms both the commercial solver and the heuristics in terms of solution quality. The commercial solver requires longer run times compared to PSO.     

基于混合粒子群算法求解多目标混流装配线排序

针对生产调度中的多目标混流装配线排序问题,建立以最小化超载时间、产品变化率与总切换时间为优化目标的数学模型,并提出一种改进的多目标粒子群算法求解。该算法采用基于工件的编码方式,并提出新的解码方法;应用Pareto排序和小生境数评价个体,在此基础上形成了一种新的适应度函数。在个体最优解的更新中,为避免最优解丢失,对非支配粒子与支配粒子采用差异化方法更新。此外,运用两种策略解决粒子群算法过早收敛的问题:在个体最优解的更新中引入模拟退火思想,并将全局最优解的选择扩大到整个种群。通过数值算例研究了算法的收敛性、分布性和执行效率,结果表明了所提算法的优越性。     

基于混沌序列的起重机箱形主梁粒子群优化

为了解决起重机箱形主梁优化设计中的多变量、多约束问题,提出了一种新的基于混沌序列的粒子群优化算法。利用混沌变量的遍历性和随机性,通过Logistic映射生成初始粒子群位置。根据平均粒距描述种群的多样性,通过混沌扰动对早熟个体进行局部搜索,从而跳出局部极小点。起重机箱形主梁优化试验结果表明,新混沌粒子群算法具有收敛速度快,优化精度高的优点。     

Optimization of clearance variation in selective assembly for components with multiple characteristics

Quality is an important aspect of any manufacturing process. Only high quality products can survive in the market. The consumer not only wants quality, precision and trouble-free products, but also wants them at attractive prices. When a product consists of two or more components, the quality of that product depends upon the quality of the mating parts. The mating parts may be manufactured using different machines and processes with different standard deviations. Therefore, the dimensional distributions of the mating parts are not similar. This results in clearance or interference between the mating parts. In some high precision assemblies, it may not be possible to have closer assembly clearance variation with interchangeable system. Selective assembly meets the above requisite and gives an enhanced solution. Selective assembly is a method of obtaining high precision assemblies from relatively low precision components. In this paper, a new selective assembly method is proposed to minimize the clearance variation and surplus parts for a complex assembly which consists of the components viz. piston, piston ring. In this assembly, each component will have more than one quality characteristic contributing for the assembly, for e.g., piston diameter will assemble with cylinder inner diameter; piston groove diameter will assemble with piston ring inner diameter, etc. In selective assembly each quality characteristic will fall in different groups. Non-dominated sorting genetic algorithm (NSGA) is used to find the best combination to obtain the minimum clearance variation in this assembly.     

基于粒子群算法的装配公差优化分配

装配公差分配是产品公差设计的重要组成部分.目前装配公差优化分配主要使用遗传算法.为了提高收敛速度,避免早熟收敛,提出了基于粒子群算法的装配公差优化分配方法.采用了基于实数的编码表示方法,以装配公差分配的优化目标函数作为评价函数,利用罚常数将约束条件并入评价函数中.一个实例的优化结果表明所提方法的收敛性、稳定性和算法效率均优于基于遗传算法的方法.     

城市轨道交通Y型交路列车开行方案粒子群优化设计

列车开行方案通常包括列车停站方案、交路计划及编组方案,是地铁组织运输的基础。结合交通运输组织的实践经验以及输送能力与客流需求达到最佳匹配的原则,以乘客出行成本及企业运营成本最低为目标,综合考虑线路最大通过能力、最小发车频率和最大可用车底数量等限制条件,构建了城市地铁Y型交路模式下的列车开行方案优化模型,并确定了Y型交路模式列车开行方案的主线及支线的列车运行区段及各线的列车开行频率。采用基于分类学习的粒子群算法对其进行求解,并通过算例验证模型和算法的有效性,对折返站和各交路区段的列车开行频率进行各成本的灵敏度分析。结果表明,Y型交路其支线的长度对乘客候车等待时间成本影响显著。     

置换流水车间调度粒子群优化与局部搜索方法研究

采用粒子群优化算法求解置换流水车间调度问题,提出了一种基于工件次序和粒子位置的二维粒子编码方法.为提高粒子群算法的优化性能,在描述了面向置换流水车间调度问题的粒子邻域结构后,提出了三种基于粒子邻域操作的局部搜索方法,分别是基于互换操作、基于插入操作和基于逆序操作的局部搜索方法.计算结果说明,粒子群算法的优化性能好于遗传算法和NEH启发式算法.三种局部搜索算法均能有效地提高粒子群算法的优化性能,采用基于互换操作局部搜索的粒子群算法的优化性能要好于其它两种局部搜索算法.     

交通信息采集无线传感器网络节点部署的微粒群优化方法

针对城市道路交通信息采集无线传感器网络节点部署优化问题,采用传感器网络连通性和覆盖性作为综合评价函数,以满足网络连通性和覆盖性为约束,建立节点部署的约束优化数学模型,并用罚函数法将其转化为无约束优化模型。采用微粒群算法求解,并用动态改变惯性权重方法作为改进算法解决微粒群算法的早熟收敛。以北京市二环以内的道路为例进行模拟实验,结果表明,微粒群算法及其改进算法使优化布局的评价函数值比初始手动布局提高1.71%和3.18%。微粒群算法及其改进算法能够优化交通信息采集的无线传感器网络节点布局。     

An assembly sequence planning approach with a discrete particle swarm optimization algorithm

In this paper, a discrete particle swarm optimization (DPSO) algorithm is proposed to solve the assembly sequence planning (ASP) problem. To make the DPSO algorithm effective for solving ASP, some key technologies including a special coding method of the position and velocity of particles and corresponding operators for updating the position and velocity of particles are proposed and defined. The evolution performance of the DPSO algorithm with different setting of control parameters is investigated, and the performance of the proposed DPSO algorithm to solve ASP is verified through a case study.