We discuss the geometrical interpretation of a well-known smoothing operator applied to the Molecular Distance Geometry Problem (MDGP), and we then describe a heuristic approach based on Variable Neighbourhood Search on the smoothed and original problem. This algorithm often manages to find solutions having higher accuracy than other methods. This is important as small differences in the objective function value may point to completely different 3D molecular structures.
Double Variable Neighbourhood Search with Smoothing for the Molecular Distance Geometry Problem / Liberti, L; C., Lavor; N., Maculan; Marinelli, Fabrizio. - In: JOURNAL OF GLOBAL OPTIMIZATION. - ISSN 0925-5001. - 43:(2009), pp. 207-218. [10.1007/s10898-007-9218-1]
Double Variable Neighbourhood Search with Smoothing for the Molecular Distance Geometry Problem
MARINELLI, Fabrizio
2009-01-01
Abstract
We discuss the geometrical interpretation of a well-known smoothing operator applied to the Molecular Distance Geometry Problem (MDGP), and we then describe a heuristic approach based on Variable Neighbourhood Search on the smoothed and original problem. This algorithm often manages to find solutions having higher accuracy than other methods. This is important as small differences in the objective function value may point to completely different 3D molecular structures.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
