Global Optimization Methods Based on Tabu Search

Spend your time even for only few minutes to read a book. Reading a book will never reduce and waste your time to be useless. Reading, for some people become a need that is to do every day such as spending time for eating. Now, what about you? Do you like to read a book? Now, we will show you a new book enPDFd global optimization methods based on tabu search that can be a new way to explore the knowledge. When reading this book, you can get one thing to always remember in every reading time, even step by step.

[1]  D. Balmer.  Theoretical and Computational Aspects of Simulated Annealing , 1991 .

[2]  Stephen F. Smith,et al.  Using Genetic Algorithms to Schedule Flow Shop Releases , 1989, ICGA.

[3]  L. D. Whitley,et al.  Complexity Theory and the No Free Lunch Theorem , 2005 .

[4]  Bernd Engels,et al.  The Importance of the Ene Reaction for the C2—C6 Cyclization of Enyne—Allenes (I) and (II). , 2001 .

[5]  J. Kennedy,et al.  Population structure and particle swarm performance , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[6]  Houeto Jean-Luc.  [Parkinson's disease]. , 2022, La Revue du praticien.

[7]  É. Taillard,et al.  Improvements and Comparison of Heuristics for solving the Multisource Weber Problem , 1997 .

[8]  Heinz Mühlenbein,et al.  Analysis of Selection, Mutation and Recombination in Genetic Algorithms , 1995, Evolution and Biocomputation.

[9]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[10]  W. Gutjahr.  A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC , 2003, Probability in the Engineering and Informational Sciences.

[11]  Robert Fredriksson,et al.  Genetic algorithm for large-scale maximum parsimony phylogenetic analysis of proteins. , 2005, Biochimica et biophysica acta.

[12]  George L. Nemhauser,et al.  The asymmetric traveling salesman problem with replenishment arcs , 2000, Eur. J. Oper. Res..

[13]  R A Abagyan,et al.  New methodology for computer-aided modelling of biomolecular structure and dynamics. 2. Local deformations and cycles. , 1989, Journal of biomolecular structure & dynamics.

[14]  P. Argos,et al.  Protein structure prediction: recognition of primary, secondary, and tertiary structural features from amino acid sequence. , 1995, Critical reviews in biochemistry and molecular biology.

[15]  Oscar Cordón,et al.  A Scatter Search Algorithm for the 3D Image Registration Problem , 2004, PPSN.

[16]  Rafael Martí,et al.  Experimental Testing of Advanced Scatter Search Designs for Global Optimization of Multimodal Functions , 2005, J. Glob. Optim..

[17]  B. Lin,et al.  Tabu search algorithm for chemical process optimization , 2004, Comput. Chem. Eng..

[18]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[19]  Pablo Echenique,et al.  Definition of Systematic, Approximately Separable, and Modular Internal Coordinates (SASMIC) for macromolecular simulation , 2005, J. Comput. Chem..

[20]  Krzysztof Fleszar,et al.  Solving the resource-constrained project scheduling problem by a variable neighbourhood search , 2004, Eur. J. Oper. Res..

[21]  Celso C. Ribeiro,et al.  GRASP and VNS for Max-Cut , 2002 .

[22]  Pierre Hansen,et al.  An Oil Pipeline Design Problem , 2003, Oper. Res..

[23]  S. Beaty.  Genetic Algorithms for Instruction Sequencing and Scheduling , 1992 .

[24]  W. C. Still,et al.  A Smart Monte Carlo Technique for Free Energy Simulations of Multiconformational Molecules. Direct Calculations of the Conformational Populations of Organic Molecules , 1995 .

[25]  Nenad Mladenovic,et al.  A variable neighborhood search for the capacitated location-routing problem , 2011, 2011 4th International Conference on Logistics.

[26]  Harold A. Scheraga,et al.  The multiple-minima problem in the conformational analysis of polypeptides. III. An Electrostatically Driven Monte Carlo Method: Tests on enkephalin , 1989, Journal of protein chemistry.

[27]  J. Doye,et al.  Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms , 1997, cond-mat/9803344.

[28]  C. Tschudin,et al.  Genetic Evolution of Protocol Implementations and Congurations , 2005 .

[29]  Lucila Ohno-Machado,et al.  A genetic algorithm approach to multi-disorder diagnosis , 2000, Artif. Intell. Medicine.

[30]  Fred Glover,et al.  Genetic algorithms and scatter search: unsuspected potentials , 1994 .

[31]  Patrick Siarry,et al.  Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions , 2003, Eur. J. Oper. Res..

[32]  Luca Maria Gambardella,et al.  HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem , 1997 .

[33]  Carsten Peterson,et al.  Neural Networks and NP-complete Optimization Problems; A Performance Study on the Graph Bisection Problem , 1988, Complex Syst..

[34]  M. Clerc,et al.  The swarm and the queen: towards a deterministic and adaptive particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[35]  István Kolossváry,et al.  Torsional flexing: Conformational searching of cyclic molecules in biased internal coordinate space , 1993, J. Comput. Chem..

[36]  Wilfried Bollweg,et al.  Numerical Prediction of Crystal Structures by Simulated Annealing , 1997 .

[37]  Bernd Engels,et al.  Gradient tabu search , 2007, J. Comput. Chem..

[38]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[39]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[40]  Leon O. Chua,et al.  Neural networks for nonlinear programming , 1988 .

[41]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[42]  D. Janaki Ram,et al.  Parallel Simulated Annealing Algorithms , 1996, J. Parallel Distributed Comput..

[43]  Ikou Kaku,et al.  The Deterministic Annealing Algorithms for Vehicle Routing Problems , 2003 .

[44]  Markus Leitner,et al.  Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search , 2005 .

[45]  M. Laguna,et al.  Neural network prediction in a system for optimizing simulations , 2002 .

[46]  Patrick Siarry,et al.  A hybrid method combining continuous tabu search and Nelder-Mead simplex algorithms for the global optimization of multiminima functions , 2005, Eur. J. Oper. Res..

[47]  L. Ingber.  Very fast simulated re-annealing , 1989 .

[48]  Jasjeet S. Sekhon,et al.  Genetic Optimization Using Derivatives , 2011, Political Analysis.

[49]  A. A. Zhigli︠a︡vskiĭ,et al.  Theory of Global Random Search , 1991 .

[50]  Lutgarde M. C. Buydens,et al.  Quality Criteria of Genetic Algorithms for Structure Optimization , 1998, J. Chem. Inf. Comput. Sci..

[51]  Martin Middendorf,et al.  Modeling the Dynamics of Ant Colony Optimization , 2002, Evolutionary Computation.

[52]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[53]  H. Scheraga,et al.  Variable step molecular dynamics: An exploratory technique for peptides with fixed geometry , 1990 .

[54]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[55]  Vassilis P. Plagianakos,et al.  Parallel evolutionary training algorithms for “hardware-friendly” neural networks , 2002, Natural Computing.

[56]  Giorgio Giacinto,et al.  A Tabu Search algorithm for the optimisation of telecommunication networks , 1998, Eur. J. Oper. Res..

[57]  Daniel Raymond Frantz,et al.  Nonlinearities in genetic adaptive search. , 1972 .

[58]  Rainer Storn,et al.  System design by constraint adaptation and differential evolution , 1999, IEEE Trans. Evol. Comput..

[59]  Jon Baker,et al.  Techniques for geometry optimization: A comparison of cartesian and natural internal coordinates , 1993, J. Comput. Chem..

[60]  S. Schäffler,et al.  Unconstrained global optimization using stochastic intergral equations , 1995 .

[61]  S. Kundu,et al.  Genetic algorithm application to vibration control of tall flexible structures , 2002, Proceedings First IEEE International Workshop on Electronic Design, Test and Applications '2002.

[62]  Wolfgang Quapp,et al.  REDUCED GRADIENT METHODS AND THEIR RELATION TO REACTION PATHS , 2003 .

[63]  Jiri Vohradsky,et al.  A parallel genetic algorithm for single class pattern classification and its application for gene expression profiling in Streptomyces coelicolor , 2007, BMC Genomics.

[64]  John L. Klepeis,et al.  DIMACS Series in Discrete Mathematicsand Theoretical Computer Science Global Optimization Approaches in Protein Folding andPeptide , 2007 .

[65]  A E Howard,et al.  An analysis of current methodologies for conformational searching of complex molecules. , 1988, Journal of medicinal chemistry.

[66]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[67]  I. Kuntz,et al.  Distance geometry. , 1989, Methods in enzymology.

[68]  E. Burke,et al.  Variable neighborhood search for nurse rostering problems , 2004 .

[69]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

[70]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[71]  W. Gutjahr.  S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty , 2004, ANTS Workshop.

[72]  Francisco Herrera,et al.  Continuous scatter search: An analysis of the integration of some combination methods and improvement strategies , 2006, Eur. J. Oper. Res..

[73]  Markus Leitner,et al.  The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search , 2010, Networks.

[74]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[75]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[76]  Stefan Voß,et al.  Generic application of tabu search methods to manufacturing problems , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[77]  Pierre Hansen,et al.  Fuzzy J-Means: a new heuristic for fuzzy clustering , 2001, Pattern Recognit..

[78]  Walter Cedeño,et al.  Using particle swarms for the development of QSAR models based on K-nearest neighbor and kernel regression , 2003, J. Comput. Aided Mol. Des..

[79]  J. Simons,et al.  Walking on potential energy surfaces , 1990 .

[80]  Rainer Storn,et al.  Differential Evolution-A simple evolution strategy for fast optimization , 1997 .

[81]  Fred W. Glover,et al.  Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms) , 1994, Discret. Appl. Math..

