分布式棒线材轧制生产线在线生产调度系统

在分析棒线材生产作业计划特点的基础上，建立了精轧工序轧制批量调度的数学模型，其中考虑了轧机的维护约束等实际应用约束，采用混合局部搜索的自适应遗传算法进行求解，给出了基于多智能体系统（MAS）的分布式在线生产调度系统的总体结构，描述了进化计算、专家系统、启发式规则和人机交互相结合的集成化实现方法．实际运行结果表明，该系统各项功能运行良好，可快速编制出接近最优的生产调度计划，调度质量得到很大地改进．     

基于离散教与学算法的分布式预制流水车间调度研究

分布式工厂生产形式对提高预制构件生产效率、保证订单按时交付、降低企业拖期交货惩罚费用具有重要的意义;因此针对分布式预制构件流水车间调度问题,以最小化订单总拖期惩罚为目标建立了数学优化模型,并基于双层整数编码方式提出了一种离散教与学算法(DTLBO);在算法初始化阶段,采用启发式规则和随机生成融合策略改善初始解的质量,进而增加算法的寻优效率;在教学阶段,结合问题模型特点,设计了顶层替换、底层替换两种邻域构造,促进教师解对学生解的引导优化;在学习阶段,通过变异算子和交叉算子让学生解之间相互学习更新,进一步提升算法的局部开发和全局探索能力;试验结果表明,与遗传算法和变邻域搜索算法对比,提出的DTLBO算法具有更好的求解性能和鲁棒性;最后与实际生产过程常用的经验启发式调度方法相比,提出算法在目标值上表现出不低于10％的平均改进率,有望显著增加预制构件制造企业净利润并提高客户满意度,能够为企业管理者提供更佳、更合理的生产调度方案.     

Optimisation of partner selection and collaborative transportation scheduling in Virtual Enterprises using GA

Partner selection and transportation scheduling are critical to the success of a Virtual Enterprise. Collaborative transportation is a promising strategy that can help many enterprises survive and thrive in today’s highly competitive market. To help decision makers establish and operate Virtual Enterprises more effectively, an innovative decision support system is proposed in this paper. First, new model for integration of partner selection and collaborative transportation scheduling in Virtual Enterprises is developed. This integrated optimisation problem is very dynamic in nature and it is required to optimise a number of interlinked sub-problems at the same time. Then, a novel Genetic Algorithm with a unique dynamic chromosome representation and genetic operations is developed to find an optimal solution to the integrated problem. The effectiveness of the proposed approach is demonstrated in a representative case study.     

基于遗传算法的网格任务调度方法分析

网格任务调度为多项式复杂程度的非确定性问题,其中所有非确定性多项式时间可解的判定问题,共同构成了NP类问题。如何快速地找到全局最优解是网格任务调度的难点所在。而遗传算法在验证猜测的正确性方面,具有自动获取和快速搜索的特性,是解决非线性问题的最优方案。本文主要对基于遗传算法的网格任务调度方法进行分析,通过网格任务调度模型构建、资源分配等操作,来完成遗传算法的仿真实验研究。     

软计算求解分布式多工厂单件制造业的提前/拖期生产计划问题

描述了分布式多工厂单件制造企业准时化生产计划问题, 以实现最小化提前/拖期惩罚费用、生产成本、产品运输费用之和为目标建立了0-1规划数学模型; 设计了基于模糊规则量化的方法求解模糊决策, 并将模糊决策嵌入到遗传算法中的软计算方法求解模型, 使得算法具有比分枝定界法更快速的寻找优解的能力以及更广泛的适应范围. 结果表明了该模型和算法的有效性和应用潜力.     

软计算求解分布式多工厂多顾客的供应链准时化生产计划问题

描述了分布式多工厂、多顾客的供应链准时化生产计划问题,以实现最小化提前／拖期惩罚费用、生产成本、产品运输费用之和为目标建立了数学模型,将遗传算法与模糊逻辑相结合,设计了软计算方法求解模型,采用基于规则方法的模糊规则量化方法求解模糊决策,并将模糊决策嵌入遗传算法,使得算法具有比分枝定界法更快的寻优能力和更广的适应范围。实例计算结果表明了该模型和算法的有效性和应用潜力。     

