An improved multi-objective optimization algorithm for solving flexible job shop scheduling problem with variable batches

In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.

Genetic algorithm for short-term scheduling of make-and-pack batch production process

This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy all constraints while meeting demand requirement of packed products from various product families. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore,we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromosomes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to determine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for comparison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, all heuristics show the capability to solve large instances within reasonable computational time. In all problem instances, genetic algorithm averagely outperforms ant colony optimization and Tabu search with slightly longer computational time.

A Note on DP Algorithm for Batching Scheduling to Minimize Maximum Lateness

In parallel-batching machine scheduling, all jobs in a batch start and complete at the same time, and the processing time of the batch is the maximum processing time of any job in it. For the unbounded parallel-batching machine scheduling problem of minimizing the maximum lateness, denoted 1|p-batch|L_(max), a dynamic programming algorithm with time complexity O(n^2) is well known in the literature.Later, this algorithm is improved to be an O(n log n) algorithm. In this note, we present another O(n log n) algorithm with simplifications on data structure and implementation details.

Strategies for Optimizing Feed Rate of Fed-Batch Yeast Fermentation by Fuzzy-Neural Network

In this paper,a novel fuzzy neural network model,in which an adjustable fuzzy sub-space was designed by uniform design,has been established and used in fed-batch yeast fermentationas an example.A brand-new optimization sub-network with special structure has been built andgenetic algorithm,guaranteeing the optimization in overall space,is introduced for the feed rateoptimization.On the basis of the model network,the optimal substrate concentration and theoptimal amount of fed-batch at different periods have been studied,aided with the optimizationnetwork and the genetic algorithm separately.The above results can be used as a basis for theestablishment of a fuzzy neural network controller.

WSN中基于Mini Batch K-Means与SVM的入侵检测方案

无线传感器网络通常部署在复杂的户外环境,易遭受各种攻击。多数入侵检测系统均采用数据挖掘算法对网络数据包进行分析,但在处理大样本集时,其效率明显降低。针对这一缺点,提出一种基于Mini Batch K-Means和SVM的入侵检测方案。该方案首先分别对正常行为特征库和异常行为特征库进行Mini Batch K-Means聚类,取得类中心作为各类的代表样本并赋予权值,将其传入SVM分类器作为训练数据,得到分类超平面,通过该超平面对待测样本作出判断。解决了如K-Means、KNN、SVM等传统数据挖掘算法在大数据样本集数据分析中面临的低效问题。仿真结果表明,该方案能快速准确地判断样本类别,其检测率达到98.7%。与K-Means、KNN和SVM相比,不仅达到了同样高的检测率,而且明显提高了入侵检测的时间效率。

Micro-expression recognition algorithm based on the combination of spatial and temporal domains

Aiming at the problem of unsatisfactory effects of traditional micro-expression recognition algorithms,an efficient micro-expression recognition algorithm is proposed,which uses convolutional neural networks(CNN)to extract spatial features of micro-expressions,and long short-term memory network(LSTM)to extract time domain features.CNN and LSTM are combined as the basis of micro-expression recognition.In many CNN structures,the visual geometry group(VGG)using a small convolution kernel is finally selected as the pre-network through comparison.Due to the difficulty of deep learning training and over-fitting,the dropout method and batch normalization method are used to solve the problem in the VGG network.Two data sets CASME and CASME II are used for test comparison,in order to solve the problem of insufficient data sets,randomly determine the starting frame,and a fixedlength frame sequence is used as the standard,and repeatedly read all sample frames of the entire data set to achieve trayersal and data amplification.Finallv.a hieh recognition rate of 67.48% is achieved.

基于MOMA的可重入混合流水车间调度问题研究

针对可重入制造系统多具有多品种、大规模、混流生产等特点,构建带批处理机的可重入混合流水车间调度问题(reentrant hybrid flow shop scheduling problem with batch processors,BPRHFSP)模型,提出一种改进的多目标蜉蝣算法(multi-objective mayfly algorithm,MOMA)进行求解。提出了单件加工阶段和批处理阶段的解码规则;设计了基于Logistic混沌映射的反向学习初始化策略、改进的蜉蝣交配和变异策略,提高了算法初始解的质量和局部搜索能力;根据编码规则设计了基于变邻域下降搜索的蜉蝣运动策略,优化了种群方向。通过对不同规模大量测试算例的仿真实验,验证了MOMA相比传统算法求解BP-RHFSP更具有效性和优越性。所提出的模型能够反映生产的基础特征,达到减少最大完工时间、机器负载和碳排放的目的。

