求解带AGV柔性作业车间调度问题的改进灰狼算法

针对带AGV的柔性作业车间调度问题,以最小化完工时间为目标,考虑AGV在装载站、机器、卸载站之间的有效负载时间和空载时间,构建了数学规划模型。其次,提出一种有效的灰狼算法进行求解,基于该问题特征,设计机器选择、工序排序和AGV搬运的3段编码,有效地保证每个个体均可产生可行解;灰狼算法中改进了关键参数a和E设定方式,有效平衡了算法的勘探能力和局部搜索能力;为进一步提升算法跳出局部最优解的能力,该算法融合了领域搜索等方法。最后,案例测试结果表明,改进灰狼算法在求解带AGV柔性作业车间调度问题中具有优越的性能。     

考虑工序并行的差异工件批调度研究

针对铸造车间差异工件组批多约束的问题,在工序可并行加工的前提下构建以最小化最大完工时间和最小化沙箱空置率为优化目标的并行工序批调度模型,设计一种改进和声算法求解该调度模型,提出一种单工序编解码方式和2种机器分配规则用于解决工件分批、沙箱选择、工序分配及机器选择的问题。在算法中提出一种新的和声产生方式和更新机制,同时为改善算法的局部搜索能力,加入模拟退火算法执行局部搜索过程。最后根据企业实际生产数据进行仿真实验,验证本文模型的有效性。     

工期不确定的模具车间柔性Flow-shop调度问题

由于模具制造属于非重复性单件订货生产,模具加工的任务工期具有较强的不确定性,导致生产调度混乱。为制定合理可行的生产调度方案,建立了任务工期离散概率模型,以最大完工时间的期望值最小为目标,建立不确定工期柔性Flow-shop调度模型;在遗传算法交叉、变异等操作中融入模拟退火操作,将遗传算法的全局搜索能力与模拟退火算法的良好局部搜索能力相结合,设计了不确定工期的柔性Flow-shop调度问题混合遗传模拟退火算法。利用混合遗传模拟退火算法对调度模型进行求解,通过仿真实验表明,该研究对于解决工期不确定的模具车间柔性Flow-shop调度问题是行之有效的。     

光伏电池片生产车间智能物流调度研究

为实现光伏电池片生产车间物流的智能化改造,提出以最大化瓶颈工序机台产能的方式来最大化生产车间产能,并设计相关数学模型和智能物流调度算法。首先,通过对光伏电池片生产车间的问题描述与分析,建立以瓶颈工序机台产能最大化（瓶颈工序机台总停机时间最短）为目标的数学模型。然后,设计了嵌入模型约束规则的车间智能物流调度算法,包括物料调度算法、AGV选择与路径规划、AGV碰撞避免策略设计等,并提出了另一种物料调度算法作为对照方案。最后,通过仿真实验与分析,证明了所设计模型及智能物流调度算法的高效性及适用性,给予车间管理人员相应的管理启示。     

基于工序集的多阶段混合流水车间调度问题研究北大核心

针对砂型铸造车间包含并行工序集与批处理集的多阶段调度问题,总结了该类问题的特点和难点,构建了以最小化最大完工时间为优化目标的多阶段混合流水车间调度模型,采用了一种改进人工蜂群算法求解该模型。在算法中提出了基于插入原理与前驱工序释放时间的分段解码方法来有效利用机器空闲时间段,并引入了动态触发邻域机制增强算法的局部搜索能力,最后通过仿真实验验证了本文算法,解决此类问题的可行性和有效性。     

随机批量运输的柔性作业车间AGV配置优化

针对柔性作业车间中物料搬运系统的AGV数量配置问题,以最小化AGV购置成本为目标,建立具有系统产出率和生产周期双重约束的优化模型。由于该优化问题是一个随机非线性的整数规划问题,且约束条件无法用决策变量的封闭形式表示,为此,提出一种基于仿真的粒子群优化算法求解该问题。针对具有随机批量运输特征的柔性作业车间,基于离散事件仿真平台构建系统的性能估算模型,提出一种嵌入仿真模型的粒子群优化算法求解AGV数量配置的优化方案。通过仿真算例实验以及不同优化方法对比,对比结果显示,该方法较其他算法在优化结果的优越性和稳定性上分别平均提高了8%和8.9%。分析实际应用案例确定了优化的配置方案,结果验证了所提方法的有效性,具有实际应用价值。     

基于工序集的多阶段混合流水车间调度问题研究