基于窗口的印刷车间作业动态调度研究

为了解决实际印刷车间突发设备故障和紧急插单问题,采用滚动窗口技术结合遗传算法的方法,建立适合实际印刷车间生产的动态再调度模型;设定若干印品订单、机器设备的加工工序以及各工序加工时间、工序约束条件等,以订单的最大最小加工时间和再调度的偏离度为多目标优化,采用周期与事件混合驱动策略,将滚动窗口再调度机制和遗传算法相结合进行流程设计和编码,构建印刷车间再调度模型;采用标准问题FT06和FT01验证了文章设计的模型算法的有效性和可行性;运行程序,模拟正常加工时紧急插单和机器故障突发时,系统生产新的调度计划即调度甘特图,仿真结果表明该动态调度模型可以用于印刷作业的正常排产调度,在遇突发状况时可生成稳定、符合交货日期的再调度方案。     

铁路应急资源动态多阶段调度决策模型及算法研究

近年来,铁路突发事件时有发生,严重影响铁路的正常运营,合理地进行应急资源的调度是提高铁路整体应急救援能力,减少突发事件所造成损失的有效途径。以博弈论为理论基础,将各应急点看作博弈局中人,考虑救援点到应急点的运力限制以及不同资源在不同应急点的重要度等因素,构建了资源动态需求函数,并用应急点对资源缺少量的时间累积来刻画系统损失。将多应急点的资源调度描述为一个多阶段非合作博弈过程,以系统总损失最小为目标,建立多应急点-多救援点-多种资源的动态多阶段资源调度模型,并设计了求解该模型Nash均衡的改进布谷鸟算法,从而得到最优的铁路应急资源调度方案。通过具体算例验证了模型的可行性与算法的优越性。结果表明该模型较为切近实际、适用性较强且改进后的算法更具高效性,可为铁路应急资源调度决策提供依据和支持。     

Dynamic rolling strategy for multi-vessel quay crane scheduling

This paper focuses on the container loading and unloading problem with dynamic ship arrival times. Using a determined berth plan, in combination with the reality of a container terminal production scheduling environment, this paper proposes a scheduling method for quay cranes that can be used for multiple vessels in a container terminal, based on a dynamic rolling-horizon strategy. The goal of this method is to minimize the operation time of all ships at port and obtain operation equilibrium of quay cranes by establishing a mathematical model and using a genetic algorithm to solve the model. Numerical simulations are applied to calculate the optimal loading and unloading order and the completion time of container tasks on a ship. By comparing this result with the traditional method of quay crane loading and unloading, the paper verifies that the quay crane scheduling method for multiple vessels based on a dynamic rolling-horizon strategy can provide a positive contribution to improve the efficiency of container terminal quay crane loading and unloading and reduce resource wastage.     

基于MAS的动态生产调度与控制及系统开发

提出基于MAS的面向敏捷制造的生产过程动态调度与控制的层次结构．1）以任务分解与分配层为中心，建立各层之间的协调工作及协同决策机制；2）引入协商式招／投标方法实现任务的分解与分配；3）采用能力匹配与动态调度相结合的方法实现任务分配与调度控制的有效集成；4）面向生产任务需求动态确定Agent粒度、组建MAS模型；5）适应制造系统状态变化的需要，进行任务的动态重构．讨论基于MAS的采用分级递阶和并行处理相结合的自治组织结构和运作模式，以及利用与组织结构相对应的层次黑板结构实现各Agent之间信息与数据共享．在支持生产过程动态调度与控制基础设施建设的基础上，结合奏川机床集团有限公司车间生产实际，研究开发了基于MAS的车间动态调度系统．     

数据驱动下的半导体生产线动态调度方法

