Simulated Annealing Algorithm to Minimize Makespanin Single Machine Scheduling Problem withUniform Parallel Machines

This paper presents a simulated annealing algorithm to minimize makespan of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. Since, this scheduling problem is a combinatorial problem;usage of a heuristic is inevitable to obtain the solution in polynomial time. In this paper, simulated annealing algorithm is presented. In the first phase, a seed generation algorithm is given. Then, it is followed by three variations of the simulated annealing algorithms and their comparison using ANOVA in terms of their solutions on makespan.

Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines

This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrelated parallel machines. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for such problem is highly inevitable. In this paper, two different Meta-heuristics to minimize the makespan of the assumed problem are designed and they are compared in terms of their solutions. In the first phase, the simulated annealing algorithm is presented and then GRASP (Greedy Randomized Adaptive Search procedure) is presented to minimize the makespan in the single machine scheduling problem with unrelated parallel machines. It is found that the simulated annealing algorithm performs better than GRASP.

Sequencing Mixed-model Production Systems by Modified Multi-objective Genetic Algorithms

As two independent problems,scheduling for parts fabrication line and sequencing for mixed-model assembly line have been addressed respectively by many researchers.However,these two problems should be considered simultaneously to improve the efficiency of the whole fabrication/assembly systems.By far,little research effort is devoted to sequencing problems for mixed-model fabrication/assembly systems.This paper is concerned about the sequencing problems in pull production systems which are composed of one mixed-model assembly line with limited intermediate buffers and two flexible parts fabrication flow lines with identical parallel machines and limited intermediate buffers.Two objectives are considered simultaneously：minimizing the total variation in parts consumption in the assembly line and minimizing the total makespan cost in the fabrication/assembly system.The integrated optimization framework,mathematical models and the method to construct the complete schedules for the fabrication lines according to the production sequences for the first stage in fabrication lines are presented.Since the above problems are non-deterministic polynomial-hard（NP-hard）,a modified multi-objective genetic algorithm is proposed for solving the models,in which a method to generate the production sequences for the fabrication lines from the production sequences for the assembly line and a method to generate the initial population are put forward,new selection,crossover and mutation operators are designed,and Pareto ranking method and sharing function method are employed to evaluate the individuals＇ fitness.The feasibility and efficiency of the multi-objective genetic algorithm is shown by computational comparison with a multi-objective simulated annealing algorithm.The sequencing problems for mixed-model production systems can be solved effectively by the proposed modified multi-objective genetic algorithm.

An optimizing algorithm of static task scheduling problem based on hybrid genetic algorithm

To reduce resources consumption of parallel computation system, a static task scheduling opti- mization method based on hybrid genetic algorithm is proposed and validated, which can shorten the scheduling length of parallel tasks with precedence constraints. Firstly, the global optimal model and constraints are created to demonstrate the static task scheduling problem in heterogeneous distributed computing systems（HeDCSs）. Secondly, the genetic population is coded with matrix and used to search the total available time span of the processors, and then the simulated annealing algorithm is introduced to improve the convergence speed and overcome the problem of easily falling into local minimum point, which exists in the traditional genetic algorithm. Finally, compared to other existed scheduling algorithms such as dynamic level scheduling （ DLS）, heterogeneous earliest finish time （HEFr）, and longest dynamic critical path（ LDCP）, the proposed approach does not merely de- crease tasks schedule length, but also achieves the maximal resource utilization of parallel computa- tion system by extensive experiments.

A Multi-Criteria Decision Making for the Unrelated Parallel Machines Scheduling Problem

In this paper, we propose a multi-criteria machine-schedules decision making method that can be applied to a produc-tion environment involving several unrelated parallel machines and we will focus on three objectives: minimizing makespan, total flow time, and total number of tardy jobs. The decision making method consists of three phases. In the first phase, a mathematical model of a single machine scheduling problem, of which the objective is a weighted sum of the three objectives, is constructed. Such a model will be repeatedly solved by the CPLEX in the proposed Multi-Objective Simulated Annealing (MOSA) algorithm. In the second phase, the MOSA that integrates job clustering method, job group scheduling method, and job group – machine assignment method, is employed to obtain a set of non-dominated group schedules. During this phase, CPLEX software and the bipartite weighted matching algorithm are used repeatedly as parts of the MOSA algorithm. In the last phase, the technique of data envelopment analysis is applied to determine the most preferable schedule. A practical example is then presented in order to demonstrate the applicability of the proposed decision making method.

改进粒子群算法的不相关并行批处理调度优化

针对粒子群优化(particle swarm optimization,PSO)算法在处理不相关并行批处理调度问题中存在的种群多样性丢失、易陷入局部最优等问题,提出了一种改进PSO的调度优化算法,用于最小化最大完工时间求解。采用基于工件序列的实数编码方式进行编码操作;基于该问题的混合整数规划模型,设计了一种J_B局部搜索的新策略;将模拟退火算法的Metropolis准则引入种群粒子的个体极值搜索。通过随机生成的小型、中型和大型实例对该算法的性能进行了测试,并与针对该调度问题提出的元启发式算法和其他3种元启发式算法进行了比较。实验结果和统计测试表明,该算法的性能明显优于对比算法。

