A local optimization method for the design of reactive distillation

1995 ◽  
Vol 19 (1) ◽  
pp. S235-S240 ◽  
Author(s):  
M Pekkanen
2011 ◽  
Vol 2011 (0) ◽  
pp. _1A1-M13_1-_1A1-M13_2
Author(s):  
Shota INABA ◽  
Masashi FURUKAWA ◽  
Keiko YUKAWA ◽  
Masahiro KINOSHITA ◽  
Takashi KAWAKAMI

2011 ◽  
Vol 2011 (0) ◽  
pp. 83-84
Author(s):  
Takashi KAWAKAMI ◽  
Shota INABA ◽  
Keiko YUKAWA ◽  
Masahiro KINOSHITA

2005 ◽  
Vol 32 (2) ◽  
pp. 161-179 ◽  
Author(s):  
Adil M. Bagirov ◽  
Alexander M. Rubinov ◽  
Jiapu Zhang

2021 ◽  
Author(s):  
Daniel Varela ◽  
Ingemar André

ABSTRACTProtein-protein docking plays a central role in the characterization and discovery of protein interactions in the cell. Complex formation is encoded by specific interactions at the atomic scale, but the computational cost of modeling proteins at this level often requires the use of simplified energy models, coarse-grained protein descriptions and rigid-body approximations. In this study we present EvoDOCK, which is an evolutionary-based docking algorithm that enables the identification of optimal docking orientations using an atomistic energy function and sidechain flexibility, employing a global search without prior information of the binding site. EvoDOCK is a memetic algorithm that combines the strength of a differential evolution algorithm for efficient exploration of the global search space with the benefits of a local optimization method, built on the Monte Carlo-based RosettaDOCK program, to optimize detailed atomic interactions. This approach resulted in substantial improvements in both sampling efficiency and computation speed compared to calculations using the local optimization method RosettaDOCK alone, with up to 35 times of reduction in computational cost. For all the ten systems investigated in this study, a highly accurate docking prediction could be identified as the lowest energy model with high efficiency. While protein-protein docking with EvoDOCK is still computationally expensive compared to many methods based on Fast Fourier Transforms (FFT), the results demonstrate the tractability of global docking proteins using an atomistic energy function while exploring sidechain flexibility. Comparison with FFT global docking demonstrated the benefits of using an all-atom energy function to identify native-like predictions. The sampling strategy in EvoDOCK can readily be tailored to include backbone flexibility in the search, which is often necessary to tackle more challenging docking challenges.


2015 ◽  
Vol 2015 ◽  
pp. 1-17 ◽  
Author(s):  
Sen Zhang ◽  
Yongquan Zhou

One heuristic evolutionary algorithm recently proposed is the grey wolf optimizer (GWO), inspired by the leadership hierarchy and hunting mechanism of grey wolves in nature. This paper presents an extended GWO algorithm based on Powell local optimization method, and we call it PGWO. PGWO algorithm significantly improves the original GWO in solving complex optimization problems. Clustering is a popular data analysis and data mining technique. Hence, the PGWO could be applied in solving clustering problems. In this study, first the PGWO algorithm is tested on seven benchmark functions. Second, the PGWO algorithm is used for data clustering on nine data sets. Compared to other state-of-the-art evolutionary algorithms, the results of benchmark and data clustering demonstrate the superior performance of PGWO algorithm.


Sign in / Sign up

Export Citation Format

Share Document