针对砂型铸造车间包含并行工序集与批处理集的多阶段调度问题,总结了该类问题的特点和难点,构建了以最小化最大完工时间为优化目标的多阶段混合流水车间调度模型,采用了一种改进人工蜂群算法求解该模型。在算法中提出了基于插入原理与前驱工序释放时间的分段解码方法来有效利用机器空闲时间段,并引入了动态触发邻域机制增强算法的局部搜索能力,最后通过仿真实验验证了本文算法,解决此类问题的可行性和有效性。     

基于绿色生产的混合流水车间调度问题研究

针对绿色可持续发展问题,通过量化绿色指标评价方法,构建最小化最大完工时间、碳排放和噪声的多目标混合流水车间调度模型,并提出一种混合离散多目标帝国竞争算法(hybrid discrete multi-objective imperial competition algorithm,HDMICA)对模型进行求解。采用基于混沌反向学习策略的种群初始化方式提高初始化种群的多样性;基于本文模型设计3种有效的局部搜索策略以提升算法局部搜索能力;通过实验验证所提算法的有效性及优越性。     

基于深度强化学习的柔性作业车间节能调度研究

针对当前柔性作业车间节能调度研究无法充分利用历史生产数据,且对复杂、动态、多变的车间生产环境适应性不足的问题,引入深度强化学习思想,利用具有代表性的深度Q网络（deep Q-network, DQN）求解柔性作业车间节能调度问题。将柔性作业车间节能调度问题转化为强化学习对应的马尔科夫决策过程。进而,提炼表征车间生产状态特征的状态值作为神经网络输入,通过神经网络拟合状态值函数,输出复合调度动作规则实现对工件以及加工机器的选择,并利用动作规则与奖励函数协同优化能耗。在3个不同规模的案例上与非支配排序遗传算法、超启发式遗传算法、改进狼群算法等典型智能优化方法进行求解效果对比。结果表明,DQN算法有较强的搜索能力,且最优解分布情况与提出的柔性作业车间节能调度模型聚焦能耗目标相一致,从而验证了所用DQN方法的有效性。     

面向批量订单包装的物流箱规格优化问题研究

目的 针对面向仓储物流环境下多型号多批量产品的订单包装问题,提出一种预制物流箱规格优化模型及算法。方法 对产品订单建立订单分包规则,确定分包方案,以订单包装材料总成本最小为优化目标建立物流箱规格优化模型。针对该模型提出一种改进模拟退火算法,通过贪婪策略求解最优分包方案,降低模型计算复杂度,设计一种新型解更新算子,以提高算法寻优能力,设计一种自适应步长策略,以平衡算法前期全局搜索与后期局部搜索的能力。结果 通过实例证明,文中提出的算法相较于其他算法,具有更强的求解能力,与实例企业仓储包装现状相比,同批订单降低了17%的包装材料成本。结论 该方法可用于解决产品种类多、尺寸差异大、动态更新等应用场景下的系列运输包装纸箱规格优化问题,为企业物流运输管理提供了一种有效的包装优化思路和解决方法。     

Location Selection and Scheduling Optimization of Material Storage in Manufacturing Workshop

Based on improved immune algorithm, the location of material storage in manufacturing workshop is studied. Intelligent optimization algorithms include particle swarm optimization algorithm, genetic selection algorithm, simulated annealing algorithm, tabu search algorithm and so on. According to the non-linear constraints, the objective function is established to solve the minimum energy consumption of material distribution. The improved immune algorithm can solve the complex problem of manufacturing workshop, and the material storage location and scheduling scheme can be obtained by combining simulation software. Scheduling optimization involves material warehousing, sorting, loading and unloading, handling and so on. Using the one-to-one accurate distribution principle and MATLAB software to simulate and analyze, the location of material warehousing in manufacturing workshop is determined, and the material distribution and scheduling are studied.     

A hybrid Tabu sample-sort simulated annealing approach for solving distributed scheduling problem

The distributed scheduling problem has been considered as the allocation of a task to various machines in such a way that these machines are situated in different factories and these factories are geographically distributed. Therefore distributed scheduling has fulfilled various objectives, such as allocation of task to the factories and machines in such a manner that it can utilise the maximum resources. The objective of this paper is to minimise the makespan in each factory by considering the transportation time between the factories. In this paper, to address such a problem of scheduling in distributed manufacturing environment, a novel algorithm has been developed. The proposed algorithm gleans the ideas both from Tabu search and sample sort simulated annealing. A new algorithm known as hybrid Tabu sample-sort simulated annealing (HTSSA) has been developed and it has been tested on the numerical example. To reveal the supremacy of the proposed algorithm over simple SSA and Tabu search, more computational experiments have also been performed on 10 randomly generated datasets.     

An extended continuous estimation of distribution algorithm for solving the permutation flow-shop scheduling problem