本文研究了一种数据驱动下的半导体生产线调度框架,该框架基于调度优化数据样本,应用机器学习算法,获得动态调度模型,通过该模型,对于半导体生产线,能够根据其当前的生产状态,实时地定出近似最优的调度策略.在此基础上,利用特征选择和分类算法,提出一种生成动态调度模型的方法,并且具体实现出一种混合式特征选择和分类算法的调度模型:先采用过滤式特征选择方法对生产属性进行初步筛选,然后再采用封装式特征选择和分类方法生成模型以提高模型生成的效率.最后,在某实际半导体生产线上,对在所提出的框架上采用6种不同算法实现的动态调度模型进行测试,并对算法性能数据和生产线性能据进行对比和分析.结果表明,数据驱动下的动态调度方法优于单一的调度规则,同时也能满足生产线调度实时性要求.在数据样本较多的情况下,建议采用本文所提出的方法.     

基于改进遗传算法的标签印刷生产调度技术

针对标签印刷生产过程中存在的多品种、小批量、客户定制化程度高、部分生产工序存在不确定性等问题建立了以最小化最大完工时间为目标的柔性作业车间调度模型,提出了一种改进遗传算法（GA）。首先,在标准遗传算法的基础上采用整数编码;然后,在选择操作阶段采用轮盘赌法,并通过引入精英解保留策略以确保算法收敛性;最后,提出动态自适应交叉和变异概率,从而保证算法在前期进行较大范围寻优,以避免早熟,而后期尽快收敛,以保证前期获得的优良个体不被破坏。为了验证所提改进遗传算法的可行性,首先采用Ft06基准算例把所提算法与标准遗传算法（GA）进行比较,结果显示改进遗传算法的最优解（55 s）优于标准遗传算法的最优解（56 s）,且改进遗传算法的迭代次数明显优于标准遗传算法;然后通过柔性作业车间调度问题（FJSP）的8×8、10×10和15×10标准算例进一步验证了算法的稳定性和寻优性能,在3个标准测试算例上改进遗传算法均在较短时间内取得了最优解;最后,将该算法用于求解标签印刷车间的排产问题时,使得加工效率比原来提高了50.3%。因此,提出的改进遗传算法可以有效应用于求解标签印刷车间的排产问题。     

最优子种群遗传算法求解柔性流水车间调度问题

为了验证最优子种群遗传算法在解决柔性流水车间调度问题时相比于传统遗传算法的优越性,分析了柔性流水车间调度问题的特点,并运用一种新的编码方法和新的遗传算法求解了该问题。考虑到最优个体保护策略法对复杂问题容易使种群收敛陷入局部最优解,为了提高精度、加快较优个体的产生并避免陷入局部最优解,首先提出了一种合理、全面的编码方法,并运用最优子种群遗传算法来求解柔性流水车间调度问题。最后运用实例验证了最优子种群遗传算法的有效性、优越性和编码方式的合理性。     

The two-echelon multi-trip vehicle routing problem with dynamic satellites for crop harvesting and transportation

The harvesting and transportation system involves a harvest scheduling and a transportation plan. The grain, harvested by combine-harvesters, is then transported by transporters from disperse farmlands to the depot. The spot where combine-harvesters transfer wheat to transporters is dynamic because the location of these spots correspond with combine-harvesters’ work. In this paper, the harvesting and transportation problem is considered as a two-echelon multi-trip vehicle routing problem with a dynamic satellite (2E-MTVRPDS) because the combine-harvester is used multiple times in the planning horizon and the transporter is used multiple times in a work day. The mixed integer linear programming model is proposed based on the features of the problem. This work presents an optimum solution with a heuristic algorithm. The dynamic satellite is transferred as the static case in the heuristic. The computational experiments are constructed to test the performances of the proposed algorithm. Five instances with different sizes are adopted to test the stability of the algorithm. The calculation deviation of testing instances is acceptable. On one hand, the optimal effectiveness can be achieved when the number of instances is less than 200. With the increase in the number of instances, the optimal efficiency declines. On the other hand, the optimal solution appears to have a time window of 0.2 h in all instances with different sizes. This study provides a decision model for agricultural production to implement optimal harvesting operations.     

Modeling and Pareto optimization of multi-objective order scheduling problems in production planning