[82]  Peter A. Kollman,et al.  Conformational sampling and ensemble generation by molecular dynamics simulations: 18‐Crown‐6 as a test case , 1992 .

[83]  Michel Gendreau,et al.  A dynamic model and parallel tabu search heuristic for real-time ambulance relocation , 2001, Parallel Comput..

[84]  J T Ngo,et al.  Computational complexity of a problem in molecular structure prediction. , 1992, Protein engineering.

[85]  Lester Ingber,et al.  Simulated annealing: Practice versus theory , 1993 .

[86]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[87]  Ann S. K. Kwan,et al.  Driver Scheduling Using Genetic Algorithms with Embedded Combinatorial Traits , 1999 .

[88]  Nelson Maculan,et al.  Double VNS for the Molecular Distance Geometry Problem , 2005 .

[89]  Mrinal K. Sen,et al.  Nonlinear one-dimensional seismic waveform inversion using simulated annealing , 1991 .

[90]  Jon Baker,et al.  Geometry optimization in cartesian coordinates: The end of the Z‐matrix? , 1991 .

[91]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[92]  Denis José Schiozer,et al.  Scatter Search Metaheuristic Applied to the History Matching Problem , 2006 .

[93]  Markus Leitner,et al.  Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem , 2007 .

[94]  Robert Hooke,et al.  `` Direct Search'' Solution of Numerical and Statistical Problems , 1961, JACM.

