求解车间调度问题的自适应混合粒子群算法

针对最小完工时间的流水车间作业调度问题,提出了一种自适应混合粒子群进化算法--AHPSO,将遗传操作有效地结合到粒子群算法中.定义了粒子相似度及粒子能量,粒子相似度阈值随迭代次数动态自适应变化,而粒子能量阈值与群体进化程度及其自身进化速度相关.此外,针对算法运行后期进化速度慢的缺点,提出了一种基于邻域的随机贪心策略进一步提高算法的性能.最后将此算法在不同规模的实例上进行了测试,并与其他几种具有代表性的算法进行了比较,实验结果表明,无论是在求解质量还是稳定性方面都优于其他几种算法,并且能够有效求解大规模车间作业问题.     

A hybrid meta-heuristic algorithm for optimization of crew scheduling

Crew scheduling problem is the problem of assigning crew members to the flights so that total cost is minimized while regulatory and legal restrictions are satisfied. The crew scheduling is an NP-hard constrained combinatorial optimization problem and hence, it cannot be exactly solved in a reasonable computational time. This paper presents a particle swarm optimization (PSO) algorithm synchronized with a local search heuristic for solving the crew scheduling problem. Recent studies use genetic algorithm (GA) or ant colony optimization (ACO) to solve large scale crew scheduling problems. Furthermore, two other hybrid algorithms based on GA and ACO algorithms have been developed to solve the problem. Computational results show the effectiveness and superiority of the proposed hybrid PSO algorithm over other algorithms.     

一种改进的粒子群优化算法及其仿真

粒子群优化算法(particle swarm optimization,PSO)是一种新兴的优化技术,其思想来源于人工生命和演化计算理论。PSO算法具有简单、易实现、可调参数少等特点,在很多领域得到了广泛应用。但PSO算法存在早熟收敛问题。为了克服粒子群优化算法的早熟收敛问题,提出了一种旨在保持种群多样性的改进PSO(IPSO)算法,以提高PSO算法摆脱局部极小点的能力。通过对3种Benchmark函数的测试,结果表明IPSO算法不仅具有较快的收敛速度、有效的全局收敛性能,而且还具有良好的稳定性。     

An efficient chaotic based PSO for earliness/tardiness optimization in a batch processing flow shop scheduling problem

The flow shop is a well-known class of manufacturing system for production process planning. The need for scheduling approaches arises from the requirement of most systems to implement more than one process at a moment. Batch processing is usually carried out to load balance and share system resources effectively and gain a desired quality of service level. A flow shop manufacturing problem with batch processors (BP) is discussed in current paper so as to minimize total penalty of earliness and tardiness. To address the problem, two improved discrete particle swarm optimization (PSO) algorithms are designed where most important properties of basic PSO on velocity of particles are enhanced. We also employ the attractive properties of logistic chaotic map within PSO so as to investigate the influence of chaos on search performance of BP flow shop problem. In order to investigate the suggested algorithms, a comprehensive computational study is carried out and performance of algorithms is compared with (1) a commercial optimization solver, (2) a well-known algorithm from PSO’s literature and (3) three algorithms from BP’s literature. The experimental results demonstrate the superiority of our algorithm against others.     

改进粒子群算法优化扩展卡尔曼滤波器电机转速估计

针对感应电机扩展卡尔曼滤波器转速估计中难以取得卡尔曼滤波器系统噪声矩阵和测量噪声矩阵最优值的问题, 提出了一种基于改进粒子群算法优化的扩展卡尔曼滤波器转速估计方法。算法通过融合遗传算法和粒子群算法的优点, 采用可调整的算法模型对粒子群算法进行改进, 将改进的粒子群算法对扩展卡尔曼滤波器中的系统噪声矩阵和测量噪声矩阵进行优化处理, 将优化后的卡尔曼滤波器应用于感应电机转速估计。仿真实验表明, 与试探法、标准粒子群算法及遗传算法比较, 改进粒子群算法优化的扩展卡尔曼滤波器能够有效提高转速估计的精度, 从而提高无速度传感器矢量控制系统的控制性能。     

批量无等待调度问题的微粒群蛙跳混合优化算法*

将离散微粒群与蛙跳算法相结合解决以最大完工时间为指标的批量无等待流水线调度问题.结合微粒群算法较强的全局收敛能力和蛙跳算法较强的深度搜索能力,设计了三种混合算法,平衡了算法的全局开发能力和局部探索能力.对随机生成不同规模的实例进行了广泛的实验,仿真实验结果的比较表明了所得混合算法的有效性和高效性.     

