A novel data-driven approach to support decision-making during production scale-up of assembly systems

In today's manufacturing settings, a sudden increase in the customer demand may enforce manufacturers to alter their manufacturing systems either by adding new resources or changing the layout within a restricted time frame. Without an appropriate strategy to handle this transition to higher volume, manufacturers risk losing their market competitiveness. The subjective experience-based ad-hoc procedures existing in the industrial domain are insufficient to support the transition to a higher volume, thereby necessitating a new approach where the scale-up can be realised in a timely, systematic manner. This research study aims to fulfill this gap by proposing a novel Data-Driven Scale-up Model, known as DDSM, that builds upon kinematic and Discrete-Event Simulation (DES) models. These models are further enhanced by historical production data and knowledge representation techniques. The DDSM approach identifies the near-optimal production system configurations that meet the new customer demand using an iterative design process across two distinct levels, namely the workstation and system levels. At the workstation level, a set of potential workstation configurations are identified by utilising the knowledge mapping between product, process, resource and resource attribute domains. Workstation design data of selected configurations are streamlined into a common data model that is accessed at the system level where DES software and a multi-objective Genetic Algorithm (GA) are used to support decision-making activities by identifying potential system configurations that provide optimum scale-up Key Performance Indicators (KPIs). For the optimisation study, two conflicting objectives: scale-up cost and production throughput are considered. The approach is employed in a battery module assembly pilot line that requires structural modifications to meet the surge in the demand of electric vehicle powertrains. The pilot line is located at the Warwick Manufacturing Group, University of Warwick, where the production data is captured to initiate and validate the workstation models. Conclusively, it is ascertained by experts that the approach is found useful to support the selection of suitable system configuration and design with significant savings in time, cost and effort.     

存储系统细粒度加密安全设计

存储系统会有成百上千的存储设备和大量的数据。其中有相当部分敏感数据需要加密存储,然而现有的存储系统只能对整个文件进行加密,而不能对文件某一部分进行加密。尽管其实现方法比较简单,但它会导致系统额外的开销并且极大的影响系统性能。本文提出了存储系统的一种文件细粒度加密方案,它可以充分利用分布式存储内在的特性,有效地利用元数据信息对文件内多个任意大小的数据块进行加密。用户还可以根据数据块的保密级别对不同的数据块定义不同的加密算法以满足需要。对于广泛存在的视频、地图、档案等大文件实现不同粒度加密策略,可减少文件中不必要的数据加密操作,极大提高存储系统的性能。     

Chaos-based joint compression and encryption algorithm for generating variable length ciphertext

Here we modify a chaos-based joint compression and encryption algorithm previously proposed by us. Two modifications are suggested for improving the compression performance and generating ciphertext with variable length, respectively. The first goal is achieved by counting the number of distinct symbols visited by the chaotic search orbit, rather than the total number of iterations of the chaotic map. The second objective is realized by introducing a user-chosen parameter to determine the ratio between the search and the mask modes. The performance of the modified algorithm is justified by simulation results using standard test files.     

基于Newsvendor型产品特性的FJSP问题研究

针对新时代环境下Newsvendor型产品销售期短、期末未出售产品价值递减的产品特点,生产链要求位于上游的供应商必须快速加工出所需的工件,否则将面临着线性递增的拖期惩罚。在面对基于Newsvendor型产品的柔性作业车间调度问题时,设计了一种加入禁忌搜索的混合遗传算法,扩大了解的搜索范围,避免了传统遗传算法容易陷于局部最优的缺陷。最后利用混合遗传算法对一个仿真案例进行求解。     

一种改进的自适应遗传算法的收敛性分析

针对目前遗传算法缺乏有效的分析工具,理论分析困难较大的问题,提出了一种基于压缩映射原理的收敛性分析方法。首先,讨论了遗传算法收敛性的2种定义。然后介绍了一种基于精英保留策略的改进的自适应遗传算法,作为收敛性分析的对象。介绍了压缩映射原理,作为收敛性分析工具。最后,应用该定理对改进的自适应遗传算法进行了收敛性分析,验证了该算法是收敛的,证明压缩映射原理是遗传算法收敛性分析的一种有效工具。     

基于遗传算法的平流层飞艇路径规划设计

利用传统线性化方法--小扰动法将模型线性化,结合平流层飞艇的工作特性,把飞艇上升运动看成是纵向基准运动和横侧向扰动运动.然后采用最小值原理,根据飞艇的控制量和边界条件,设计和优化飞艇的上升轨迹,其性能目标函数是从初始点到目标点运动过程中能量消耗最小.利用遗传算法,在运动模型和控制量变化的共同约束作用下,求取目标函数的最小值.最后根据飞艇实际工作过程,对仿真结果分析表明,该方法具有实际应用价值.     

基于改进蚁群算法的维修拆卸序列规划

维修拆卸序列规划是整个维修性设计的重要内容。为了能够以较高的效率求解出产品中零件的拆卸方案,依据产品的基本信息和零件之间的约束关系,建立拆卸Petri网可达图,将拆卸序列规划问题转化为对Petri网可达图最优路径的搜索和寻优问题。同时利用蚁群优化算法对组合优化具有高强适应性的特征,改进基本蚁群算法,对可达图模型进行路径寻优,得到最优或次优的拆卸序列。最后通过实例验证了该方法的有效性。     

基于多条件约束的无线传感器网络QoS路径选择算法

多约束QoS路径选择是无线多媒体传感器网络亟待解决的关键问题,已被证明是NP全问题。分析了有线传感器网络使用的多项式时间和伪多项式时间启发式路径选择算法存在着计算复杂度高的特点,不适合无线多媒体传感器网。提出了一种基于改进的模拟退火的多约束QoS路径选择算法,选取控制参数T的衰减函数和控制参数T的终值Tf这两个重要参数进行优化,构造出更精细的冷却进度表。分析表明该算法是一种高效的路径选择算法,在不牺牲算法复杂度的情况下,能够提高最终解的质量。     

基于混沌量子进化算法的单交叉口信号控制

城市道路各交叉口交通信号的配时优化和协同控制直接影响整个城市的交通状况.本文以单交叉口模型的交通信号控制问题为背景,构造了以单交叉口滞留的车辆数最少为目标的优化模型.用混沌量子进化算法进行仿真数据求解,得到实时控制的配时方案,并与其它算法的仿真结果进行比较,结果表明该算法对单交叉口的信号配时优化是非常有效的.     

基于群智能混合算法的物流配送路径研究

针对物流车辆路径优化问题,考虑到基本蚁群算法有收敛速度慢、易陷入局部最优的缺点,采用了一种双种群蚁群算法,在蚁群的基础上引入差分进化(DE)和粒子群算法(PSO)。通过在PSOAS种群和DEAS种群之间建立一种信息交流机制,使信息能够在两个种群中传递,以免某一方因错误的信息判断而陷入局部最优点。通过matlab仿真实验测试,表明该群智能混合算法可以较好地解决TSP的问题。