[95]  Haiyan Liu,et al.  Genetic algorithms for protein conformation sampling and optimization in a discrete backbone dihedral angle space , 2006, J. Comput. Chem..

[96]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[97]  Jacek Blazewicz,et al.  NMR Analysis of RNA Bulged Structures: Tabu Search Application in NOE Signal Assignment , 2005, 2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology.

[98]  D. Kunkel,et al.  Mechanisms of food selection in Daphnia , 1991 .

[99]  Bahram Alidaee,et al.  Global optimization for artificial neural networks: A tabu search application , 1998, Eur. J. Oper. Res..

[100]  J. Oliver,et al.  Synthesis of spatially and intrinsically constrained curves using simulated annealing , 1996 .

[101]  Tom V. Mathew.  Genetic Algorithm , 2022 .

[102]  L. Darrell Whitley,et al.  Dynamic Representations and Escaping Local Optima: Improving Genetic Algorithms and Local Search , 2000, AAAI/IAAI.

[103]  Bernd Engels,et al.  New Tabu Search based global optimization methods outline of algorithms and study of efficiency , 2008, J. Comput. Chem..

[104]  Belén Melián-Batista,et al.  Data Mining with Scatter Search , 2005, EUROCAST.

[105]  Walter J. Gutjahr,et al.  First steps to the runtime complexity analysis of ant colony optimization , 2008, Comput. Oper. Res..

