Cycle-based formulations in Distance Geometry - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Open Journal of Mathematical Optimization Année : 2023

Cycle-based formulations in Distance Geometry

Résumé

The distance geometry problem asks to find a realization of a given simple edge-weighted graph in a Euclidean space of given dimension K, where the edges are realized as straight segments of lengths equal (or as close as possible) to the edge weights. The problem is often modelled as a mathematical programming formulation involving decision variables that determine the position of the vertices in the given Euclidean space. Solution algorithms are generally constructed using local or global nonlinear optimization techniques. We present a new modelling technique for this problem where, instead of deciding vertex positions, the formulations decide the length of the segments representing the edges in each cycle in the graph, projected in every dimension. We propose an exact formulation and a relaxation based on a Eulerian cycle. We then compare computational results from protein conformation instances obtained with stochastic global optimization techniques on the new cycle-based formulation and on the existing edge-based formulation. While edge-based formulations take less time to reach termination, cycle-based formulations are generally better on solution quality measures.
Fichier principal
Vignette du fichier
OJMO_2023__4__A1_0.pdf (718.88 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-04185620 , version 1 (23-08-2023)

Licence

Paternité

Identifiants

Citer

Leo Liberti, Gabriele Iommazzo, Carlile Lavor, Nelson Maculan. Cycle-based formulations in Distance Geometry. Open Journal of Mathematical Optimization, In press, 4, pp.1-16. ⟨10.5802/ojmo.18⟩. ⟨hal-04185620⟩
12 Consultations
27 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More