Optimization of a crude distillation unit using a combination of wavelet neural network and line-up competition algorithm

The modeling and optimization of an industrial-scale crude distillation unit(CDU)are addressed.The main specifications and base conditions of CDU are taken from a crude oil refinery in Wuhan,China.For modeling of a complicated CDU,an improved wavelet neural network(WNN)is presented to model the complicated CDU,in which novel parametric updating laws are developed to precisely capture the characteristics of CDU.To address CDU in an economically optimal manner,an economic optimization algorithm under prescribed constraints is presented.By using a combination of WNN-based optimization model and line-up competition algorithm(LCA),the superior performance of the proposed approach is verified.Compared with the base operating condition,it is validated that the increments of products including kerosene and diesel are up to 20% at least by increasing less than 5% duties of intermediate coolers such as second pump-around(PA2)and third pump-around(PA3).

Tele-Network Design Based on Queue Competition Algorithm

In this paper, we report research on how to design the tele-network. First of all, we defined the reliability of tele-network. According to the definition, we divide the whole reliability into two parts:the reliability of the mini-way and that of the whole system. Then we do algebra unintersection of the mini-way, deriving a function of reliability of tele-network. Also, we got a function of the cost of tele-network after analyzing the cost of arcs and points. Finally, we give a mathematical model to design a tele-network. For the algorithm, we define the distance of a network and adjacent area within certain boundaries . We present a new algorithm--Queue Competition Algorithm (QCA) based on the adjacent area . The QCA correlates sequence of fitnesses in their father-generations with hunting zone of mutation and the number of individuals generated by mutation, making the stronger fitness in a small zone converge at a local extreme value, but the weaker one takes the advantage of lots of individuals and a big zone to hunt a new local extreme value. In this way, we get the overall extreme value. Numerical simulation shows that we can get the efficient hunting and exact solution by using QCA. The QCA efficient hunting and exact solution.

A Memetic Algorithm With Competition for the Capacitated Green Vehicle Routing Problem

In this paper, a memetic algorithm with competition(MAC) is proposed to solve the capacitated green vehicle routing problem(CGVRP). Firstly, the permutation array called traveling salesman problem(TSP) route is used to encode the solution, and an effective decoding method to construct the CGVRP route is presented accordingly. Secondly, the k-nearest neighbor(k NN) based initialization is presented to take use of the location information of the customers. Thirdly, according to the characteristics of the CGVRP, the search operators in the variable neighborhood search(VNS) framework and the simulated annealing(SA) strategy are executed on the TSP route for all solutions. Moreover, the customer adjustment operator and the alternative fuel station(AFS) adjustment operator on the CGVRP route are executed for the elite solutions after competition. In addition, the crossover operator is employed to share information among different solutions. The effect of parameter setting is investigated using the Taguchi method of design-ofexperiment to suggest suitable values. Via numerical tests, it demonstrates the effectiveness of both the competitive search and the decoding method. Moreover, extensive comparative results show that the proposed algorithm is more effective and efficient than the existing methods in solving the CGVRP.

Soccer League Competition Algorithm, a New Method for Solving Systems of Nonlinear Equations

This paper introduces Soccer League Competition (SLC) algorithm as a new optimization technique for solving nonlinear systems of equations. Fundamental ideas of the method are inspired from soccer leagues and based on the competitions among teams and players. Like other meta-heuristic methods, the proposed technique starts with an initial population. Population individuals called players are in two types: fixed players and substitutes that all together form some teams. The competition among teams to take the possession of the top ranked positions in the league table and the internal competitions between players in each team for personal improvements results in the convergence of population individuals to the global optimum. Results of applying the proposed algorithm in solving nonlinear systems of equations demonstrate that SLC converges to the answer more accurately and rapidly in comparison with other Meta-heuristic and Newton-type methods.

Diagnosis of Autism Spectrum Disorder by Imperialistic Competitive Algorithm and Logistic Regression Classifier