An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem

Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. Although the traditional optimization algorithms could obtain preferable results in solving the mono-objective FJSP. However, they are very difficult to solve multi-objective FJSP very well. In this paper, a particle swarm optimization (PSO) algorithm and a tabu search (TS) algorithm are combined to solve the multi-objective FJSP with several conflicting and incommensurable objectives. PSO which integrates local search and global search scheme possesses high search efficiency. And, TS is a meta-heuristic which is designed for finding a near optimal solution of combinatorial optimization problems. Through reasonably hybridizing the two optimization algorithms, an effective hybrid approach for the multi-objective FJSP has been proposed. The computational results have proved that the proposed hybrid algorithm is an efficient and effective approach to solve the multi-objective FJSP, especially for the problems on a large scale.     

微粒群算法在印染企业车间调度中的研究应用

在对某印染企业的生产状况进行了深入调研和分析的基础上,对流水车间调度、混合流水车间调度和作业车间调度进行了对比研究。同时对微粒群算法进行了深入研究,并根据实际情况对算法进行了部分改动和改进,使之能适用于离散的生产调度问题。最后将改进后的微粒群算法应用到花布印染企业的车间调度中,对加工任务进行优化调度,并实现甘特图的动态生成。论文的结果可直接应用于企业流水车间调度和作业车间调度,具有一定的实际应用价值。     

微粒群优化算法在车间调度中的研究与应用

在对某印染企业的生产状况进行了深入调研和分析的基础上,对流水车间调度、混合流水车间调度进行了对比,同时对微粒群算法进行了深入研究,并根据实际情况对算法进行了部分改动和改进,使之能适用于离散的生产调度问题.最后将改进后的微粒群算法应用到印染企业的车间调度中,同时实现了甘特图的动态生成.研究结果可直接应用于企业流水车间调度和作业车间调度,具有一定的实际应用价值.     

一种求解作业车间调度的文化粒子群算法*

提出了一种文化粒子群算法用于求解置换流水车间调度问题中的最小化最大完成时间。算法设置了群体空间和信念空间两类独立空间,群体空间采用自适应粒子群算法完成进化,信念空间通过更新函数来进行演化。算法中群体空间的粒子群不但通过跟踪个体极值和全局极值来更新自己,实现群体演化,而且通过不断与信念空间中的优秀个体交互,加快群体的收敛速度。该算法在不同规模的问题实例上与其他几个具有代表性的算法的比较结果表明,该算法具有较快的收敛速度,无论是在求解质量还是稳定性方面都优于比较的算法。     

基于改进DPSO的网格资源调度算法

基于市场经济模型的网格资源调度问题是一个典型的离散问题及NP-Hard问题,考虑到离散粒子群优化算法在解决离散问题上的有效性,本文在现有算法的研究基础上,提出一种基于改进的离散粒子群优化算法的网格资源分配和任务调度算法,并采用GridSim模拟器对相关算法进行仿真模拟实验和比较。实验结果表明,本文提出的调度算法在作业完成时间、综合性能以及资源的负载平衡方面均具有较大的优势。     

基于GA-PSO的天基预警系统资源调度方法

为解决天基预警系统中的卫星资源调度问题,从预警任务特点出发,在对预警任务进行分解的基础上,建立了资源调度模型．结合传统遗传算法（GA）和粒子群算法（PSO）的优点,采用一种混合遗传粒子群（GA-PSO）算法来求解资源调度问题．该算法在解决粒子编解码问题的前提下,将遗传算法的遗传算子应用于粒子群算法,改善了粒子群算法的寻优能力．实验结果表明,提出的算法能有效解决多目标探测时天基预警系统的资源调度问题,调度结果优于传统粒子群算法和遗传算法．     

An improved particle swarm optimization algorithm based on comparative judgment

Particle swarm optimization (PSO) algorithm is one of the most effective and popular swarm intelligence algorithms. In this paper, based on comparative judgment, an improved particle swarm optimization (IPSO) is proposed. Firstly, a new search equation is developed by considering individual experience, social experience and the integration of individual and social experience, which can be used to improve the convergence speed of the algorithm. Secondly, in order to avoid falling into a local optima, a location abandoned mechanism is proposed; meanwhile, a new equation to generate a new position for the corresponding particle is proposed. The experimental results show that IPSO algorithm has excellent solution quality and convergence characteristic comparing to basic PSO algorithm and performs better than some state-of-the-art algorithms on almost all tested functions.     

Elucidating multiprocessors flow shop scheduling with dependent setup times using a twin particle swarm optimization