An improved micro-expression recognition algorithm of 3D convolutional neural network

The micro-expression lasts for a very short time and the intensity is very subtle.Aiming at the problem of its low recognition rate,this paper proposes a new micro-expression recognition algorithm based on a three-dimensional convolutional neural network(3D-CNN),which can extract two-di-mensional features in spatial domain and one-dimensional features in time domain,simultaneously.The network structure design is based on the deep learning framework Keras,and the discarding method and batch normalization(BN)algorithm are effectively combined with three-dimensional vis-ual geometry group block(3D-VGG-Block)to reduce the risk of overfitting while improving training speed.Aiming at the problem of the lack of samples in the data set,two methods of image flipping and small amplitude flipping are used for data amplification.Finally,the recognition rate on the data set is as high as 69.11%.Compared with the current international average micro-expression recog-nition rate of about 67%,the proposed algorithm has obvious advantages in recognition rate.

基于最优觅食算法的增材制造中多种类零件分批排样研究

增材制造中多种类零件分批排样存在打印时间成本高和工作台空间利用率低等问题,且需考虑零件高度的影响。分批排样问题包括零件在工作台上放置策略和成型批次分配两个子问题。放置策略涉及成型方向选择、零件碰撞检测和定位策略。基于建立的成型方向准则,利用多边形表示零件投影轮廓,提出基于临界多边形的改进移动碰撞法以确定3种不同形态多边形零件的免碰撞排放范围,提出新的左下定位策略放置零件,新定位策略融合了改进的建设性方法和契合度;提出单机台面积占用最大化策略实现零件成型批次分配。基于上述研究,提出基于最优觅食算法的分批排样算法,算法采用双重编码表达零件放置顺序和旋转角度,以最小化完工时间为目标实现优化分批排样。以案例库零件为对象,与3种对比算法比较,表明所提方法的方案能有效提高增材制造的空间利用率和缩短完工时间。

基于国密SM2算法的车联网无证书隐私保护认证协议

作为大多数智能交通系统的基础,车载自组网(Vehicular Ad-Hoc Network,VANET)能够有效改善交通管理和提升道路安全性,因此受到广泛关注。然而,由于无线通信环境的开放性,VANET中的各个节点易遭受隐私泄露攻击。许多条件隐私保护认证(Conditional Privacy-Preserving Authentication,CPPA)协议被提出来解决隐私泄露问题,但这些协议主要基于传统的签名算法,这使得它们存在复杂的证书管理或密钥托管问题。为解决以上问题,本文以国密SM2签名算法为基础提出了一种适合VANET环境中无证书条件隐私保护认证协议,该协议在降低了通信开销的同时也避免了证书管理和密钥托管问题。此外,协议还保证了当出现恶意车辆用户时,可信中心可以追踪用户的真实身份并撤销该用户。安全证明和分析表明该协议具有较高的安全性并且满足消息完整性、匿名性、可追踪性和可撤销性等安全要求。最后,与最近的三种同类隐私协议对比,仿真实验结果表明该协议在通信量和计算量上优于其他方案。

批式流加发酵中的鲁棒脉冲时滞最优控制

本文研究了批式流加发酵中的鲁棒脉冲时滞最优控制问题。首先,提出一个非线性状态依赖的脉冲时滞系统描述批式流加发酵甘油生产1,3-丙二醇(1,3-PD)过程。由于批式流加发酵过程中的动力学参数难以准确估计,本文建立了一个具有连续状态不等式约束的鲁棒脉冲时滞最优控制模型。这里,目标函数为终端时刻1,3-PD浓度及其关于动力学参数的灵敏性的加权和,控制向量为流加发生时甘油的临界浓度及每次流加时甘油的流加体积。然后,通过引入辅助脉冲系统,将该鲁棒最优控制问题转化为等价的标准最优控制问题。进一步,通过约束转换技术,将等价的最优控制问题转化为仅具有盒式约束的罚问题。最后,设计了一种并行差分进化算法求解转化后的罚问题。数值结果表明:当参数受到微小扰动时,尽管牺牲了少量的1,3-PD浓度,但是明显提高了系统的鲁棒性。