Autism spectrum disorder(ASD),classified as a developmental disability,is now more common in children than ever.A drastic increase in the rate of autism spectrum disorder in children worldwide demands early detection of autism in children.Parents can seek professional help for a better prognosis of the child’s therapy when ASD is diagnosed under five years.This research study aims to develop an automated tool for diagnosing autism in children.The computer-aided diagnosis tool for ASD detection is designed and developed by a novel methodology that includes data acquisition,feature selection,and classification phases.The most deterministic features are selected from the self-acquired dataset by novel feature selection methods before classification.The Imperialistic competitive algorithm(ICA)based on empires conquering colonies performs feature selection in this study.The performance of Logistic Regression(LR),Decision tree,K-Nearest Neighbor(KNN),and Random Forest(RF)classifiers are experimentally studied in this research work.The experimental results prove that the Logistic regression classifier exhibits the highest accuracy for the self-acquired dataset.The ASD detection is evaluated experimentally with the Least Absolute Shrinkage and Selection Operator(LASSO)feature selection method and different classifiers.The Exploratory Data Analysis(EDA)phase has uncovered crucial facts about the data,like the correlation of the features in the dataset with the class variable.

Optimal Allocation of STATCOM to Enhance Transient Stability Using Imperialist Competitive Algorithm

With the daily expansion of global energy consumption,developing the power grids is of uttermost importance.However,building a new trans-mission line is costly and time-consuming,so utilizing the same lines with possible higher transmission capacity is very cost-effective.In this regard,to increase the capacity of the transmission lines,the flexible alternating current transmission system(FACTS)has been widely used in power grids in recent years by industrialized countries.One of the essential topics in electrical power systems is the reactive power compensation,and the FACTS plays a significant role in controlling the reactive power current in the power grid and the system voltage oscillations and stability.When a static synchronous compensator(STATCOM)is embedded in a power system to increase the bus voltage,a supplementary damping controller can be designed to enhance the system oscillation damping.Given the expansion of the grids in the power system,the complexity of their optimization and the extraordinary ability of the imperialist competitive algorithm(ICA)for solving such problems,in this paper,the ICA has been used to determine the optimal position and size of the FACTS devices.

Imperialistic Competitive Algorithm:A metaheuristic algorithm for locating the critical slip surface in 2-Dimensional soil slopes

In this study, Imperialistic Competitive Algorithm（ICA） is utilized for locating the critical failure surface and computing the factor of safety（FOS） in a slope stability analysis based on the limit equilibrium approach. The factor of safety relating to each trial slip surface is calculated using a simplified algorithm of the Morgenstern-Price method, which satisfies both the force and the moment equilibriums. General slip surface is considered non-circular in this study that is constituted by linking random straight lines.To explore the performance of the proposed algorithm, four benchmark test problems are analyzed. The results demonstrate that the present techniques can provide reliable, accurate and efficient solutions for locating the critical failure surface and relating FOS. Moreover, in contrast with previous studies the present algorithm could reach the lower value of FOS and reached more exact solutions.

Novel applications of bipolar single-valued neutrosophic competition graphs

Bipolar single-valued neutrosophic models are the generalization of bipolar fuzzy models. We first introduce the concept of bipolar single-valued neutrosophic competition graphs. We then, discuss some important propositions related to bipolar single-valued neutrosophic competition graphs. We define bipolar single-valued neutrosophic economic competition graphs and m-step bipolar single-valued neutrosophic economic competition graphs. Further, we describe applications of bipolar single-valued neutrosophic competition graphs in organizational designations and brands competition. Finally, we present our improved methods by algorithms.

A Review of On-Line Machine Scheduling:Algorithms and Competitiveness

在过去的十年里，在线算法的研究吸引了广泛的兴趣．本文对在排序和时间表问题中的各种有效的在线算法以及它们的竞争度作一综述．

