5,224 research outputs found
A similarity-based cooperative co-evolutionary algorithm for dynamic interval multi-objective optimization problems
The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Dynamic interval multi-objective optimization problems (DI-MOPs) are very common in real-world applications. However, there are few evolutionary algorithms that are suitable for tackling DI-MOPs up to date. A framework of dynamic interval multi-objective cooperative co-evolutionary optimization based on the interval similarity is presented in this paper to handle DI-MOPs. In the framework, a strategy for decomposing decision variables is first proposed, through which all the decision variables are divided into two groups according to the interval similarity between each decision variable and interval parameters. Following that, two sub-populations are utilized to cooperatively optimize decision variables in the two groups. Furthermore, two response strategies, rgb0.00,0.00,0.00i.e., a strategy based on the change intensity and a random mutation strategy, are employed to rapidly track the changing Pareto front of the optimization problem. The proposed algorithm is applied to eight benchmark optimization instances rgb0.00,0.00,0.00as well as a multi-period portfolio selection problem and compared with five state-of-the-art evolutionary algorithms. The experimental results reveal that the proposed algorithm is very competitive on most optimization instances
Symplectic Model Reduction of Hamiltonian Systems
In this paper, a symplectic model reduction technique, proper symplectic
decomposition (PSD) with symplectic Galerkin projection, is proposed to save
the computational cost for the simplification of large-scale Hamiltonian
systems while preserving the symplectic structure. As an analogy to the
classical proper orthogonal decomposition (POD)-Galerkin approach, PSD is
designed to build a symplectic subspace to fit empirical data, while the
symplectic Galerkin projection constructs a reduced Hamiltonian system on the
symplectic subspace. For practical use, we introduce three algorithms for PSD,
which are based upon: the cotangent lift, complex singular value decomposition,
and nonlinear programming. The proposed technique has been proven to preserve
system energy and stability. Moreover, PSD can be combined with the discrete
empirical interpolation method to reduce the computational cost for nonlinear
Hamiltonian systems. Owing to these properties, the proposed technique is
better suited than the classical POD-Galerkin approach for model reduction of
Hamiltonian systems, especially when long-time integration is required. The
stability, accuracy, and efficiency of the proposed technique are illustrated
through numerical simulations of linear and nonlinear wave equations.Comment: 25 pages, 13 figure
Towards Structural Classification of Proteins based on Contact Map Overlap
A multitude of measures have been proposed to quantify the similarity between
protein 3-D structure. Among these measures, contact map overlap (CMO)
maximization deserved sustained attention during past decade because it offers
a fine estimation of the natural homology relation between proteins. Despite
this large involvement of the bioinformatics and computer science community,
the performance of known algorithms remains modest. Due to the complexity of
the problem, they got stuck on relatively small instances and are not
applicable for large scale comparison. This paper offers a clear improvement
over past methods in this respect. We present a new integer programming model
for CMO and propose an exact B &B algorithm with bounds computed by solving
Lagrangian relaxation. The efficiency of the approach is demonstrated on a
popular small benchmark (Skolnick set, 40 domains). On this set our algorithm
significantly outperforms the best existing exact algorithms, and yet provides
lower and upper bounds of better quality. Some hard CMO instances have been
solved for the first time and within reasonable time limits. From the values of
the running time and the relative gap (relative difference between upper and
lower bounds), we obtained the right classification for this test. These
encouraging result led us to design a harder benchmark to better assess the
classification capability of our approach. We constructed a large scale set of
300 protein domains (a subset of ASTRAL database) that we have called Proteus
300. Using the relative gap of any of the 44850 couples as a similarity
measure, we obtained a classification in very good agreement with SCOP. Our
algorithm provides thus a powerful classification tool for large structure
databases
- …