No full text

Landscape Analysis in Adaptive Metaheuristics for Grid Computing

2009 • In *Parallel Programming, Models and Applications in Grid and P2P Systems*

Peer reviewed

No document available.

copy to clipboard copied

Disciplines :

Computer science

Tantar, Emilia ^{}; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)

Tantar, Alexandru-Adrian ^{}; INRIA Lille Nord Europe Res Ctr, F-59650 Villeneuve Dascq, France.

Melab, Nouredine

Talbi, El-Ghazali

Language :

English

Title :

Landscape Analysis in Adaptive Metaheuristics for Grid Computing

Publication date :

2009

Main work title :

Parallel Programming, Models and Applications in Grid and P2P Systems

Publisher :

IOS Press

Edition :

Advances in Parallel Computing

Pages :

313-344

Peer reviewed :

Peer reviewed

Available on ORBilu :

since 12 November 2013

Scopus citations^{®}

0

Scopus citations^{®}

without self-citations

without self-citations

0

- K. Schulten, J. C. Phillips, L. V. Kale, and A. Bhatele, "Biomolecular modeling in the era of petascale computing," in Petascale Computing: Algorithms and Applications (D. Bader, ed.), pp. 165-181, Chapman & Hall/CRC Press, 2008.
- C. A. Stewart, M. S. Müller, and M. Lingwall, "Progress towards petascale applications in biology: Status in 2006," in Euro-Par Workshops, pp. 289-303, 2006.
- P. Crescenzi, D. Goldman, C. Papadimitriou, A. Piccolboni, and M. Yannakakis, "On the complexity of protein folding," in STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing, (New York, NY, USA), pp. 597-603, ACM Press, 1998.
- P.-Y. Calland, "On the structural complexity of a protein," Protein Engineering, vol. 16, no. 2, pp. 79-86, 2003.
- C. Levinthal, "How to fold graciously," in Mossbauer Spectroscopy in Biological Systems: Proceedings of a meeting held at Allerton House, Monticello, Illinois (J. T. P. Debrunnder and E. Munck, eds.), pp. 22-24, University of Illinois Press, 1969.
- B. H. McCormick, T. A. DeFanti, and M. D. Brown(eds.), "Visualization in scientific computing," Computer Graphics, vol. 21, November 1987.
- S. Wright, "The roles of mutation, inbreeding, crossbreeding and selection in evolution," in Proceedings of the Sixth International Congress of Genetics, vol. 1, pp. 356-366, 1932.
- P. C. Borges and M. P. Hansen, "A basis for future successes in multiobjective combinatorial optimization," Technical Report IMM-REP-1998-8, Institute of Mathematical Modelling, Technical University of Denmark, March 1998.
- P. F. Stadler, "Towards a theory of landscapes," in Complex Systems and Binary Networks (R. Lopéz- Peña, R. Capovilla, R. García-Pelayo, H. Waelbroeck, and F. Zertuche, eds.), vol. 461, (Berlin, New York), pp. 77-163, Springer Verlag, 1995.
- T. Schiavinotto and T. St utzle, "A review of metrics on permutations for search landscape analysis," Computers & Operations Research, vol. 34, no. 10, pp. 3143-3153, 2007.
- J. Branke, S. E. Chick, and C. Schmidt, "Selecting a selection procedure," Management Science, vol. 53, no. 12, pp. 1916-1932, 2007.
- R. Hooke and T. A. Jeeves, "Direct search solution of numerical and statistical problems," Journal of the ACM, vol. 8, no. 2, pp. 212-229, 1961.
- G. R. H.W. Spendley and F. R. Himsworth, "Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation," Technometrics, vol. 4, no. 4, pp. 441-461, 1962.
- J. A. Nelder and R. Mead, "A Simplex Method for Function Minimization," The Computer Journal, vol. 7, no. 4, pp. 308-313, 1965.
- A. Leach, "Energy minimisation and related methods for exploring the energy surface," in Molecular Modeling Principles and Practice, 2nd. Ed., pp. 253-302, Prentice Hall, 2001.
- J. C. Lagarias, J. A. Reeds, M. H. Wright, and P. E. Wright, "Convergence properties of the nelder-mead simplex algorithm in low dimensions," SIAM Journal on Optimization, vol. 9, pp. 112-147, 1998.
- F. Solis and R.-B. Wets, "Minimization by random search techniques," Mathematics of Operations Research, vol. 6, pp. 19-30, 1981.
- G. M. Morris, D. S. Goodsell, R. S. Halliday, R. Huey, W. E. Hart, R. K. Belew, and A. J. Olson, "Automated docking using a lamarckian genetic algorithm and an empirical binding free energy function," Journal of Computational Chemistry, vol. 19, pp. 1639-1662, January 1999.
- C. D. Rosin, R. S. Halliday,W. E. Hart, and R. K. Belew, "A comparison of global and local search methods in drug docking," in Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA97) (T. Bäck, ed.), (San Francisco, CA), pp. 221-228, Morgan Kaufmann, 1997.
- S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, Number 4598, 13 May 1983, vol. 220, 4598, pp. 671-680, 1983.
- N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, "Equation of state calculations by fast computing machines," The Journal of Chemical Physics, vol. 21, pp. 1087-1092, June 1953.
- M. Locatelli, "Simulated annealing algorithms for continuous global optimization," Journal of Optimization Theory and Applications, vol. 104, no. 1, pp. 121-133, 2000.
- L. Ingber, "Adaptive Simulated Annealing (ASA)," tech. rep., Caltech Alumni Association, 1993.
- L. Ingber, "Simulated annealing: Practice versus theory," Journal of Mathematical Computation Modelling, vol. 18, no. 11, pp. 29-57, 1993.
- L. Ingber and B. Rosen, "Genetic algorithms and very fast simulated reannealing: A comparison," Mathematical Computer Modeling, vol. 16, no. 11, pp. 87-100, 1992.
- L. Ingber, "Adaptive simulated annealing (ASA): Lessons learned," Control and Cybernetics, vol. 25, pp. 33-54, 1996.
- L. Ingber, "Adaptive simulated annealing (asa) and path-integral (pathint) algorithms: Generic tools for complex systems," tech. rep., Chicago, IL, 2001.
- M. R. Hestenes and E. Stiefel, "Methods of conjugate gradients for solving linear systems," Journal of Research of the National Bureau of Standards, vol. 49, pp. 409-436, December 1952.
- M. R. Hestenes, "Iterative methods for solving linear equations," Report 52-9, NAML, 1951.
- Reprinted in Journal of Opeimization Theory and Applications, Volume 11, pp. 323-334, 1973.
- L. Fox, H. D. Huskey, and J. H. Wilkinson, "Notes on the Solution of Algebraic Linear Simultaneous Equations," Quarterly Journal Of Mechanics And Applied Mathematics, vol. 1, no. 1, pp. 149-173, 1948.
- R. Fletcher and M. Powell, "A rapidly convergent descent method for minimization.," Computer Journal, vol. 6, pp. 163-168, 1963.
- R. Fletcher and C. Reeves, "Function minimization by conjugate gradients.," Computer Journal, vol. 7, pp. 149-154, 1964.
- E. Polak and G. Ribière, "Note sur la convergence des méthodes de directions conjuguées," Revue française d'informatique et de recherche opérationnelle, vol. 16, pp. 35-43, 1969.
- J. R. Shewchuk, "An introduction to the conjugate gradient method without the agonizing pain," tech. rep., Pittsburgh, PA, USA, 1994.
- C. G. Broyden, "The Convergence of a Class of Double-rank Minimization Algorithms: 2. The New Algorithm," IMA Journal of Applied Mathematics, vol. 6, no. 3, pp. 222-231, 1970.
- R. Fletcher, "A new approach to variable metric algorithms," The Computer Journal, vol. 13, no. 3, pp. 317-322, 1970.
- D. Goldfarb, "A family of variable metric updates derived by variational means," Mathematics of Computation, vol. 24, pp. 23-26, 1970.
- D. Shanno, "Conditioning of quasi-newton methods for function minimization," Mathematics of Computation, vol. 24, no. 111, pp. 647-656, 1970.
- J. Nocedal, "Updating quasi-newton matrices with limited storage," Mathematics of Computation, vol. 35, no. 151, pp. 773-782, 1980.
- D. C. Liu and J. Nocedal, "On the limited memory bfgs method for large scale optimization," Mathematical Programming, vol. 45, pp. 503-528, December 1989.
- R. H. Byrd, P. Lu, J. Nocedal, and C. Y. Zhu, "A limited memory algorithm for bound constrained optimization," SIAM Journal on Scientific Computing, vol. 16, no. 6, pp. 1190-1208, 1995.
- C. Zhu, R. H. Byrd, P. Lu, and J. Nocedal, "Algorithm 778: L-bfgs-b: Fortran subroutines for largescale bound-constrained optimization," ACM Transactions on Mathematical Software, vol. 23, no. 4, pp. 550-560, 1997.
- W. C. Davidon, "Variable metric method for minimization," AEC Research and Development Report ANL-5990, Argonne National Laboratory, 1959.
- M. Powell, "On the convergence of the variable metric algorithm," Journal of the Institute of Mathematics and Its Applications, vol. 7, pp. 21-36, 1971.
- J. Branke, S. E. Chick, and C. Schmidt, "New developments in ranking and selection: an empirical comparison of the three main approaches," in WSC '05: Proceedings of the 37th Conference on Winter Simulation, pp. 708-717, ACM, 2005.
- S. E. Chick and K. Inoue, "New results on procedures that select the best system using crn," Simulation Conference Proceedings, 2000. Winter, vol. 1, pp. 554-561, 2000.
- C. H. Chen, "A lower bound for the correct subset-selection probability and its application to discrete event system simulations," IEEE Transactions on Automatic Control, vol. 41, pp. 1227-1231, August 1996.
- C. H. Chen, J. Lin, E. Yücesan, and S. E. Chick, "Simulation budget allocation for further enhancing the efficiency of ordinal optimization," Journal of Discrete Event Dynamic Systems: Theory and Applications, vol. 10, pp. 251-270, July 2000.
- C. Schmidt, J. Branke, and S. E. Chick, "Integrating techniques from statistical ranking into evolutionary algorithms.," in EvoWorkshops (F. Rothlauf, J. Branke, S. Cagnoni, E. Costa, C. Cotta, R. Drechsler, E. Lutton, P. Machado, J. H. Moore, J. Romero, G. D. Smith, G. Squillero, and H. Takagi, eds.), vol. 3907 of Lecture Notes in Computer Science, pp. 752-763, Springer, 2006.
- L. Qiu and S. J. Hagen, "Internal friction in the ultrafast folding of the tryptophan cage," Chemical Physics, vol. 1, pp. 327-333, June 2005.
- C. D. Snow, L. Qiu, D. Du, F. Gai, S. J. Hagen, and V. S. Pande, "Trp zipper folding kinetics by molecular dynamics and temperature-jump spectroscopy.," Proceedings of the National Academy of Sciences of the Unitated States of America (PNAS), vol. 101, pp. 4077-4082, March 2004.
- P. Dauber-Osguthorpe, V. A. Roberts, D. J. Osguthorpe, J.Wolff, M. Genest, and A. T. Hagler, "Structure and energetics of ligand binding to proteins: Escherichia coli dihydrofolate reductase-trimethoprim, a drug-receptor system," Proteins: Structure, Function, and Genetics, vol. 4, no. 1, pp. 31-47, 1988.
- J. W. Ponder and D. A. Case, "Force fields for protein simulations," Advances in Protein Chemistry, vol. 66, pp. 27-85, 2003.
- A.-A. Tantar, N. Melab, and E.-G. Talbi, "A grid-based genetic algorithm combined with an adaptive simulated annealing for protein structure prediction," Soft Computing, vol. 12, no. 12, pp. 1185-1198, 2008.
- B. Parent, Algorithmes d'optimisation et d'analyse des problèmes multidimensionnels, non linéaires, en Biologie et Biophysique. PhD thesis, École Centrale de Lille, 2007.
- B. Parent, A. Tantar, N. Melab, E.-G. Talbi, and D. Horvath, "Grid-based evolutionary strategies applied to the conformational sampling problem," in IEEE Congress on Evolutionary Computation (CEC 2007), pp. 291-296, IEEE, September 2007.
- A. A. Tantar, N. Melab, E.-G. Talbi, B. Parent, and D. Horvath, "A parallel hybrid genetic algorithm for protein structure prediction on the computational grid," Future Generation Computer Systems, vol. 23, no. 3, pp. 398-409, 2007.
- F. Cappello, E. Caron, M. Dayde, F. Desprez, Y. Jegou, P. Primet, E. Jeannot, S. Lanteri, J. Leduc, N. Melab, G. Mornet, R. Namyst, B. Quetier, and O. Richard, "Grid'5000: A large scale and highly reconfigurable grid experimental testbed," in GRID '05: Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing, (Washington, DC, USA), pp. 99-106, IEEE Computer Society, 2005.