Machining Parameters Optimization of Multi-Pass Face Milling Using a Chaotic Imperialist Competitive Algorithm with an Efficient Constraint-Handling Mechanism

The selection of machining parameters directly affects the production time,quality,cost,and other process performance measures for multi-pass milling.Optimization of machining parameters is of great significance.However,it is a nonlinear constrained optimization problem,which is very difficult to obtain satisfactory solutions by traditional optimization methods.A new optimization technique combined chaotic operator and imperialist competitive algorithm(ICA)is proposed to solve this problem.The ICA simulates the competition between the empires.It is a population-based meta-heuristic algorithm for unconstrained optimization problems.Imperialist development operator based on chaotic sequence is introduced to improve the local search of ICA,while constraints handling mechanism is introduced and an imperialist-colony transformation policy is established.The improved ICA is called chaotic imperialist competitive algorithm(CICA).A case study of optimizing machining parameters for multi-pass face milling operations is presented to verify the effectiveness of the proposed method.The case is to optimize parameters such as speed,feed,and depth of cut in each pass have yielded a minimum total product ion cost.The depth of cut of optimal strategy obtained by CICA are 4 mm,3 mm,1 mm for rough cutting pass 1,rough cutting pass 1 and finish cutting pass,respectively.The cost for each pass are$0.5366 US,$0.4473 US and$0.3738 US.The optimal solution of CICA for various strategies with at=8 mm is$1.3576 US.The results obtained with the proposed schemes are better than those of previous work.This shows the superior performance of CICA in solving such problems.Finally,optimization of cutting strategy when the width of workpiece no smaller than the diameter of cutter is discussed.Conclusion can be drawn that larger tool diameter and row spacing should be chosen to increase cutting efficiency.

Fault Attribute Reduction of Oil Immersed Transformer Based on Improved Imperialist Competitive Algorithm

The original fault data of oil immersed transformer often contains a large number of unnecessary attributes,which greatly increases the elapsed time of the algorithm and reduces the classification accuracy,leading to the rise of the diagnosis error rate.Therefore,in order to obtain high quality oil immersed transformer fault attribute data sets,an improved imperialist competitive algorithm was proposed to optimize the rough set to discretize the original fault data set and the attribute reduction.The feasibility of the proposed algorithm was verified by experiments and compared with other intelligent algorithms.Results show that the algorithm was stable at the 27th iteration with a reduction rate of 56.25%and a reduction accuracy of 98%.By using BP neural network to classify the reduction results,the accuracy was 86.25%,and the overall effect was better than those of the original data and other algorithms.Hence,the proposed method is effective for fault attribute reduction of oil immersed transformer.

A Competitive Markov Approach to the Optimal Combat Strategies of On-Line Action Role-Playing Game Using Evolutionary Algorithms

In the case of on-line action role-playing game, the combat strategies can be divided into three distinct classes, Strategy of Motion(SM), Strategy of Attacking Occasion (SAO) and Strategy of Using Skill (SUS). In this paper, we analyze such strategies of a basic game model in which the combat is modeled by the discrete competitive Markov decision process. By introducing the chase model and the combat assistant technology, we identify the optimal SM and the optimal SAO, successfully. Also, we propose an evolutionary framework, including integration with competitive coevolution and cooperative coevolution, to search the optimal SUS pair which is regarded as the Nash equilibrium point of the strategy space. Moreover, some experiments are made to demonstrate that the proposed framework has the ability to find the optimal SUS pair. Furthermore, from the results, it is shown that using cooperative coevolutionary algorithm is much more efficient than using simple evolutionary algorithm.

Research on Optimization of Freight Train ATO Based on Elite Competition Multi-Objective Particle Swarm Optimization

