Abstract
In this work we consider the molecular distance geometry problem, which can be defined as the determination of the three-dimensional structure of a molecule based on distances between some pairs of atoms. We address the problem as a nonconvex least-squares problem. We apply three global optimization algorithms (spatial Branch-and-Bound, Variable Neighbourhood Search, Multi Level Single Linkage) to two sets of instances, one taken from the literature and the other new.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adjiman, C.S., Dallwig, S., Floudas, C.A., and Neumaier, A. (1998). A global optimization method, αBB, for general twice-differentiable constrained NLPs: I. Theoretical Advances. Computers & Chemical Engineering, 22(9): 1137–1158.
An, L.T. Hoai (2003). Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and d.c. programming. Journal of Global Optimization, 27:375–397.
Brimberg, J. and Mladenovic, N. (1996). A variable neighbourhood algorithm for solving the continuous location-allocation problem. Studies in Location Analysis, 10:1–12.
Crippen, G.M. and Havel, T.F. (1988). Distance Geometry and Molecular Conformation. Wiley, New York.
Drazić, M, Lavor, C., Maculan, N., and Mladenović, N. (2004). A continuous vns heuristic for finding the tridimensional structure of a molecule. Le Cahiers du GERAD, G-2004-22.
Gill, RE. (1999). User’s Guide for SNOPT 5.3. Systems Optimization Laboratory, Department of EESOR, Stanford University, California.
Hansen, E. (1992). Global Optimization Using Interval Analysis. Marcel Dekker, Inc., New York.
Hansen, P. and Mladenović, N. (2001). Variable neighbourhood search: Principles and applications. European Journal of Operations Research, 130:449–467.
Hendrickson, B.A. (1995). The molecule problem: exploiting structure in global optimization. SI AM Journal on Optimization, 5:835–857.
Kucherenko, S. and Sytsko, Yu. (2005). Application of deterministic low-discrepancy sequences in global optimization. Computational Optimization and Applications, 30(3):297–318.
Lavor, C. (to appear). On generating instances for the molecular distance geometry problem. In Maculan, N., editors (to appear). Global Optimization: from Theory to Implementation. Kluwer, Dordrecht [Liberti and Maculan].
Liberti, L. (2004). Reformulation and Convex Relaxation Techniques for Global Optimization. PhD thesis, Imperial College London, UK.
Liberti, L. (to appear). Writing global optimization software. In Maculan, N., editors (to appear). Global Optimization: from Theory to Implementation. Kluwer, Dordrecht. [Liberti and Maculan].
Liberti, L. and Maculan, N., editors (to appear). Global Optimization: from Theory to Implementation. Kluwer, Dordrecht.
Liberti, L., Tsiakis, P., Keeping, B., and Pantelides, C.C. (2001). ooOPS. Centre for Process Systems Engineering, Chemical Engineering Department, Imperial College, London, UK, 1.24 edition.
Locatelli, M. and Schoen, F. (1996). Simple linkage: Analysis of a threshold-accepting global optimization method. Journal of Global Optimization, 9:95–111.
Locatelli, M. and Schoen, F. (1999). Random linkage: a family of acceptance/rejection algorithms for global optimization. Mathematical Programming, 85(2):379–396.
Mladenović, N., Petrović, J., Kovačević-Vujčić, V., and Čangalović, M. (2003). Solving a spread-spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. European Journal of Operations Research, 151:389–399.
Moré, J.J. and Wu, Z. (1997). Global continuation for distance geometry problems. SI AM Journal on Optimization, 7:814–836.
Moré, J.J. and Wu, Z. (1999). Distance geometry optimization for protein structures. Journal of Global Optimization, 15:219–234.
Pardalos, P.M. and Romeijn, H.E., editors (2002). Handbook of Global Optimization, volume 2. Kluwer Academic Publishers, Dordrecht.
Phillips, A.T., Rosen, J.B., and Walke, V.H. (1996). Molecular structure determination by convex underestimation of local energy minima. In Pardalos, P.M., Shalloway, D., and Xue, G., editors, Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding, volume 23, pages 181–198, Providence. American Mathematical Society.
Press, W.H., Teukolsky, S.A., Vetterling, W.T., and Flannery, B.P. (1992, reprinted 1997). Numerical Recipes in C, Second Edition. Cambridge University Press, Cambridge.
Rinnooy-Kan, A.H.G. and Timmer, G.T. (1987a). Stochastic global optimization methods; part I: Clustering methods. Mathematical Programming, 39:27–56.
Rinnooy-Kan, A.H.G. and Timmer, G.T. (1987b). Stochastic global optimization methods; part II: Multilevel methods. Mathematical Programming, 39:57–78.
Ryoo, H.S. and Sahinidis, N.V. (1995). Global optimization of nonconvex NLPs and MINLPs with applications in process design. Computers & Chemical Engineering, 19(5):551–566.
Schoen, F. (1998). Random and quasi-random linkage methods in global optimization. Journal of Global Optimization, 13:445–454.
Schoen, F. (1999). Global optimization methods for high-dimensional problems. European Journal of Operations Research, 119:345–352.
Schoen, F. (2002). Two-phase methods for global optimization. In Romeijn, H.E., editors (2002). Handbook of Global Optimization, volume 2. Kluwer Academic Publishers, Dordrecht. [Pardalos and Romeijn, 2002], pages 151–177.
Smith, E.M.B. (1996). On the Optimal Design of Continuous Processes. PhD thesis, Imperial College of Science, Technology and Medicine, University of London.
Smith, E.M.B. and Pantelides, C.C. (1999). A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Computers & Chemical Engineering, 23:457–478.
Tawarmalani, M. and Sahinidis, N.V. (2002). Exact algorithms for global optimization of mixed-integer nonlinear programs. In Romeijn, H.E., editors (2002). Handbook of Global Optimization, volume 2. Kluwer Academic Publishers, Dordrecht [Pardalos and Romeijn, 2002], pages 1–63.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Lavor, C., Liberti, L., Maculan, N. (2006). Computational Experience with the Molecular Distance Geometry Problem. In: Pintér, J.D. (eds) Global Optimization. Nonconvex Optimization and Its Applications, vol 85. Springer, Boston, MA . https://doi.org/10.1007/0-387-30927-6_9
Download citation
DOI: https://doi.org/10.1007/0-387-30927-6_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30408-3
Online ISBN: 978-0-387-30927-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)