基于并行协同的多车间协同调度问题研究

传统企业在实际生产中,其多个关联车间之间的生产计划与调度存在难以协作的问题。为此,针对多车间协同调度问题建立了调度模型,提出了一种多车间协同调度的并行协同进化遗传算法(PCE-GA),并且采用该算法对上述模型进行了求解。首先,以最小化订单完工时间为目标,建立了单目标调度模型;然后,采用了并行协同进化遗传算法,对上述单目标调度模型进行了求解,基于工件、机器、装配关系的三层整数编码的染色体编码方案,提出了一种协同适应度值计算的方法;最后,以某液压缸生产企业为例,针对单目标调度问题,采用该算法与单车间遗传算法(JSP-GA)、并行协同模拟退火算法(PCE-SA)分别进行了求解,并对其结果进行了比较,以验证PCE-GA算法的优越性。研究结果表明:采用PCE-GA算法得到的优化率为13.3%,比单车间作业调度遗传算法求解的数据优化11.5%,该结果证明了PCE-GA算法在解决多车间协同优化问题时的优越性。

带恶化和学习效应的不相关并行机调度优化

研究了以同时最小化makespan和总加权拖期为目标的具有恶化和学习效应的不相关并行机调度问题。针对此类NP-hard问题,设计了基于两段式编码的改进模拟退火算法,结合随机程序和均匀分配策略分别产生第一段的工件加工序列编码和第二段的机器加工信息编码,以获取问题初始调度解,进而提出了分段式交换和变异扰动操作以得到更新后的新解。通过仿真实验测试改进模拟退火算法,将其与一些启发式算法对比,结果表明,所提算法可获得更好的近优解。

基于遗传算法和并行组合模拟退火算法的洪水过程缩放模型研究

针对泄洪风险和施工导流风险计算对洪水缩放的要求和传统洪水同频率放大方法中手工修匀任意性较大等方面的不足,提出采用计算机优化方法来实现洪水过程的自动放大。在满足洪峰流量约束和分时段洪量约束条件下,本文建立了以洪水过程模式尽量相似为目标的洪水过程放大优化模型,并采用具有全局搜索能力的遗传算法和并行组合模拟退火算法求解该模型。通过实例计算可以看出,这两种算法计算结果均能较好的满足洪峰洪量约束要求,并有效保持了典型洪水的模式,避免了人工修匀的任意性。

基于模拟退火机制的多种群并行遗传算法

模拟退火和多种群并行遗传进化是两种较好的改进遗传算法性能的方法 .将这两种思想有机地结合起来 ,提出了一种基于模拟退火机制的多种群并行遗传算法 .仿真结果表明 ,该算法不仅能增强算法的全局收敛性 ,还能加快遗传进化速度 ,得到满意的全局最优值 .

基于并行模拟退火算法求解时间依赖型车辆路径问题

为提高传统串行模拟退火算法求解时间依赖型车辆路径问题的效率,提出一种并行模拟退火算法。该算法首先使用前向插入启发式算法生成初始解,在主从式并行模拟退火算法框架下使用4种邻域搜索法对初始解进行优化。采用Figliozzi测试数据库(包含56个测试问题,顾客数均设定为100)对算法性能进行测试,结果表明在不同时间依赖型行驶函数情形下,当使用6个线程时,并行模拟退火算法相对于传统串行模拟退火算法可以得到近似于5倍的加速比,且均能在较快时间内得到比Figliozzi算法更优的解。因此,并行模拟退火算法能有效地求解时间依赖型车辆路径问题,并且可以灵活地扩展解决其他车辆路径问题和组合优化问题。

机组组合问题的扩展Hopfield神经网络算法

从 Hopfield神经网络的原理和机组组合问题的特点出发 ,提出了一种适合解决机组组合问题的扩展 Hopfield神经网络算法。该算法结合了 Hopfield神经网络和模拟退火算法 ( SA)的优点 ,对整数变量取值范围进行了可行的扩展 ,有效地避免了陷入局部最优。同时 ,该算法无须进行额外的负荷经济分配 ,故能迅速、高效地搜索到系统的高质量优化解。对于实际系统的仿真计算结果证明了该算法的有效性 ,并且 ,方法本身具有良好的并行性 ,易于在并行计算机上实现 。

自适应光学系统几种随机并行优化控制算法比较

直接对系统性能指标进行优化是自适应光学系统中一种重要的波前畸变校正方法,选择合适的随机并行优化控制算法是该技术成功实现的关键。以32单元变形镜为校正器,基于多种随机并行优化算法建立自适应光学系统仿真模型。从算法的收敛速度、校正效果、局部极值3个方面对遗传算法、单向扰动随机并行梯度下降、双向扰动随机并行梯度下降及模拟退火算法进行了比较。仿真结果表明,遗传算法收敛速度太慢,不适用于需要实时控制的自适应光学系统;双向扰动随机并行梯度下降算法收敛速度、校正效果要优于单向扰动随机并行梯度下降,且能够适应各种情况下的扰动电压;模拟退火几乎以概率1收敛到全局极值附近,且收敛速度是上述算法中最快的。

