Solving molecular distance geometry problems by global optimization algorithms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving molecular distance geometry problems by global optimization algorithms

In this paper we consider global optimization algorithms based on multiple local searches for the Molecular Distance Geometry Problem (MDGP). Three distinct approaches (Multistart, Monotonic Bain Hopping, Population Basin Hopping) are presented and for each of them a computational analysis is performed. The results are also compared with those of two other approaches in the literature, the DGSO...

متن کامل

A Stochastic/Perturbation Global Optimization Algorithm for Distance Geometry Problems

We present a new global optimization approach for solving exactly or inexactly constrained distance geometry problems. Distance geometry problems are concerned with determining spatial structures from measurements of internal distances. They arise in the structural interpretation of nuclear magnetic resonance data and in the prediction of protein structure. These problems can be naturally formu...

متن کامل

Solving fuzzy optimization problems by evolutionary algorithms

In this paper mathematical programming problems with fuzzy constraints are dealt with. Fuzzy solutions are obtained by means of a parametric approach in conjunction with evolutionary techniques. Some relevant characteristics of the evolutionary algorithm are for instance a real-coded representation of solutions and the preselection scheme as niche formation and elitist technique. Three test pro...

متن کامل

Solving Engineering Optimization Problems by a Deterministic Global Optimization Approach

Abstract: Engineering optimization problems are normally formulated as nonlinear programming problems and adopted in a lot of research to show the effectiveness of new optimization algorithms. These problems are usually solved through deterministic or heuristic methods. Because non-convex functions exist in most engineering optimization problems that possess multiple local optima, the heuristic...

متن کامل

Solving Global Optimization Problems Using MANGO

Traditional approaches for solving global optimization problems generally rely on a single algorithm. The algorithm may be hybrid or applied in parallel. Contrary to traditional approaches, this paper proposes to form teams of algorithms to tackle global optimization problems. Each algorithm is embodied and ran by a software agent. Agents exist in a multiagent system and communicate over our pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Optimization and Applications

سال: 2007

ISSN: 0926-6003,1573-2894

DOI: 10.1007/s10589-007-9127-8