求解液压阀块加工车间调度的多作用力微粒群算法

为有效地解决液压阀块加工车间调度问题,考虑工序间和机器间的约束关系,以最大完成时间最小为目标,给出了液压阀块加工车间调度优化模型。为平衡算法的全局和局部搜索能力,提出了多作用力微粒群(MFPSO)算法,采用多作用力阶段性搜索策略,将搜索过程划分为前期、中期、后期3个阶段,并对应构造单一斥力、平衡引斥力、单一引力3种作用力规则,在不同搜索阶段采用不同的作用力规则,提高了算法的搜索机制和寻优性能。将MFPSO算法用于求解液压阀块加工车间调度问题,利用矩阵变量来处理约束条件,给出了一种基于矩阵的微粒编码、解码方法。通过液压阀块加工车间调度优化实例,将MFPSO算法与微粒群算法、中值导向微粒群算法、扩展微粒群算法、蚁群算法进行了对比,结果表明,提出的MFPSO算法结果最优,从而验证了该算法的有效性。     

基于动力驱动微粒群算法的液压矫直机PID控制参数优化

为兼顾微粒群算法收敛速度与跳出局部解的能力，利用阶段性搜索方式将算法搜索过程分为前、后两个不同阶段。在算法的前期搜索阶段，当前微粒受个体最优微粒与全局最优微粒的引力作用，在算法的后期搜索阶段引入中值导向加速度，提出一种动力驱动微粒群算法。最后，针对液压矫直机PID控制的参数优化问题，考虑控制信号、上升时间和误差量的关系，建立液压矫直机PID控制参数优化模型，利用动力驱动微粒群算法优化得到更好的参数组合，实现PID控制参数优化。     

混合粒子交互微粒群算法

针对现有微粒群算法仅考虑单一一种引斥力规则使得其搜索能力存在的不足,考虑在不同搜索阶段采用不同的引斥力规则,提出搜索后期引力增强型混合引斥力微粒群算法(LAPSO算法)。利用拟态物理学中的引斥力规则使粒子保持多样性,提高算法的全局搜索能力;当进入到具有全局最优解的区域时,增强引力作用、减少斥力作用,利用比自身适应度好的粒子和全局最优解粒子的引力作用,提高算法的局部搜索能力。为进一步提高LAPSO算法的优化性能,将其与混合全连接型-环形拓扑结合,提出混合粒子交互微粒群算法(HIPSO算法)。通过6个Benchmark函数进行测试,结果表明,与现有的扩展-微粒群、微-微粒群、中值导向-微粒群等算法相比,所提的LAPSO算法、HIPSO算法具有较好的种群多样性,具有更好的寻优精度、收敛率和最优解搜索能力。结合文献[7]中的柔性流水车间调度离散优化实例和文献[20]中的超声振动加工工艺参数连续优化实例,验证了HIPSO算法的最优解搜索能力。     

有向动态拓扑混合作用力微粒群优化算法及可靠性应用

针对微粒群优化算法易陷入局部最优、出现早熟等不足,从作用力规则和种群拓扑结构两方面进行研究。提出一种混合作用力微粒群优化(Hybrid force PSO,HFPSO)算法,将算法的搜索过程划分为前期和后期两个阶段,分别构造引斥力规则和双引力规则,使算法搜索前期具有良好种群多样性、搜索后期有较高寻优精度。进一步将生物趋利避害的行为选择机制融入HFPSO算法,提出有向动态拓扑混合作用力微粒群优化算法,赋予微粒主观能动性使其靠近适应值较好微粒、远离适应值较差微粒,提出适应值驱动边变化的有向动态拓扑(Fitness-driven edge-changing unidirectional dynamic topology,FEUDT)结构,并将FEUDT结构与HFPSO算法以结构演化和算法进化同步进行的方式结合,进一步提升算法的优化性能。利用Benchmark函数对所提算法与标准PSO、搜索后期斥力增强型混合引斥力微粒群优化(LRPSO)算法进行性能对比测试,结果表明,所提算法具有较好的寻优能力和较快的收敛速度。通过桥式系统可靠性优化实例和供应商参与的某汽车产品子系统可靠性设计优化实例,验证了所提算法求解实际复杂优化问题的有效性。     

搜索后期斥力增强型混合引斥力微粒群算法及可靠性优化应用

将利用贝叶斯网络构造的系统故障概率函数作为可靠性指标,考虑费用、质量、体积构造了资源约束函数。针对微粒群算法引斥力规则的不足,提出了搜索后期斥力增强型混合引斥力微粒群算法(LRPSO算法)：在搜索前期,使微粒在其他微粒的引斥力作用下进行最优搜索,以保持种群多样性;在搜索后期,减小引力、增强斥力,利用斥力项避免微粒陷入较差位置,以提高局部搜索能力。算法测试和可靠性优化实例验证了LRPSO算法的有效性。     

多阶段自适应蝙蝠-蚁群混合群智能算法