In view of the complex problems that freight train ATO (automatic train operation) needs to comprehensively consider punctuality, energy saving and safety, a dynamics model of the freight train operation process is established based on the safety and the freight train dynamics model in the process of its operation. The algorithm of combining elite competition strategy with multi-objective particle swarm optimization technology is introduced, and the winning particles are obtained through the competition between two elite particles to guide the update of other particles, so as to balance the convergence and distribution of multi-objective particle swarm optimization. The performance comparison experimental results verify the superiority of the proposed algorithm. The simulation experiments of the actual line verify the feasibility of the model and the effectiveness of the proposed algorithm.

A New Method for Clustering Based on Development of Imperialist Competitive Algorithm

Clustering is one of the most widely used data mining techniques that can be used to create homogeneous clusters.K-means is one of the popular clustering algorithms that,despite its inherent simplicity,has also some major problems.One way to resolve these problems and improve the k-means algorithm is the use of evolutionary algorithms in clustering.In this study,the Imperialist Competitive Algorithm(ICA) is developed and then used in the clustering process.Clustering of IRIS,Wine and CMC datasets using developed ICA and comparing them with the results of clustering by the original ICA,GA and PSO algorithms,demonstrate the improvement of Imperialist competitive algorithm.

Design Optimization of Permanent Magnet Eddy Current Coupler Based on an Intelligence Algorithm

The permanent magnet eddy current coupler(PMEC)solves the problem of flexible connection and speed regulation between the motor and the load and is widely used in electrical transmission systems.It provides torque to the load and generates heat and losses,reducing its energy transfer efficiency.This issue has become an obstacle for PMEC to develop toward a higher power.This paper aims to improve the overall performance of PMEC through multi-objective optimization methods.Firstly,a PMEC modeling method based on the Levenberg-Marquardt back propagation(LMBP)neural network is proposed,aiming at the characteristics of the complex input-output relationship and the strong nonlinearity of PMEC.Then,a novel competition mechanism-based multi-objective particle swarm optimization algorithm(NCMOPSO)is proposed to find the optimal structural parameters of PMEC.Chaotic search and mutation strategies are used to improve the original algorithm,which improves the shortcomings of multi-objective particle swarm optimization(MOPSO),which is too fast to converge into a global optimum,and balances the convergence and diversity of the algorithm.In order to verify the superiority and applicability of the proposed algorithm,it is compared with several popular multi-objective optimization algorithms.Applying them to the optimization model of PMEC,the results show that the proposed algorithm has better comprehensive performance.Finally,a finite element simulation model is established using the optimal structural parameters obtained by the proposed algorithm to verify the optimization results.Compared with the prototype,the optimized PMEC has reduced eddy current losses by 1.7812 kW,increased output torque by 658.5 N·m,and decreased costs by 13%,improving energy transfer efficiency.

基于可信容量的长期储能充裕性决策分解模型

电力系统发电容量充裕性是表征系统发电能力的一个重要指标,合理调动长期储能充分利用其转移电量的能力,是平衡系统充裕性波动的一个重要方法.针对长期储能年周期内的转移电量分配问题,提出基于可信容量的长期储能充裕性决策分解模型.鉴于新能源机组和常规机组的评估水平不同,利用基于等可靠性指标的新能源可信容量评估将新能源等效为常规机组,以评估新能源机组对电力系统充裕性的贡献.计及强迫停运因素,对机组充裕容量进行调整,并且分析长期储能转移电量对于系统充裕性的影响;根据系统充裕性评估方法,构建以长期储能转移电量为决策变量的长期储能充裕性决策分解模型,并且考虑长期储能的自放电和充放电损耗,建立相关约束条件.考虑到模型非线性分段的特征,采用列队竞争算法对其求解,同时为了克服收缩比选取困难的问题,对列队竞争算法进行改进.设置算例分析电力系统新能源和常规机组对系统发电容量充裕性的贡献程度,验证长期储能充裕性决策分解模型的可行性,对比算法证实了改进列队竞争算法的优越性.

