当前位置: X-MOL 学术Processes › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Chaotic Search Based Equilibrium Optimizer for Dealing with Nonlinear Programming and Petrochemical Application
Processes ( IF 3.5 ) Pub Date : 2021-01-21 , DOI: 10.3390/pr9020200
Abd Allah A. Mousa , Mohammed A. El-Shorbagy , Ibrahim Mustafa , Hammad Alotaibi

In this article, chaotic search based constrained equilibrium optimizer algorithm (CS-CEOA) is suggested by integrating a novel heuristic approach called equilibrium optimizer with a chaos theory-based local search algorithm for solving general non-linear programming. CS-CEOA is consists of two phases, the first one (phase I) aims to detect an approximate solution, avoiding being stuck in local minima. In phase II, the chaos-based search algorithm improves local search performance to obtain the best optimal solution. For every infeasible solution, repair function is implemented in a way such that, a new feasible solution is created on the line segment defined by a feasible reference point and the infeasible solution itself. Due to the fast globally converging of evolutionary algorithms and the chaotic search’s exhaustive search, CS-CEOA could locate the true optimal solution by applying an exhaustive local search for a limited area defined from Phase I. The efficiency of CS-CEOA is studied over multi-suites of benchmark problems including constrained, unconstrained, CEC’05 problems, and an application of blending four ingredients, three feed streams, one tank, and two products to create some certain products with specific chemical properties, also to satisfy the target costs. The results were compared with the standard evolutionary algorithms as PSO and GA, and many hybrid algorithms in the same simulation environment to approve its superiority of detecting the optimal solution over selected counterparts.

中文翻译:

基于混沌搜索的平衡优化器,用于非线性规划和石化应用

在本文中,通过将一种新颖的启发式方法(称为均衡优化器)与基于混沌理论的局部搜索算法相集成,提出了一种基于混沌搜索的约束均衡优化器算法(CS-CEOA),以解决一般的非线性规划问题。CS-CEOA由两个阶段组成,第一个阶段(第一阶段)旨在检测近似解,避免陷入局部极小值。在第二阶段,基于混沌的搜索算法提高了局部搜索性能,以获得最佳的最佳解决方案。对于每个不可行的解决方案,以某种方式实施修复功能,以便在由可行的参考点和不可行的解决方案本身定义的线段上创建一个新的可行的解决方案。由于进化算法在全球快速收敛,并且混沌搜索的穷举搜索功能,CS-CEOA可以通过对第一阶段定义的有限区域进行详尽的局部搜索来找到真正的最佳解决方案。CS-CEOA的效率是针对包括约束,无约束,CEC'05问题和将四种成分,三种进料流,一个槽和两种产品混合以产生某些具有特定化学性质的产品的应用,也可以满足目标成本。将结果与标准进化算法(如PSO和GA)以及同一模拟环境中的许多混合算法进行了比较,以证明其在检测最佳解决方案方面优于所选对等方法的优越性。CS-CEOA的效率是针对包括约束,无约束,CEC'05问题在内的多套基准问题进行研究的,并结合了四种成分,三种进料流,一个罐和两种产品来创建某些具有特定特性的产品的应用化学性质,也可以满足目标成本。将结果与标准进化算法(如PSO和GA)以及同一模拟环境中的许多混合算法进行了比较,以证明其在检测最佳解决方案方面优于所选对等算法的优越性。CS-CEOA的效率是针对包括约束,无约束,CEC'05问题在内的多套基准问题进行研究的,并结合了四种成分,三种进料流,一个罐和两种产品来创建某些具有特定特性的产品的应用化学性质,也可以满足目标成本。将结果与标准进化算法(如PSO和GA)以及同一模拟环境中的许多混合算法进行了比较,以证明其在检测最佳解决方案方面优于所选对等方法的优越性。
更新日期:2021-01-21
down
wechat
bug