[106]  Deterministic simulated annealing for system optimization , 1991, Conference Proceedings 1991 IEEE International Conference on Systems, Man, and Cybernetics.

[107]  Pierre Hansen,et al.  Pooling Problem: Alternate Formulations and Solution Methods , 2000, Manag. Sci..

[108]  J Baker,et al.  REDUCING BIAS AND NEFFICIENCY IN THE SELECTION ALGORITHM, GENETIC ALGORITHMS AND APPLICATIONS , 2000 .

[109]  T. Schlick.  Optimization Methods in Computational Chemistry , 2007 .

[110]  Alain Hertz,et al.  A variable neighborhood search for graph coloring , 2003, Eur. J. Oper. Res..

[111]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[112]  Rex A. Dwyer,et al.  RNA Secondary Structure , 2002 .

[113]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[114]  Martin Heusse,et al.  Adaptive Agent-Driven Routing and Load Balancing in Communication Networks , 1998, Adv. Complex Syst..

[115]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[116]  Hans-Michael Voigt,et al.  Soft Genetic Operators in Evolutionary Algorithms , 1995, Evolution and Biocomputation.

[117]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[118]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[119]  Pierre Hansen,et al.  Variable Neighborhood Decomposition Search , 1998, J. Heuristics.

[120]  Ángel Corberán,et al.  Heuristic solutions to the problem of routing school buses with multiple objectives , 2002, J. Oper. Res. Soc..

[121]  L. Ingber,et al.  Application of statistical mechanics methodology to term-structure bond-pricing models , 1991 .

[122]  István Kolossváry,et al.  Low‐mode conformational search elucidated: Application to C39H80 and flexible docking of 9‐deazaguanine inhibitors into PNP , 1999 .

[123]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[124]  David E. van den Bout,et al.  Graph partitioning using annealed neural networks , 1990, International 1989 Joint Conference on Neural Networks.

[125]  Reda Alhajj,et al.  Discovering Accurate and Interesting Classification Rules Using Genetic Algorithm , 2006, DMIN.

[126]  Songde Ma,et al.  Robust epipolar geometry estimation using genetic algorithm , 1998, Pattern Recognit. Lett..

[127]  Nenad Mladenovic,et al.  A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule , 2008, Eur. J. Oper. Res..

[128]  Thomas Kiel Rasmussen,et al.  Improved Hidden Markov Model training for multiple sequence alignment by a particle swarm optimization-evolutionary algorithm hybrid. , 2003, Bio Systems.

[129]  D. R. Boswell,et al.  Molecular Modeling of Carbohydrates , 1996 .

[130]  M J Monem,et al.  Application of simulated annealing (SA) techniques for optimal water distribution in irrigation canals , 2005 .

[131]  Abdul Azim Abd Ghani,et al.  Adaptive routing in packet-switched networks using agents updating methods , 2003 .

[132]  Gregory A. Chass,et al.  Toward a computed structure database: methodology for effective molecular orbital computations , 2003 .

[133]  D. Bonnet-Delpon,et al.  Bioorganic and Medicinal Chemistry of Fluorine , 2008 .

[134]  Sabre Kais,et al.  A new approach to global minimization , 1997, J. Comput. Chem..

[135]  F. Glover,et al.  Tabu search and ejection chains—application to a node weighted version of the cardinality-constrained TSP , 1997 .

[136]  Hajime Kita,et al.  A Comparison Study of Self-Adaptation in Evolution Strategies and Real-Coded Genetic Algorithms , 2001, Evolutionary Computation.

