Solving molecular distance geometry problems by global optimization algorithms

  • Andrea Grosso
  • Marco Locatelli
  • Fabio Schoen
    • Categories Biomedical Applications, Global Optimization, Stochastic Approaches Tags , , , Short URL: https://optimization-online.org/?p=9983

    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 Basin 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 DGSOL approach and a SDP based approach.

    Article

    Download

    View Solving molecular distance geometry problems by global optimization algorithms