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 (Moré, Wu in J. Glob. Optim. 15:219–234, 1999) and a SDP based approach (Biswas et al. in An SDP based approach for anchor-free 3D graph realization, Technical Report, Operations Research, Stanford University, 2005).

Solving molecular distance geometry problems by global optimization algorithms

GROSSO, Andrea Cesare;LOCATELLI, Marco;
2009-01-01

Abstract

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 (Moré, Wu in J. Glob. Optim. 15:219–234, 1999) and a SDP based approach (Biswas et al. in An SDP based approach for anchor-free 3D graph realization, Technical Report, Operations Research, Stanford University, 2005).
2009
43
23
37
A. GROSSO; M. LOCATELLI; F. SCHOEN
File in questo prodotto:
File Dimensione Formato  
COAP2009.pdf

Accesso riservato

Tipo di file: POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione 384.24 kB
Formato Adobe PDF
384.24 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2318/29015
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 30
  • ???jsp.display-item.citation.isi??? 17
social impact