基于NSGA-II算法的柔性流水车间优化调度模型的构建与应用

为解决造纸企业的高效优化排产问题，使机器利用率最高、减少产品切换次数以及满足客户对产品的时间需求，构建了以成本及最大完工时间最小化为优化目标的两阶段柔性流水车间调度优化模型，并通过一种快速非支配遗传算法（NSGA-II）来求解该模型。结果表明，与人工排产相比，NSGA-II得到的排产结果缩短了约6.5%的最大完工时间，降低了约4.7%的生产成本。     

A bi-objective integrated procurement,production, and distribution problem of a multi-echelon supply chain network design: A new tuned MOEA

Efficient management of supply chain (SC) requires systematic considerations of miscellaneous issues in its comprehensive version. In this paper, a multi-periodic structure is developed for a supply chain network design (SCND) involving suppliers, factories, distribution centers (DCs), and retailers. The nature of the logistic decisions is tactical that encompasses procurement of raw materials from suppliers, production of finished product at factories, distribution of finished product to retailers via DCs, and the storage of raw materials and end product at factories and DCs. Besides, to make the structure more comprehensive, a flow-shop scheduling model in manufacturing part of the SC is integrated in order to obtain optimal delivery time of the product that consists of the makespan and the ship time of the product to DCs via factories. Moreover, to make the model more realistic, shortage in the form of backorder can occur in each period. The two objectives are minimizing the total SC costs as well as minimizing the average tardiness of product to DCs. The obtained model is a bi-objective mixed-integer non-linear programming (MINLP) model that is shown to belong to NP-Hard class of the optimization problems. Thus, a novel algorithm, called multi-objective biogeography based optimization (MOBBO) with tuned parameters is presented to find a near-optimum solution. As there is no benchmark available in the literature, the parameter-tuned multi-objective simulated annealing algorithm (MOSA) and the popular non-dominated sorting genetic algorithm (NSGA-II) are developed to validate the results obtained and to evaluate the performance of MOBBO using randomly generated test instances.     

Prediction maintenance integrated decision-making approach supported by digital twin-driven cooperative awareness and interconnection framework

Predictive maintenance is one of the important technical means to guarantee and improve the normal industrial production. The existing bottlenecks for popularization and application are analyzed. In order to solve these problems, a cooperative awareness and interconnection framework across multiple organizations for total factors that affect prediction maintenance decision-making is discussed. Initially, the structure and operation mechanism of this framework are proposed. It is designed to support the sharing of data, knowledge and resources. As a key supporting technology, the digital twin is also integrated into it to improve the accuracy of fault diagnosis and prediction and support making a maintenance plan with higher accuracy and reliability. Then, under this framework, an integrated mathematical programming model is established with considering the parameter uncertainty and an NSGA-II hybrid algorithm is utilized to solve it. Moreover, an adjustment strategy for a maintenance plan is discussed in response to the dynamic characteristics of the actual maintenance environment. Finally, a case, prediction maintenance decision-making for bearings in grinding rolls of the large vertical mill, is studied. Analysis results verify the advantage of the integrated solving mechanism based on the proposed framework. The framework and integrated decision-making approach can guide the implementation of predictive maintenance with higher accuracy and reliability for industrial enterprises.     

Fractional-order load-frequency control of interconnected power systems using chaotic multi-objective optimization

Fractional-order proportional-integral-derivative (FOPID) controllers are designed for load-frequency control (LFC) of two interconnected power systems. Conflicting time-domain design objectives are considered in a multi-objective optimization (MOO)-based design framework to design the gains and the fractional differ-integral orders of the FOPID controllers in the two areas. Here, we explore the effect of augmenting two different chaotic maps along with the uniform random number generator (RNG) in the popular MOO algorithm—the Non-dominated Sorting Genetic Algorithm-II (NSGA-II). Different measures of quality for MOO, e.g. hypervolume indicator, moment of inertia-based diversity metric, total Pareto spread, spacing metric, are adopted to select the best set of controller parameters from multiple runs of all the NSGA-II variants (i.e. nominal and chaotic versions). The chaotic versions of the NSGA-II algorithm are compared with the standard NSGA-II in terms of solution quality and computational time. In addition, the Pareto optimal fronts showing the trade-off between the two conflicting time domain design objectives are compared to show the advantage of using the FOPID controller over that with simple PID controller. The nature of fast/slow and high/low noise amplification effects of the FOPID structure or the four quadrant operation in the two inter-connected areas of the power system is also explored. A fuzzy logic-based method has been adopted next to select the best compromise solution from the best Pareto fronts corresponding to each MOO comparison criteria. The time-domain system responses are shown for the fuzzy best compromise solutions under nominal operating conditions. Comparative analysis on the merits and de-merits of each controller structure is reported then. A robustness analysis is also done for the PID and the FOPID controllers.     

Kriging Surrogate Based Multi-objective Optimization of Bulk Vinyl Acetate Polymerization with Branching