基于改进遗传算法的混合流水车间批量调度问题求解

针对多品种小批量混流生产模式中生产计划调度复杂的特点,提出解决批量问题的等量分批策略,实现工件在不同工序上同时加工,缩减机器等待时间;以最大完工时间为优化目标,建立混合流水车间批量调度问题数学模型;设计求解模型的改进遗传算法,使用NEH启发式算法和随机生成结合的方式生成优质初始解,采用二元锦标赛进行选择操作,采用二元交叉法进行交叉操作,采用插入变异生成新个体,并使用贪婪插入的领域搜索算法进行局部搜索,解码时采用“子批优先+先空闲先加工”策略。发动机连杆生产案例应用结果表明,混合流水车间批量调度问题模型与改进的遗传算法正确有效。

双区型仓库订单分批与拣选协同优化研究

针对订单分拣效率低下导致商品出库缓慢的问题,提出一种基于双区型仓库订单分批与拣选的协同优化模型,设计求解模型的CWDP-BSA(clarke-wright and dynamic programming&backtracking search algorithm)协同优化算法。在节约算法中引入快速排序法对订单组合的距离节约值排序,考虑AGV承载量,运用多阶段决策过程最优策略得出状态转移方程求解订单分批模型,确定初始分批方案;并采取多因子选择的回溯搜索算法求解拣选路径模型,以此确定初始拣选方案。再以以上两方案为基础,建立新的基于订单时间窗的订单分批和拣选协同优化模型并求解,进一步优化订单分批和拣选方案。最后通过对比实验得出,平均每批次订单的拣选距离减少了约24.56%,优化后的拣选时间比优化前缩短了约11.4%,在求解不同规模算例时,CWDP-BSA算法的求解结果优于CPLEX软件和其他算法,验证了模型与算法的稳定性和有效性。实验表明,协同优化后的订单分批与物品拣选策略能够有效提升订单出库效率。

带有动态到达工件的分布式柔性作业车间调度问题研究

分布式柔性作业车间调度是生产调度的1个重要分支,工件的动态到达作为实际生产中的1种常见扰动情况,进一步增加了作业车间调度问题的复杂性和不确定性。针对带有工件动态到达的分布式柔性作业车间调度问题(DA-DFJSP),提出1种分批调度策略,将原本的动态调度问题转化成一系列连续调度区间上的静态调度问题,构建以最大完工时间为优化目标的混合整数规划模型;在此基础上,结合问题特征采用批次、工厂、工序、机器的4层染色体编码及快速贪婪搜索插入的解码方式改进遗传算法,同时引入多种交叉、变异算子来增强染色体的多样性;最后,基于FJSP标准算例构建DA-DFJSP测试算例进行仿真对比实验,验证所提策略和改进算法的求解优势。结果表明:相较于传统的重调度策略和改进前的遗传算法,采用分批调度策略和改进的遗传算法(IGA)所求调度方案具有更短的完工周期、更均匀的工厂加工负荷及更高的设备工作效率,IGA与分批调度策略之间有高度的契合性,能够有效提升生产效率。

基于人工鱼群-遗传算法的多品种小批量零件数控加工工艺优化研究

基于多品种小批量零件加工成本高的问题,基于人工鱼群-遗传算法(AFSA-GA)构建了数控机床能耗模型,以实现零件加工能耗下降。首先,将数控机床功率划分为各工序功率模型,基于功率模型与工作时间关系得出机床运转能耗模型,结合产品表面粗糙度模型,对各工序能耗模型及整体粗糙度进行归一化处理,形成整体能耗模型;其次,以能耗及粗糙度为目标函数,建立AFSA-GA算法,通过对各工序能耗求解得出最适当的机床功率及其所对应的能耗和表面粗糙度;最后,针对所获得的最优功率,进行优化结果的验证,为五轴机床的实际加工提供解决方案。

一种高效轻量的双参数椭圆曲线数字签名批量验证方案

为解决大规模交易任务的签名验证给区块链节点带来繁琐的开销和经典的椭圆曲线数字签名算法(ECDSA)中耗时的模逆运算,提出一种高效轻量的双参数椭圆曲线数字签名(TP-ECDSA)批量验证方案。一方面,TP-ECDSA在签名和验证阶段均无模逆运算,在该算法中引入批量验证能将标量乘的计算次数从2t减少到[2,t+1]。另一方面,KGLP算法能加速标量乘运算,引入该算法能显著地提升签名验证的效率。实验表明,与ECDSA相比,不论是独立验证还是批量验证,TP-ECDSA的运行速度均提高了50%以上,签名验证效率显著提升。