[137]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[138]  Genetic Algorithm Based Design Of Passive Elements For Vibration Control , 1998 .

[139]  W. Gutjahr.  On the Finite-Time Dynamics of Ant Colony Optimization , 2006 .

[140]  Michel Gendreau,et al.  Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

[141]  Riccardo Poli,et al.  Genetic algorithm-based interactive segmentation of 3D medical images , 1999, Image Vis. Comput..

[142]  Franz Oppacher,et al.  Connection Management using Adaptive Mobile Agents , 1998 .

[143]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[144]  J. Lutton,et al.  Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms , 1995 .

[145]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[146]  Léon J. M. Rothkrantz,et al.  Ant-Based Load Balancing in Telecommunications Networks , 1996, Adapt. Behav..

[147]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[148]  H. Scheraga,et al.  Revised algorithms for the build‐up procedure for predicting protein conformations by energy minimization , 1987 .

[149]  Jin-Kao Hao,et al.  Scatter Search for Graph Coloring , 2001, Artificial Evolution.

[150]  Günther R. Raidl,et al.  The Multidimensional Knapsack Problem: Structure and Algorithms , 2010, INFORMS J. Comput..

[151]  Marie-Christine Costa,et al.  Variable Neighborhood Search for the Optimization of Cable Layout Problem , 2001 .

[152]  Peter Pulay,et al.  Systematic AB Initio Gradient Calculation of Molecular Geometries, Force Constants, and Dipole Moment Derivatives , 1979 .

[153]  Haiyan Jiang,et al.  A random tunneling algorithm for the structural optimization problem , 2002 .

[154]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[155]  Werner Braun,et al.  Efficient search for all low energy conformations of polypeptides by Monte Carlo methods , 1991 .

[156]  Patrice Boizumault,et al.  VNS/LDS+CP : A Hybrid Method for Constraint Optimization in Anytime Contexts , 2001 .

[157]  Pierre Hansen,et al.  J-MEANS: a new local search heuristic for minimum sum of squares clustering , 1999, Pattern Recognit..

[158]  W. Clark Still,et al.  An unbounded systematic search of conformational space , 1991 .

[159]  Harold A. Scheraga,et al.  Conformational Energy Calculations on Polypeptides and Proteins. , 1995 .

[160]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[161]  Russell C. Eberhart,et al.  Comparison between Genetic Algorithms and Particle Swarm Optimization , 1998, Evolutionary Programming.

[162]  N. Mladenović,et al.  Variable neighborhood search for the k-cardinality tree , 2004 .

[163]  P. Pardalos,et al.  Recent developments and trends in global optimization , 2000 .

[164]  G. Sebastiani,et al.  An Extended Ant Colony Algorithm and Its Convergence Analysis , 2005 .

[165]  D Cvijovicacute,et al.  Taboo search: an approach to the multiple minima problem. , 1995, Science.

[166]  Celso C. Ribeiro,et al.  A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy , 2000, J. Glob. Optim..

[167]  W. C. Still,et al.  The multiple minimum problem in molecular modeling. Tree searching internal coordinate conformational space , 1988 .

[168]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[169]  Cao An Wang,et al.  A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron , 2003, CCCG.

[170]  S. Banu Ozkan,et al.  Conformational search of peptides and proteins: Monte Carlo minimization with an adaptive bias method applied to the heptapeptide deltorphin , 2004, J. Comput. Chem..

[171]  Xiaodong Li,et al.  Adaptively Choosing Neighbourhood Bests Using Species in a Particle Swarm Optimizer for Multimodal Function Optimization , 2004, GECCO.

[172]  Gisbert Schneider,et al.  Optimized Particle Swarm Optimization (OPSO) and its application to artificial neural network training , 2006, BMC Bioinformatics.

[173]  J. Kennedy,et al.  Neighborhood topologies in fully informed and best-of-neighborhood particle swarms , 2003, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[174]  Belén Melián-Batista,et al.  The Parallel Variable Neighborhood Search for the p-Median Problem , 2002, J. Heuristics.