Despite the established superiority in finding the global as well as well-spread Pareto optimal (PO) points, the need of more numbers of function evaluations for population based evolutionary optimization techniques leads to a computationally demanding proposal. The case becomes more miserable if the function evaluations are carried out using a first principle based computationally expensive model, making the proposal not fit for online usage of the application. In this work, a Kriging based surrogate model has been proposed to replace a computationally expensive model to save execution time while performing an optimization task. A multi-objective optimization study has been carried out for the bulk vinyl acetate polymerization with long-chain branching using these surrogate as well as expensive models and Kriging PO solutions similar to those found by the first principle models are obtained with a close to 85% savings in function evaluations.     

平面喷涂漆膜厚度分布规律研究与搭接参数优化

目的实现大型船舶外板表面喷涂的自动化作业,开展表面漆膜厚度分布规律研究,优化平面喷涂轨迹,求出最佳喷涂搭接参数。方法以喷嘴雾幅宽度、距离、喷枪移动速度三个喷涂工艺参数为因素进行正交实验,获得漆膜厚度分布数据,使用b分布函数进行实验数据表征,运用遗传算法优化拟合b分布模型的三个关键参数。基于BP神经网络算法建立漆膜厚度分布预测模型,并对预测结果进行合理性分析。在此基础上,研究每道漆膜之间的搭接规律,运用NSGA-Ⅱ算法求解最优漆膜搭接宽度。结果计算得到15组实验数据对应b分布模型的T_(max)、w及β,构建的漆膜厚度分布预测模型能准确预测在不同喷涂工艺参数下的漆膜厚度分布。以第16组实验为例,计算得到了最优的漆膜搭接宽度为41.76 cm。结论建立了喷涂工艺参数和膜厚分布规律之间的映射模型,该模型可以准确预测不同工艺参数下的涂层厚度分布,应用该模型计算出的最优漆膜搭接宽度能获得厚度均匀的涂层,为实现船舶外板的自动化喷涂做好了前期准备。     

Solving a new multi-objective multi-route flexible flow line problem by multi-objective particle swarm optimization and NSGA-II

Mass production, meeting the increasing demands of the customers is a necessity. Such a production is mainly dependent on a factory manufacturing called flow line production. This paper deals with special type of production by the name of flexible manufacturing system, assuming the presence of multi processors in each station of a multi-station arrangement. The model debated in the paper possesses three objective functions, the first of which attempts to minimize the weighted delays. The second objective function tries to minimize the capital for the purchase of the processors at stations and the third objective function minimizes the capital dedicated to select the optimum processing route of parts. For the validation of the mathematical model, use has been made of NSAGAII and MOPSO approaches.     

Two new meta-heuristics for a bi-objective supply chain scheduling problem in flow-shop environment

In this study, an integrated multi-objective production-distribution flow-shop scheduling problem will be taken into consideration with respect to two objective functions. The first objective function aims to minimize total weighted tardiness and make-span and the second objective function aims to minimize the summation of total weighted earliness, total weighted number of tardy jobs, inventory costs and total delivery costs. Firstly, a mathematical model is proposed for this problem. After that, two new meta-heuristic algorithms are developed in order to solve the problem. The first algorithm (HCMOPSO), is a multi-objective particle swarm optimization combined with a heuristic mutation operator, Gaussian membership function and a chaotic sequence and the second algorithm (HBNSGA-II), is a non-dominated sorting genetic algorithm II with a heuristic criterion for generation of initial population and a heuristic crossover operator. The proposed HCMOPSO and HBNSGA-II are tested and compared with a Non-dominated Sorting Genetic Algorithm II (NSGA-II), a Multi-Objective Particle Swarm Optimization (MOPSO) and two state-of-the-art algorithms from recent researches, by means of several comparing criteria. The computational experiments demonstrate the outperformance of the proposed HCMOPSO and HBNSGA-II.     

Analog active filter design using a multi objective genetic algorithm

The selection of the correct values for passive elements, resistors, and capacitors, is an important task in analog active filter design. The classic method of choosing passive elements is a difficult task and can lead to errors. To reduce the incidence of error and human effort evolutionary optimization techniques are used to select the values of capacitors and resistors. However, due to the single objective optimization technique, these are not well suited to optimize different filter parameters. For this reason, the performance of a multi-objective genetic algorithm named non-dominated sorting genetic algorithm II (NSGA-II) against the different single objective algorithms is evaluated. Two analog active filters: A fourth order Butterworth and a second order state variable filter with the operational amplifiers in their cores are used for testing purposes. In both cases two different objects are chosen along with eight components as variables to be optimized. The component values are compatible with the E12, E24 and E96 series using NSGA-II. The computation results are better in terms of design error and allow for better resistor and capacitor choice. To reach the same or better results the NSGA-II needs fewer generations compared with other genetic algorithms for this problem.