This article proposes an extended continuous estimation of distribution algorithm (ECEDA) to solve the permutation flow-shop scheduling problem (PFSP). In ECEDA, to make a continuous estimation of distribution algorithm (EDA) suitable for the PFSP, the largest order value rule is applied to convert continuous vectors to discrete job permutations. A probabilistic model based on a mixed Gaussian and Cauchy distribution is built to maintain the exploration ability of the EDA. Two effective local search methods, i.e. revolver-based variable neighbourhood search and Hénon chaotic-based local search, are designed and incorporated into the EDA to enhance the local exploitation. The parameters of the proposed ECEDA are calibrated by means of a design of experiments approach. Simulation results and comparisons based on some benchmark instances show the efficiency of the proposed algorithm for solving the PFSP.     

改进多种群遗传算法的AutoStore系统多AGV调度优化

新兴紧致密集型仓储系统AutoStore存在出、入库单独作业及联合作业并存的情况,使用传统单一作业模式下所得AGV调度方案易导致资源浪费或效率低等问题。在分析多作业模式工作流程基础上,建立多AGV任务分配模型,优化目标为系统总作业时间最短。对传统多种群遗传算法进行改进。首先,为获得具有多样性的初始解,给出适用于实数编码的初始解判断式;其次,为提高搜索效率,给出交叉、变异概率计算式,使得遗传操作能随着进化过程和适应度值变化而不同。算例分析验证所给算法的可行性与有效性,能为系统提供更优的AGV调度方案。     

A hybrid differential evolution algorithm for a two-stage flow shop on batch processing machines with arbitrary release times and blocking

Batch processing machines (BPMs) have important applications in a variety of industrial systems. This paper considers the problem of scheduling two BPMs in a flow shop with arbitrary release times and blocking such that the makespan is minimised. The problem is formulated as a mixed integer programming model. Subsequently, a hybrid discrete differential evolution (HDDE) algorithm is proposed. In the algorithm, individuals in the population are first represented as discrete job sequences, and mutation and crossover operators are applied based on the representation. Second, after using the first-fit rule to form batches, a novel least idle/blocking time heuristic is developed to schedule the batches in the flow shop. Furthermore, an effective local search technique is embedded in the algorithm to enhance the exploitation ability. The performance of the proposed algorithm is evaluated by comparing its results to a commercial solver (CPLEX), a genetic algorithm and a simulated annealing algorithm. Computational experiments demonstrate the superiority of the HDDE algorithm in terms of solution quality, robustness and run time.     

A multi-objective optimisation model to integrating flexible process planning and scheduling based on hybrid multi-objective simulated annealing

Process planning and production scheduling play important roles in manufacturing systems. In this paper we present a mixed integer linear programming (MILP) scheduling model, that is to say a slot-based multi-objective multi-product, that readily accounts for sequence-dependent preparation times (transition and set up times or machine changeover time). The proposed scheduling model becomes computationally expensive to solve for long time horizons. The aim is to find a set of high-quality trade-off solutions. This is a combinatorial optimisation problem with substantially large solution space, suggesting that it is highly difficult to find the best solutions with the exact search method. To account for this, the hybrid multi-objective simulated annealing algorithm (MOHSA) is proposed by fully utilising the capability of the exploration search and fast convergence. Two numerical experiments have been performed to demonstrate the effectiveness and robustness of the proposed algorithm.     

面向印制电路板钻孔任务动态调度的短视策略

印制电路板钻孔任务因随机到达和工艺要求而难以调度。考虑该问题的NP难性质,提出基于优先规则和智能算法的短视策略。该策略采用事件驱动的再调度机制,在任务到达和任务完工时触发优化算法对当前未开工任务进行决策。为了高效求解每个决策时刻的优化问题,构建了嵌入局部优势定理的模拟退火和变邻域搜索算法,其初始解由优先规则获得。通过计算实验,在不同调度环境下对比两种智能算法与经典优先规则的表现。实验结果表明,智能算法在多数目标下的优化效果较优先规则可提升20%以上,变邻域搜索的优化效果略好于模拟退火,但是模拟退火的计算效率高一倍。     

考虑有限物流运输能力的智能车间AGV调度算法研究

以大批量生产模式智能车间为背景,针对单环布局下多自动导航小车 （AGV） 的调度问题进行研究。首先,对典型智能车间特点进行了分析,利用Plant Simulation仿真平台建立了基于实际生产场景的仿真模型;其次,提出了基于软时间窗的AGV调度规则和基于备选调度规则集的6个运行机制;最后,通过设计仿真实验对上述7个调度规则进行了分析和比较。实验结果表明,基于软时间窗AGV调度方法总体上表现更好。这为企业配置和调度AGV小车提供了决策支持。