针对蝙蝠算法在优化过程中未充分利用蝙蝠间搜索信息交互影响的不足,借鉴拟态物理学中的作用力规则,基于阶段性搜索策略将搜索过程分为两个阶段,分别构造符合算法阶段性搜索特点的作用力规则,提出多形态作用力蝙蝠算法,并利用Benchmark函数对所提算法与标准蝙蝠算法、变异蝙蝠算法、标准微粒群算法、两阶段微粒群算法进行性能对比测试,结果表明,所提算法具有更好的寻优能力.针对标准蚁群算法在离散空间优化时信息素更新机制单一、容易早熟收敛的不足,结合蚁群的实际社会活动提出多阶段自适应信息素机制蚁群优化算法,并在算法出现长时间停滞时,引入混沌算子使算法跳出早熟收敛,更好地发挥蚁群算法的优势,相对于标准蚁群算法、引入差分进化算法交叉变异机制的混合微粒群算法、基于动态局部搜索蚁群算法,所提算法在旅行商问题中具有更高的寻优精度、更好的稳定性.为综合不同群智能算法的优势,针对多形态作用力蝙蝠算法全局搜索能力强、收敛速度快,多阶段自适应信息素机制蚁群优化算法局部精细化能力强的特点,将两种算法串行混合,提出了多阶段自适应蝙蝠-蚁群混合群智能算法.最后,通过液压系统可靠性优化和串-并联多态系统可靠性优化实例,验证了所提混合群智能算法的有效性.     

改进微粒群优化求解置换流水车间调度问题

针对置换流水车间调度问题,提出了一种改进微粒群优化的求解算法。首先,由基于启发式信息的贪婪随机自适应算法得到工件加工顺序,个体最优的初始值不再是随机生成的初始值,而是由该工件加工顺序转化而成;然后,对个体最优解进行了交换型局部搜索;最后,通过对Car系列和Rec系列基准的测试,表明了该算法的有效性。     

一种自适应粒子群算法求解模糊作业车间调度问题

针对模糊加工时间和模糊交货期的车间调度问题,提出自适应离散粒子群算法。鉴于粒子群在搜索后期易早熟的缺点,根据群体聚集程度自适应地更改交叉概率、线性更改变异概率;在搜索后期,依概率进行择优操作,对局部极值进行基于工序块的变异操作,使算法具有更优的性能。仿真实验表明该算法可行有效。     

混沌压缩非线性粒子群算法求解车间调度问题

针对大规模车间调度问题,提出了一种混沌压缩非线性粒子群算法。首先运用多种群策略增加粒子多样性,结合混沌策略和非线性策略改进惯性权重,以平衡全局和局部搜索能力,加快算法后期收敛速度;再引入压缩因子改进算法速度更新公式,加大算法前期搜索范围,以防止算法陷入局部最优;最后用6种车间作业经典算例分别对粒子群算法、遗传算法、灰狼算法和混沌压缩非线性粒子群算法进行检验。实验结果表明,该方法可以显著提升粒子群算法的收敛精度和速度,对于实际大规模车间调度问题适应性较好,能有效提高车间的生产效率。     

基于粒子群算法的车间布局优化应用研究

研究了某机加车间零件生产工艺路线,以典型加工工艺为主要参考,构建车间设备最优布局数学模型。应用基于分工合作的粒子群优化算法,在粒子群搜索的不同阶段给予粒子不同的惯性权值,对模型进行计算求解,提高算法的搜索及收敛效率。通过车间典型加工工艺与设备实例模型,验证了基于粒子群优化算法对车间设备布局优化求解的可行性及有效性。     

A hybrid discrete particle swarm optimization algorithm for solving fuzzy job shop scheduling problem

In this paper, a hybrid algorithm combining particle swarm optimization (PSO) and tabu search (TS) is proposed to solve the job shop scheduling problem with fuzzy processing time. The object is to minimize the maximum fuzzy completion time, i.e., the fuzzy makespan. In the proposed algorithm, PSO performs the global search, i.e., the exploration phase, while TS conducts the local search, i.e., the exploitation process. The global best particle is used to direct other particles to optimal search space. Therefore, in the proposed algorithm, TS-based local search approach is applied to the global best particle to conduct find-grained exploitation. In order to share information among particles, one-point crossover operator is embedded in the hybrid algorithm. The proposed algorithm is tested on sets of the well-known benchmark instances. Through the analysis of experimental results, the highly effective performance of the proposed algorithm is shown against the best performing algorithms from the literature.     

基于粒子群优化的开放式车间调度

开放式车间调度(OSP)是重要的调度问题,它在制造领域中的应用非常广泛。优化调度算法是调度理论的重要研究内容。基于人工智能的元启发式算法是解决该问题的常用方法。分析了一种新的元启发式算法——粒子群优化(PSO)在信息共享机制上的缺陷,提出新的基于群体智能的信息共享机制。在该信息共享机制的基础上, 设计新的基于PSO的元启发式调度算法——PSO-OSP。该算法利用问题的邻域知识指导局部搜索,可克服元启发式算法随机性引起的盲目搜索。该算法应用于开放式车间调度问题的标准测试实例。仿真结果显示,PSO-OSP算法在加快收敛速度的同时提高了开放式车间调度解的质量。     