Optimized air-ground data fusion method for mine slope modeling

Refined 3D modeling of mine slopes is pivotal for precise prediction of geological hazards.Aiming at the inadequacy of existing single modeling methods in comprehensively representing the overall and localized characteristics of mining slopes,this study introduces a new method that fuses model data from Unmanned aerial vehicles(UAV)tilt photogrammetry and 3D laser scanning through a data alignment algorithm based on control points.First,the mini batch K-Medoids algorithm is utilized to cluster the point cloud data from ground 3D laser scanning.Then,the elbow rule is applied to determine the optimal cluster number(K0),and the feature points are extracted.Next,the nearest neighbor point algorithm is employed to match the feature points obtained from UAV tilt photogrammetry,and the internal point coordinates are adjusted through the distanceweighted average to construct a 3D model.Finally,by integrating an engineering case study,the K0 value is determined to be 8,with a matching accuracy between the two model datasets ranging from 0.0669 to 1.0373 mm.Therefore,compared with the modeling method utilizing K-medoids clustering algorithm,the new modeling method significantly enhances the computational efficiency,the accuracy of selecting the optimal number of feature points in 3D laser scanning,and the precision of the 3D model derived from UAV tilt photogrammetry.This method provides a research foundation for constructing mine slope model.

基于嵌套蚁群算法的机器人拣货作业联合优化

针对物流仓储中心拣货作业过程中系统订单分批和拣货路径分步拣选效率低的问题,提出一种基于嵌套蚁群的订单分批和路径优化的联合拣货策略。首先,建立以最小化总路径为目标的订单分批与拣货路径联合优化模型;然后,考虑双重优化的复杂性,设计一种嵌套蚁群算法对模型进行求解,以订单分批模型为基准不断优化订单分批结果,得出最优分批集合单,其优化集合单再嵌套蚁群算法实现拣货路径优化。为验证该算法对随机订单有效性,抽取某一天17:00-18:00时段内既有货架区货物又有地堆区货物的43个订单算例进行仿真实验,与传统订单分批和拣货路径分步拣选策略相比,基于嵌套蚁群算法的拣货作业联合优化模型的随机订单拣货路径更短、拣货时间更少,经过联合优化后,机器人总拣选距离缩短了170 m。基于嵌套蚁群算法的拣货作业联合优化模型和其求解算法可以有效解决订单分批与拣货路径联合优化问题,为配送中心拣选系统的优化提供依据。

考虑拆分策略的智能仓库订单分拣建模与优化

针对一种两类订单混合分拣的自动小车分拣问题,考虑其在订单分拣过程中出现的分拣AGV(automatic guided vehicle)堵塞和人工收集站闲置的现象,提出一种订单拆分的策略及拆分后子订单批次调整的方法,并以总订单完工时间最小化为优化目标,建立了订单拆分的订单分拣整数规划模型;提出一种改进离散灰狼优化算法,将订单分批、批次排序以及下架库位选取3个子问题进行联合优化。数值实验结果表明,订单拆分策略使总订单完工时间显著减少,并且通过与经典算法以及其他同类型算法的对比,验证了所提算法的优越性。

考虑货物冲突的订单分批与装箱联合调度问题

为提升线上线下(O2O)超市订单出库效率,保障食品安全性和新鲜度,本文研究考虑货物冲突的订单分批与装箱联合调度问题。以订单拣选和装箱总成本最小为目标,构建混合整数规划模型,采用改进模拟退火算法(Simulated Annealing,SA)求解,改进部分包括:改进种子算法的初始解生成方案、改进二维装箱算法和SA的升温机制。本文采用仿真实验验证模型和算法的有效性,结果表明:在不同场景对比下,改进SA与其他算法相比能更有效降低总成本;本文提出的改进装箱算法比传统装箱算法的装箱成本更低,更具备操作友好性;将订单分批和装箱进行联合调度,可提前规避互为货物冲突的商品被分配至同一批次,进而节省额外装箱成本。本文拓展了订单拣选和装箱联合问题的研究领域,考虑商品的货物冲突,为管理者提供一个既节省总成本又提高食品安全性的有效方案。