Particle swarm optimization (PSO) is a novel metaheuristic, which has been applied in a wide variety of production scheduling problems. Two basic characteristics of this algorithm are its efficiency and effectiveness in providing high-quality solutions. In order to improve the traditional PSO, this study proposes the incorporation of a local search heuristic into the basic PSO algorithm. The new, hybrid, metaheuristic is called “twin particle swarm optimization (TPSO)”. The proposed metaheuristic scheme is applied to a flow shop with multiprocessors scheduling problem, which can be considered a real world case regarding the production line. This study, as far as the multiprocessors flow shop production system is concerned, utilizes sequence dependent setup times as constraints. Finally, simulated data confirm the effectiveness and robustness of the proposed algorithm. The data test results indicate that TPSO has potential to replace PSO and become a significant heuristic algorithm for similar problems.     

Optimization of cloud computing task execution time and user QoS utility by improved particle swarm optimization

In order to optimize the quality of service (QoS) and execution time of task, a new resource scheduling based on improved particle swarm optimization (IPSO) is proposed to improve the efficiency and superiority. In cloud computing, the first principle of resource scheduling is to meet the needs of users, and the goal is to optimize the resource scheduling scheme and maximize the overall efficiency. This requires that the scheduling of cloud computing resources should be flexible, real-time and efficient. In this way, the mass resources of cloud computing can effectively meet the needs of the cloud users. Field Programmable Gate Arrays (FPGA), high performance and energy efficiency in one field. Most of them would have been the particle algorithm. The current technological development is still in-depth at super-resolution image research at an unprecedentedly fast pace. In particular, systemic origin applications get a lot of attention because they have a wide range of abnormal results. The scientific resource scheduling algorithm is the key to improve the efficiency of cloud computing resources distribution and the level of cloud services. In addition, the physical model of cloud computing resource scheduling is established. The performance of the IPSO algorithm applied to cloud computing resource scheduling is analysed in the design experiment. The comparison result shows that the new algorithm improves the PSO by taking full account of the user's Qu's requirements and the load balance of the cloud environment. In conclusion, the research on cloud computing resource scheduling based on IPSO can solve the problem of resource scheduling to a certain extent.     

差分进化粒子群算法求解发电资源调度问题

为了有效地解决水火电力系统资源短期优化调度问题,提出了一种基于差分进化粒子群的调度算法。设计了水火电力系统资源调度问题的数学模型,给出了差分进化粒子群优化算法的框架,通过PSO种群和DE种群之间的信息交流机制以寻求全局最优位置,从而使算法具有动态自适应性,能够较容易地跳出局部最优。实验结果表明,该算法能有效解决水火发电资源调度问题,具有较好的应用价值。     

改进微粒群算法求解模糊交货期Flow-shop调度问题

针对模糊交货期Flow-shop调度问题的特点,论文提出用微粒群这种具有快速收敛、全局性能好的迭代优化算法进行求解,并使用惩罚函数、增加数据记忆库和自适应变异机制等方法对微粒群算法进行改进,减少了算法陷入局部极值的可能性。通过仿真实例,改进微粒群算法的全局寻优、收敛性和克服早熟的能力均优于遗传、启发式算法。     

解决具有混合约束柔性流水车间调度问题的粒子群优化算法

针对既存在阻塞限制工件又存在无等待约束工件的柔性流水车间调度问题, 提出了一种离散粒子群优化的求解方法。该方法采用基于排列的编码形式, 设计了推进—迭代算法进行解码并计算问题目标值, 利用离散粒子群优化算法进行全局优化, 利用迭代贪婪(iterated greedy, IG)算法提高种群个体的局部搜索能力。此外, 根据问题特点, 提出最早释放优先(first release first, FRF)和最早完工优先(first complete first, FCF)两种机器分配策略。仿真结果表明, 所提出的方法求解混合约束下柔性流水车间调度问题是可行的、有效的。     

应用强化学习算法求解置换流水车间调度问题

面对日益增长的大规模调度问题,新型算法的开发越显重要.针对置换流水车间调度问题,提出了一种基于强化学习Q-Learning调度算法.通过引入状态变量和行为变量,将组合优化的排序问题转换成序贯决策问题,来解决置换流水车间调度问题.采用所提算法对OR-Library提供Flow-shop国际标准算例进行测试,并与已有的一些算法对比,结果表明算法的有效性.     

应用微粒群算法确定有机化合物分子式

针对基本微粒群优化算法（PSO）存在容易陷入局部最优和收敛速度慢的缺点,在整数空间使用带收缩因子的微粒群优化算法基础上,提出了一种带变异概率的微粒群优化算法（IPSO）,用于提高微粒群的多样性,避免算法陷入局部最优解。实验证明,改进后的微粒群优化算法在防止早熟和加快收敛方面优于基本PSO算法和基本PSO算法加一半微粒随机初始化算法（PSO_HPO算法）。IPSO算法应用到确定有机化合物分子式时,取得了很好的效果。