基于帝国竞争反向传播神经网络的断块油田开发顺序优化

明确断块油田群中断块的开发顺序是进行开发方案设计的前提条件。断块油田数量较少时,可以进行技术经济的组合对比,但是断块数量较多时会形成海量的组合,耗费时间也长。断块油田开发顺序评价的现有方法有权重评价法、层次分析法、综合模糊评判法等,这些方法在选择评价指标和指标权重上带有较强的主观性,无法做到完全客观的评价。因此本文提出一种基于帝国竞争算法改进的反向传播神经网络模型,首先采用Spearman相关系数法确定影响断块油田开发的主控因素,其次使用分段三次Hermite插值方法实现断块油田群开发数据库的扩充,最后在扩充后的大量数据库训练样本的基础上,基于帝国竞争算法改进的反向传播神经网络模型可以确定影响开发效果参数的权重并预测断块油田群中各断块油田的净现值,根据净现值大小可以确定每个断块的开发顺序。该方法以实际断块油田群的地质油藏数据库作为评价依据,断块油田的开发顺序更加的科学合理,项目整体的净现值也明显高于依靠传统方法确定的开发顺序组合,避免了人为主观性,也节省了数值模拟和经济评价的工作量,克服了现有方法的局限性,对于提高断块油田群开发综合效益具有重要意义。

新能源汽车电池回收网点竞争选址模型及算法

针对考虑排队论的新能源汽车电池回收网点竞争设施选址问题,提出一种改进的人类学习优化(IHLO)算法。首先,构建包含排队时间约束、容量约束和门槛约束等条件的新能源汽车电池回收网点竞争设施选址模型;然后,考虑到该问题属于NP-hard问题,针对人类学习优化(HLO)算法前期收敛速度较慢、寻优精度不够高、求解稳定性不够高的不足,通过引入精英种群反向学习策略、团队互助学习算子和调和参数自适应策略提出IHLO算法;最后,以上海市和长江三角洲为例进行数值实验,并将IHLO算法和改进二进制灰狼(IBGWO)算法、改进二进制粒子群(IBPSO)算法、HLO算法和融合学习心理学的人类学习优化(LPHLO)算法进行比较。大、中、小三种不同规模的实验结果表明,IHLO算法在15个指标中的14个指标上表现最优,IHLO算法比IBGWO算法求解精度至少提高了0.13%,求解稳定性至少提高了10.05%,求解速度至少提高了17.48%。所提算法具有较高的计算精度和优化速度,可有效解决竞争设施选址问题。

基于领导者竞争策略的改进猎人猎物优化算法

针对猎人猎物优化算法寻优精度低和易陷入局部最优等问题,提出了一种基于领导者竞争策略的改进猎人猎物优化算法。首先将种群随机分为三个亚群,采用不同的搜索策略,扩大搜索范围;其次,采用精英组合突变策略,提升种群子代多样性,规避局部最优值;最后,提出领导者竞争策略,利用个体间的信息交流,统合各个策略,筛选出最优变量。通过数值实验以及在工程优化问题上的应用结果表明,所提算法相较于对比算法具有更为优异的寻优能力,验证了改进策略的有效性和可靠性。

机器视觉在采摘机器人识别与定位中的应用

针对采摘机器人的运行环境复杂,采摘效率无法满足实际生产需求。这里在采摘机器人体系结构的基础上,提出了一种基于机器视觉的夜间识别与定位方法。使用基于粒子群优化的独立成分分析方法来降低夜苹果图像中的噪声,然后使用PCNN分割方法对图像进行分割并通过边缘检测等提取目标轮廓,最后通过改进的三点定圆法对目标果实进行定位。通过仿真验证了该方法的可行性。结果表明,该方法在夜间遮挡小于50%时识别率为94.3%,遮挡大于50%时识别率为89.05%,可以有效提高识别和定位的准确性。为机器人识别和定位技术的发展提供了一定的参考。