Solving a multi-objective job shop scheduling problem with sequence-dependent setup times by a Pareto archive PSO combined with genetic operators and VNS

In this paper, we present a combination of particle swarm optimization (PSO) and genetic operators for a multi-objective job shop scheduling problem that minimizes the mean weighted completion time and the sum of the weighted tardiness/earliness costs, simultaneously. At first, we propose a new integer linear programming for the given problem. Then, we redefine and modify PSO by introducing genetic operators, such as crossover and mutation operators, to update particles and improve particles by variable neighborhood search. Furthermore, we consider sequence-dependent setup times. We then design a Pareto archive PSO, where the global best position selection is combined with the crowding measure-based archive updating method. To prove the efficiency of our proposed PSO, a number of test problems are solved. Its reliability based on some comparison metrics is compared with a prominent multi-objective genetic algorithm (MOGA), namely non-dominated sorting genetic algorithm II (NSGA-II). The computational results show that the proposed PSO outperforms the above MOGA, especially for large-sized problems.     

An effective hybrid particle swarm optimization for no-wait flow shop scheduling

The no-wait flow shop scheduling that requires jobs to be processed without interruption between consecutive machines is a typical NP-hard combinatorial optimization problem, and represents an important area in production scheduling. This paper proposes an effective hybrid algorithm based on particle swarm optimization (PSO) for no-wait flow shop scheduling with the criterion to minimize the maximum completion time (makespan). In the algorithm, a novel encoding scheme based on random key representation is developed, and an efficient population initialization, an effective local search based on the Nawaz-Enscore-Ham (NEH) heuristic, as well as a local search based on simulated annealing (SA) with an adaptive meta-Lamarckian learning strategy are proposed and incorporated into PSO. Simulation results based on well-known benchmarks and comparisons with some existing algorithms demonstrate the effectiveness of the proposed hybrid algorithm.     

A hybrid particle swarm optimization algorithm for a no-wait flow shop scheduling problem with the total flow time

This paper proposes a particle swarm optimization (PSO) algorithm based on memetic algorithm (MA) that hybridizes with a local search method for solving a no-wait flow shop scheduling problem. The main objective is to minimize the total flow time. Within the framework of the proposed algorithm, a local version of PSO with a ring-shape topology structure is used as global search. In addition, a self-organized random immigrant's scheme is extended into our proposed algorithm in order to further enhance its exploration capacity for new peaks in search space. The experimental study over the moving peaks benchmark problem shows that the proposed PSO-based MA is robust. Finally, the analysis of the computational results and conclusion are given.     

基于遗传-粒子群混合算法的柔性作业车间多资源调度问题

在传统柔性作业车间调度问题(FJSP)中加入运输和装配环节,提出一种柔性作业车间多资源调度问题(MRFJSP),以完工时间最短为目标建立了包含加工、运输和装配的柔性作业车间调度模型。为了提高传统遗传算法(GA)在车间调度问题中的寻优能力,将粒子群算法(PSO)的寻优过程进行改进并与遗传算法进行结合,提出一种带保优策略的遗传-粒子群混合算法,利用单层编码对模型进行求解。通过算例验证了模型的可行性,并将提出的混合算法与遗传算法和粒子群算法进行比较,证明了混合算法的优越性。     

Reentrant two-stage multiprocessor flow shop scheduling with due windows

Reentrant flow shop scheduling allows a job to revisit a particular machine several times. The topic has received considerable interest in recent years; with related studies demonstrating that particle swarm algorithm (PSO) is an effective and efficient means of solving scheduling problems. By selecting a wafer testing process with the due window problem as a case study, this study develops a farness particle swarm optimization algorithm (FPSO) to solve reentrant two-stage multiprocessor flow shop scheduling problems in order to minimize earliness and tardiness. Computational results indicate that either small- or large-scale problems are involved in which FPSO outperforms PSO and ant colony optimization with respect to effectiveness and robustness. Importantly, this study demonstrates that FPSO can solve such a complex scheduling problem efficiently.     

A discrete PSO for two-stage assembly scheduling problem

In this paper, a discrete particle swarm optimization (PSO) algorithm called DPSO is proposed to solve the two-stage assembly scheduling problem with respect to bicriteria of makespan and mean completion time where setup times are treated as separate from processing times. In DPSO, the particle velocity representation is redefined, and particle movement is modified accordingly. In order to refrain from the shortcoming of premature convergence, individual intensity is defined, which is used to control adaptive mutation of the particle, and mutation mode is decided by the individual fitness. Furthermore, a randomized exchange neighborhood search is introduced to enhance the local search ability of the particle and increase the convergence speed. Finally, the proposed algorithm is tested on different scale problems and compared with the proposed efficient algorithms in the literature recently. The results show that DPSO is an effective and efficient for assembly scheduling problem.