# American Institute of Mathematical Sciences

• Previous Article
Convergence analysis of the discrete duality finite volume scheme for the regularised Heston model
• DCDS-S Home
• This Issue
• Next Article
Signed-distance function based non-rigid registration of image series with varying image intensity
March  2021, 14(3): 1161-1180. doi: 10.3934/dcdss.2020227

## Comparison of modern heuristics on solving the phase stability testing problem

 Czech Technical University in Prague, Faculty of Nuclear Sciences and Physical Engineering, Trojanova 13,120 00 Prague 2, Czech Republic

* Corresponding author: Tomáš Smejkal

Received  January 2019 Revised  November 2019 Published  December 2019

In this paper, we are concerned with the phase stability testing at constant volume, temperature, and moles ($VTN$-specification) of a multicomponent mixture, which is an unconstrained minimization problem. We present and compare the performance of five chosen optimization algorithms: Differential Evolution, Cuckoo Search, Harmony Search, CMA-ES, and Elephant Herding Optimization. For the comparison of the evolution strategies, we use the Wilcoxon signed-rank test. In addition, we compare the evolution strategies with the classical Newton-Raphson method based on the computation times. Moreover, we present the expanded mirroring technique, which mirrors the computed solution into a given simplex.

Citation: Tomáš Smejkal, Jiří Mikyška, Jaromír Kukal. Comparison of modern heuristics on solving the phase stability testing problem. Discrete & Continuous Dynamical Systems - S, 2021, 14 (3) : 1161-1180. doi: 10.3934/dcdss.2020227
##### References:

show all references

##### References:
Geometric interpretation of mirroring into the feasible simplex
Global minimum of the $\mathrm{TPD}$ function in the $cT$-space and the number of successful runs of each evolution heuristic. The red line represents the phase boundary (above the line the global minimum is zero). Example 1: mixture C$_1$-C$_3$
Global minimum of the $\mathrm{TPD}$ function in the $cT$-space and the number of successful runs of each evolution heuristic. The red line represents the phase boundary (above the line the global minimum is zero). Example 2: mixture N$_2$-CO$_2$-C$_1$-PC$_i$
 advantages disadvantages DE ● good convergence properties ● parameter tuning is necessary ● strong theoretical analysis ● easy to stuck in a local minimum CS ● supports local and global search ● small precision ● easy to hybridize ● no theoretical analysis HS ● simple implementation ● slow convergence ● small population ● small precision CMA-ES ● no curse of dimensionality [2] ● harder implementation ● in-variance properties ● a lot of parameters EHO ● hard to stuck in a local minimum ● slow convergence ● fewer parameters ● fixed parameters
 advantages disadvantages DE ● good convergence properties ● parameter tuning is necessary ● strong theoretical analysis ● easy to stuck in a local minimum CS ● supports local and global search ● small precision ● easy to hybridize ● no theoretical analysis HS ● simple implementation ● slow convergence ● small population ● small precision CMA-ES ● no curse of dimensionality [2] ● harder implementation ● in-variance properties ● a lot of parameters EHO ● hard to stuck in a local minimum ● slow convergence ● fewer parameters ● fixed parameters
Parameters of the Peng-Robinson equation of state used in Examples 1–2
 Component $T_{\mathrm{crit}}$ [K] $P_{\mathrm{crit}}$ [MPa] $\omega$ [-] C$_1$ 190.40 4.60 0.0110 C$_3$ 369.80 4.25 0.1530 CO$_2$ 304.14 7.375 0.2390 N$_2$ 126.21 3.390 0.0390 PC$_1$ 333.91 5.329 0.1113 PC$_2$ 456.25 3.445 0.2344 PC$_3$ 590.76 2.376 0.4470 C$_{12+}$ 742.58 1.341 0.9125
 Component $T_{\mathrm{crit}}$ [K] $P_{\mathrm{crit}}$ [MPa] $\omega$ [-] C$_1$ 190.40 4.60 0.0110 C$_3$ 369.80 4.25 0.1530 CO$_2$ 304.14 7.375 0.2390 N$_2$ 126.21 3.390 0.0390 PC$_1$ 333.91 5.329 0.1113 PC$_2$ 456.25 3.445 0.2344 PC$_3$ 590.76 2.376 0.4470 C$_{12+}$ 742.58 1.341 0.9125
The binary interaction coefficients between all components in Example 2
 Component N$_2$ CO$_2$ C$_1$ PC$_1$ PC$_2$ PC$_3$ C$_{12+}$ N$_2$ 0.000 0.000 0.100 0.100 0.100 0.100 0.100 CO$_2$ 0.000 0.000 0.150 0.150 0.150 0.150 0.150 C$_1$ 0.100 0.150 0.000 0.035 0.040 0.049 0.069 PC$_1$ 0.100 0.150 0.035 0.000 0.000 0.000 0.000 PC$_2$ 0.100 0.150 0.040 0.000 0.000 0.000 0.000 PC$_3$ 0.100 0.150 0.049 0.000 0.000 0.000 0.000 C$_{12+}$ 0.100 0.150 0.069 0.000 0.000 0.000 0.000
 Component N$_2$ CO$_2$ C$_1$ PC$_1$ PC$_2$ PC$_3$ C$_{12+}$ N$_2$ 0.000 0.000 0.100 0.100 0.100 0.100 0.100 CO$_2$ 0.000 0.000 0.150 0.150 0.150 0.150 0.150 C$_1$ 0.100 0.150 0.000 0.035 0.040 0.049 0.069 PC$_1$ 0.100 0.150 0.035 0.000 0.000 0.000 0.000 PC$_2$ 0.100 0.150 0.040 0.000 0.000 0.000 0.000 PC$_3$ 0.100 0.150 0.049 0.000 0.000 0.000 0.000 C$_{12+}$ 0.100 0.150 0.069 0.000 0.000 0.000 0.000