This paper addresses a multi-objective order scheduling problem in production planning under a complicated production environment with the consideration of multiple plants, multiple production departments and multiple production processes. A Pareto optimization model, combining a NSGA-II-based optimization process with an effective production process simulator, is developed to handle this problem. In the NSGA-II-based optimization process, a novel chromosome representation and modified genetic operators are presented while a heuristic pruning and final selection decision-making process is developed to select the final order scheduling solution from a set of Pareto optimal solutions. The production process simulator is developed to simulate the production process in the complicated production environment. Experiments based on industrial data are conducted to validate the proposed optimization model. Results show that the proposed model can effectively solve the order scheduling problem by generating Pareto optimal solutions which are superior to industrial solutions.     

维修时点预测的动态车间调度问题

针对制造业中生产计划的不确定问题,提出一种维修时点预测与自适应的遗传模拟退火算法相结合的优化调度方法。该方法首先利用差分自回归移动平均模型预测设备未来的故障率,然后借助电气设备的威布尔（Weibull）分布模型逆向求出设备未来故障发生时刻,最后将此作为约束条件,利用自适应的遗传模拟退火算法解决传统的生产调度问题。结合工厂实际情况,主要分析了设备有无维修的随机调度问题,以最小化最大完工时间为目标,获取每一个任务的调度计划以及每一台设备的维修时点,确定出最佳调度方案。实验表明自适应的遗传模拟退火算法的性能较好。在河北某工厂的生产车间中,设备在运行调度方法后三个月的平均故障率比运行前相对降低了3.46%。     

A memetic algorithm for multiple-drug cancer chemotherapy schedule optimization.

This correspondence introduces a multidrug cancer chemotherapy model to simulate the possible response of the tumor cells under drug administration. We formulate the model as an optimal control problem. The algorithm in this correspondence optimizes the multidrug cancer chemotherapy schedule. The objective is to minimize the tumor size under a set of constraints. We combine the adaptive elitist genetic algorithm with a local search algorithm called iterative dynamic programming (IDP) to form a new memetic algorithm (MA-IDP) for solving the problem. MA-IDP has been shown to be very efficient in solving the multidrug scheduling optimization problem.     

An efficient hybrid genetic algorithm to solve assembly line balancing problem with sequence-dependent setup times

In this paper the setup assembly line balancing and scheduling problem (SUALBSP) is considered. Since this problem is NP-hard, a hybrid genetic algorithm (GA) is proposed to solve the problem. This problem involves assigning the tasks to the stations and scheduling them inside each station. A simple permutation is used to determine the sequence of tasks. To determine the assignment of tasks to stations, the algorithm is hybridized using a dynamic programming procedure. Using dynamic programming, at any time a chromosome can be converted to an optimal solution (subject to the chromosome sequence).     

Optimising a production process by a neural network/genetic algorithm approach

An important aspect of production control is the quality of the resulting end product. The end product should have optimal product characteristics and minimal faults. In theory, both objectives can be realised using an optimisation algorithm. However, the complexity of a production process may be very high. In most cases no mathematical function can be found to represent the production process. In this paper a method is presented to simulate a complex production process using a neural network. The subsequent optimisation is done by means of a genetic algorithm. The method is applied to the case study of a spinning (fibre-yarn) production process. The neural network is used to model the process, with the machine settings and fibre quality parameters as input, and the yarn tenacity (yarn strength) and elongation as output. The genetic algorithm is then used to optimise the input parameters for obtaining the best yarns. Since it is a multiobjective optimisation, the genetic algorithm is enforced with a sharing function and a Pareto optimisation. The paper shows that simultaneous optimisation of yarn qualities is easily achieved as a function of the necessary (optimal) input parameters, and that the results are considerably better than current manual machine intervention. The paper concludes by indicating future research towards making an optimal mixture of available fibre qualities.     

基于人机交互的炼钢连铸动态调度*

针对炼钢连铸动态调度问题,建立了问题的优化模型、设计了约束满足求解算法并分析了算法复杂度、开发了炼钢连铸动态调度的人机交互系统。当生产过程中的扰动事件发生时,系统能够通过人机交互并结合优化模型和多项式时间复杂度的算法获得可行且与原调度尽量一致的新调度方案,以确保动态调度前后整个生产过程的连续性和稳定性。