智能混合优化策略及其在流水作业调度中的应用

通过结合蚁群算法(ACO)的并行搜索结构和模拟退火算法(SA)的概率突跳性,提出了一种有效的混合优化策略,并将该策略应用于流水作业调度问题(FSP).在该策略中,蚁群系统的一个周游路线为模拟退火算法提供了一系列初始解,在每个退火温度上进行抽样准则检验并产生新解,然后更新信息激素;蚁群算法再利用模拟退火算法产生的新解进行并行搜索.同时,根据此策略构建并实现了针对FSP问题求解的具体混合算法.仿真结果表明,混合算法弥补了ACO易陷入局部最优和SA搜索效率较低的缺点,增强了全局搜索能力,在求解FSP调度问题的性能上也优于其他算法.

基于模拟退火的并行基因表达式编程算法研究

本文提出一种基于GEP的混合并行算法,将模拟退火机制与遗传机制结合,以提高算法跳出局部最优的能力;同时引入多种群策略和迁移算子,实现了运行于一定规模处理器内的粗粒度可扩展并行计算.对序列推理、函数发现和太阳黑子预测三组数据测试,与用基本GEP算法的结果进行对比,实验表明改进的算法具有更强的寻优能力和更高的稳定性.

基于混合遗传退火算法的并行测试任务调度优化

并行测试任务的优化调度是并行测试技术的核心问题之一。可以充分利用混合遗传退火算法优异的全局最优搜索能力来寻找具有最大并行率的并行任务序列。首先,建立了并行测试任务调度问题的数学模型;给出了并行率的定义,设计了一种满足资源约束与任务时序约束的基因编码方法及相应的遗传退火操作方案。最后,对实例进行仿真实验,结果验证了该算法的有效性及优越性。

基于Petri网和模拟退火遗传算法的并行测试研究

针对自动测试系统中并行测试任务调度复杂、难以优化的问题,提出了一种Petri网技术和模拟退火遗传算法相结合的任务调度优化算法。首先为并行测试系统建立时间Petri网模型,然后将激发的变迁序列集作为并行测试任务调度路径。为了得到最优路径,引入模拟退火遗传(GASA)算法进行搜索。在搜索过程中,将能激发的变迁序列作为染色体,进行选择、交叉和变异。为了防止算法出现收敛过早,陷入局部最优解的现象,还要对个体进行模拟退火操作,最后得到测试完成时间最短的任务调度序列。

基于蚁群系统的工件排序问题的一种新算法

工件排序问题中如何使加工效率最高 ,一直是一个非常重要而且又非常困难的问题 .特别是问题的规模很大时 ,目前各种算法计算就非常困难 ,有的甚至无法得到合理的方案 .蚁群系统是近年来发展起来的解决组合优化问题的一种有效方法 .根据工件排序问题的特点 ,建立了在不同种类的并行机上加工一批不同种类工件的优化数学模型 .在蚁群算法的基础上对其进行了改进 ,成功地把改进的蚁群算法用于工件排序问题的优化中 .通过与其他算法的仿真比较 ,表明基于蚁群系统的算法是有效的 。

基于模拟退火并行遗传算法的Otsu双阈值医学图像分割

模拟退火和并行遗传算法是两种较好的改进进化算法性能的方法。将这两种思想有机地结合起来,利用遗传算法能全局寻优的优势和模拟退火算法的爬山性能,提出了一种基于模拟退火并行遗传算法的Otsu双阈值医学图像分割算法。在该算法中,进化在多个不同的子群中并行进行,利用模拟退火算法的爬山性能,避免单种群进化过程中出现的过早收敛现象,提高整个算法的收敛速度。实验证明,这种新的图像分割算法与并行遗传算法相比,不仅能够对图像进行准确的分割,而且具有更强的精确性和稳定性。其收敛速度明显比并行遗传算法的Otsu双阈值医学图像分割快。

一种模拟退火和粒子群混合优化算法

针对粒子群优化算法(PSO)容易陷入局部极值点、进化后期收敛慢和优化精度较差等缺点。把模拟退火技术(SA)引入到PSO算法中,提出了一种混合优化算法。混合优化算法在各温度下依次进行PSO和SA搜索,是一种两层的串行结构。由于PSO提供了并行搜索结构,所以,混合优化算法使SA转化成并行SA算法。SA的概率突跳性保证了种群的多样性,从而防止PSO算法陷入局部极小。混合优化算法保持了PSO算法简单容易实现的特点,改善了算法的全局优化能力,提高了算法的收敛速度和计算精度。仿真结果表明,混合优化算法的优化性能优于基本PSO算法。