Computation times in seconds for Examples 1–2
 Example 1 Example 2 Newton-Raphson 0.99 11.55 Differential Evolution 35.87 995.03 Cuckoo Search 78.55 394.63 Harmony Search 210.72 862.48 CMA-ES 26.48 408.91 Elephant Herding Optimization 500.30 1777.72
 Example 1 Example 2 Newton-Raphson 0.99 11.55 Differential Evolution 35.87 995.03 Cuckoo Search 78.55 394.63 Harmony Search 210.72 862.48 CMA-ES 26.48 408.91 Elephant Herding Optimization 500.30 1777.72
 [1] M. S. Lee, H. G. Harno, B. S. Goh, K. H. Lim. On the bang-bang control approach via a component-wise line search strategy for unconstrained optimization. Numerical Algebra, Control & Optimization, 2021, 11 (1) : 45-61. doi: 10.3934/naco.2020014 [2] Lekbir Afraites, Chorouk Masnaoui, Mourad Nachaoui. Shape optimization method for an inverse geometric source problem and stability at critical shape. Discrete & Continuous Dynamical Systems - S, 2021  doi: 10.3934/dcdss.2021006 [3] Bing Yu, Lei Zhang. Global optimization-based dimer method for finding saddle points. Discrete & Continuous Dynamical Systems - B, 2021, 26 (1) : 741-753. doi: 10.3934/dcdsb.2020139 [4] C. J. Price. A modified Nelder-Mead barrier method for constrained optimization. Numerical Algebra, Control & Optimization, 2020  doi: 10.3934/naco.2020058 [5] Hui Gao, Jian Lv, Xiaoliang Wang, Liping Pang. An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information. Journal of Industrial & Management Optimization, 2021, 17 (2) : 805-825. doi: 10.3934/jimo.2019135 [6] Guo Zhou, Yongquan Zhou, Ruxin Zhao. Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem. Journal of Industrial & Management Optimization, 2021, 17 (2) : 533-548. doi: 10.3934/jimo.2019122 [7] Editorial Office. Retraction: Jinling Wei, Jinming Zhang, Meishuang Dong, Fan Zhang, Yunmo Chen, Sha Jin and Zhike Han, Applications of mathematics to maritime search. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 957-957. doi: 10.3934/dcdss.2019064 [8] Min Xi, Wenyu Sun, Jun Chen. Survey of derivative-free optimization. Numerical Algebra, Control & Optimization, 2020, 10 (4) : 537-555. doi: 10.3934/naco.2020050 [9] Predrag S. Stanimirović, Branislav Ivanov, Haifeng Ma, Dijana Mosić. A survey of gradient methods for solving nonlinear optimization. Electronic Research Archive, 2020, 28 (4) : 1573-1624. doi: 10.3934/era.2020115 [10] Xinpeng Wang, Bingo Wing-Kuen Ling, Wei-Chao Kuang, Zhijing Yang. Orthogonal intrinsic mode functions via optimization approach. Journal of Industrial & Management Optimization, 2021, 17 (1) : 51-66. doi: 10.3934/jimo.2019098 [11] Wolfgang Riedl, Robert Baier, Matthias Gerdts. Optimization-based subdivision algorithm for reachable sets. Journal of Computational Dynamics, 2021, 8 (1) : 99-130. doi: 10.3934/jcd.2021005 [12] Manxue You, Shengjie Li. Perturbation of Image and conjugate duality for vector optimization. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020176 [13] Marek Macák, Róbert Čunderlík, Karol Mikula, Zuzana Minarechová. Computational optimization in solving the geodetic boundary value problems. Discrete & Continuous Dynamical Systems - S, 2021, 14 (3) : 987-999. doi: 10.3934/dcdss.2020381 [14] Liupeng Wang, Yunqing Huang. Error estimates for second-order SAV finite element method to phase field crystal model. Electronic Research Archive, 2021, 29 (1) : 1735-1752. doi: 10.3934/era.2020089 [15] Vincent Ducrot, Pascal Frey, Alexandra Claisse. Levelsets and anisotropic mesh adaptation. Discrete & Continuous Dynamical Systems - A, 2009, 23 (1&2) : 165-183. doi: 10.3934/dcds.2009.23.165 [16] Alberto Bressan, Sondre Tesdal Galtung. A 2-dimensional shape optimization problem for tree branches. Networks & Heterogeneous Media, 2020  doi: 10.3934/nhm.2020031 [17] Yi An, Bo Li, Lei Wang, Chao Zhang, Xiaoli Zhou. Calibration of a 3D laser rangefinder and a camera based on optimization solution. Journal of Industrial & Management Optimization, 2021, 17 (1) : 427-445. doi: 10.3934/jimo.2019119 [18] Ripeng Huang, Shaojian Qu, Xiaoguang Yang, Zhimin Liu. Multi-stage distributionally robust optimization with risk aversion. Journal of Industrial & Management Optimization, 2021, 17 (1) : 233-259. doi: 10.3934/jimo.2019109 [19] Yasmine Cherfaoui, Mustapha Moulaï. Biobjective optimization over the efficient set of multiobjective integer programming problem. Journal of Industrial & Management Optimization, 2021, 17 (1) : 117-131. doi: 10.3934/jimo.2019102 [20] Haodong Yu, Jie Sun. Robust stochastic optimization with convex risk measures: A discretized subgradient scheme. Journal of Industrial & Management Optimization, 2021, 17 (1) : 81-99. doi: 10.3934/jimo.2019100

2019 Impact Factor: 1.233