[175]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[176]  Robert Müller,et al.  Conformational analysis of arginine in gas phase—A strategy for scanning the potential energy surface effectively , 2008, J. Comput. Chem..

[177]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[178]  Xueguang Shao,et al.  A fast annealing evolutionary algorithm for global optimization , 2002, J. Comput. Chem..

[179]  Bahram Alidaee,et al.  Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search (Operations Research/Computer Science Interfaces Series) , 2005 .

[180]  K. Baumann,et al.  A systematic evaluation of the benefits and hazards of variable selection in latent variable regression. Part II. Practical applications , 2002 .

[181]  H. Maarten Vinkers,et al.  An ant algorithm for the conformational analysis of flexible molecules , 2007, J. Comput. Chem..

[182]  Barrett W. Thomas,et al.  A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows , 2007, INFORMS J. Comput..

[183]  Horst Reiner,et al.  Introduction to Global Optimization. Second Edition , 2000 .

[184]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[185]  Walter J. Gutjahr,et al.  A Graph-based Ant System and its convergence , 2000, Future Gener. Comput. Syst..

[186]  S. Wilson,et al.  Applications of simulated annealing to peptides , 1990, Biopolymers.

[187]  Yanchun Liang,et al.  A multi-approaches-guided genetic algorithm with application to operon prediction , 2007, Artif. Intell. Medicine.

[188]  Walter J. Gutjahr,et al.  A Converging ACO Algorithm for Stochastic Combinatorial Optimization , 2003, SAGA.

[189]  Thomas Weise,et al.  Global Optimization Algorithms -- Theory and Application , 2009 .

[190]  Hitoshi Iba,et al.  BUGS: A Bug-Based Search Strategy using Genetic Algorithms , 1992, PPSN.

[191]  Patrick Siarry,et al.  Tabu Search applied to global optimization , 2000, Eur. J. Oper. Res..

[192]  Richard F. Hartl,et al.  A variable neighborhood search for the capacitated arc routing problem with intermediate facilities , 2008, J. Heuristics.

[193]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[194]  Gordon M. Crippen,et al.  Distance Geometry and Molecular Conformation , 1988 .

[195]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[196]  Wang Rong,et al.  A genetic algorithm methodology for data mining and intelligent knowledge acquisition , 2001 .

[197]  Gordon M. Crippen,et al.  Exploring the conformation space of cycloalkanes by linearized embedding , 1992 .

[198]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[199]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[200]  Hirozumi Yamaguchi,et al.  A Method and a Genetic Algorithm for Deriving Protocols for Distributed Applications with Minimum Communication Cost , 1999 .

[201]  Thomas Stützle,et al.  A SHORT CONVERGENCE PROOF FOR A CLASS OF ACO ALGORITHMS , 2002 .

[202]  Ge Wu,et al.  Optimierung von FSS-Bandpassfiltern mit Hilfe der Schwarmintelligenz (Particle Swarm Optimization) , 2006 .

[203]  Eiji Osawa,et al.  Corner flapping: a simple and fast algorithm for exhaustive generation of ring conformations , 1989 .

[204]  P. Korošec.  REAL-PARAMETER OPTIMIZATION USING STIGMERGY , 2006 .

[205]  Valerie Daggett,et al.  Conformational search using a molecular dynamics–minimization procedure: Applications to clusters of coulombic charges, Lennard–Jones particles, and waters , 1998 .

[206]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[207]  J. Deneubourg,et al.  Collective patterns and decision-making , 1989 .

[208]  F. Anet,et al.  Inflection points and chaotic behavior in searching the conformational space of cyclononane , 1990 .

[209]  Pedro Larrañaga,et al.  Side chain placement using estimation of distribution algorithms , 2007, Artif. Intell. Medicine.

[210]  C. Gondro,et al.  A simple genetic algorithm for multiple sequence alignment. , 2007, Genetics and molecular research : GMR.

[211]  Yang Guangyou,et al.  A Modified Particle Swarm Optimizer Algorithm , 2007, 2007 8th International Conference on Electronic Measurement and Instruments.