Book•
Simulated annealing
05 May 1993-pp 20-69
About: The article was published on 1993-05-05 and is currently open access. It has received 2454 citations till now. The article focuses on the topics: Simulated annealing.
Citations
More filters
TL;DR: A survey of the nowadays most important metaheuristics from a conceptual point of view and introduces a framework, that is called the I&D frame, in order to put different intensification and diversification components into relation with each other.
Abstract: The field of metaheuristics for the application to combinatorial optimization problems is a rapidly growing field of research. This is due to the importance of combinatorial optimization problems for the scientific as well as the industrial world. We give a survey of the nowadays most important metaheuristics from a conceptual point of view. We outline the different components and concepts that are used in the different metaheuristics in order to analyze their similarities and differences. Two very important concepts in metaheuristics are intensification and diversification. These are the two forces that largely determine the behavior of a metaheuristic. They are in some way contrary but also complementary to each other. We introduce a framework, that we call the I&D frame, in order to put different intensification and diversification components into relation with each other. Outlining the advantages and disadvantages of different metaheuristic approaches we conclude by pointing out the importance of hybridization of metaheuristics as well as the integration of metaheuristics and other methods for optimization.
3,287 citations
01 Jan 2006
TL;DR: JoinMap is developed by Kyazma B.V. in collaboration with statistical geneticists of Biometris of Wageningen UR (www.biometris.wur.nl) and aims to provide real-time information about gene expression in the population to facilitate informed decision-making.
2,054 citations
TL;DR: The General Utility Lattice Program (GULP) as discussed by the authors has been extended to include the ability to simulate polymers and surfaces, as well as adding many other new features, and the current status of the program is fully documented.
Abstract: The General Utility Lattice Program (GULP) has been extended to include the ability to simulate polymers and surfaces, as well as adding many other new features, and the current status of the program is fully documented. Both the background theory is described, as well as providing a concise review of some of the previous applications in order to demonstrate the range of its use. Examples are presented of work performed using the new compatibilities of the software, including the calculation of Born effective charges, mechanical properties as a function of applied pressure, calculation of frequency-dependent dielectric data, surface reconstructions of calcite and the performance of a linear-scaling algorithm for bond-order potentials.
1,987 citations
Book•
01 Jan 2006
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
Abstract: Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics.
The aim of this handbook is to capture the full breadth and depth of the constraint programming field and to be encyclopedic in its scope and coverage. While there are several excellent books on constraint programming, such books necessarily focus on the main notions and techniques and cannot cover also extensions, applications, and languages. The handbook gives a reasonably complete coverage of all these lines of work, based on constraint programming, so that a reader can have a rather precise idea of the whole field and its potential. Of course each line of work is dealt with in a survey-like style, where some details may be neglected in favor of coverage. However, the extensive bibliography of each chapter will help the interested readers to find suitable sources for the missing details. Each chapter of the handbook is intended to be a self-contained survey of a topic, and is written by one or more authors who are leading researchers in the area.
The intended audience of the handbook is researchers, graduate students, higher-year undergraduates and practitioners who wish to learn about the state-of-the-art in constraint programming. No prior knowledge about the field is necessary to be able to read the chapters and gather useful knowledge. Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
The handbook is organized in two parts. The first part covers the basic foundations of constraint programming, including the history, the notion of constraint propagation, basic search methods, global constraints, tractability and computational complexity, and important issues in modeling a problem as a constraint problem. The second part covers constraint languages and solver, several useful extensions to the basic framework (such as interval constraints, structured domains, and distributed CSPs), and successful application areas for constraint programming.
- Covers the whole field of constraint programming
- Survey-style chapters
- Five chapters on applications
Table of Contents
Foreword (Ugo Montanari)
Part I : Foundations
Chapter 1. Introduction (Francesca Rossi, Peter van Beek, Toby Walsh)
Chapter 2. Constraint Satisfaction: An Emerging Paradigm (Eugene C. Freuder, Alan K. Mackworth)
Chapter 3. Constraint Propagation (Christian Bessiere)
Chapter 4. Backtracking Search Algorithms (Peter van Beek)
Chapter 5. Local Search Methods (Holger H. Hoos, Edward Tsang)
Chapter 6. Global Constraints (Willem-Jan van Hoeve, Irit Katriel)
Chapter 7. Tractable Structures for CSPs (Rina Dechter)
Chapter 8. The Complexity of Constraint Languages
(David Cohen, Peter Jeavons)
Chapter 9. Soft Constraints (Pedro Meseguer, Francesca Rossi, Thomas Schiex)
Chapter 10. Symmetry in Constraint Programming
(Ian P. Gent, Karen E. Petrie, Jean-Francois Puget)
Chapter 11. Modelling (Barbara M. Smith)
Part II : Extensions, Languages, and Applications
Chapter 12. Constraint Logic Programming (Kim Marriott, Peter J. Stuckey, Mark Wallace)
Chapter 13. Constraints in Procedural and Concurrent Languages (Thom Fruehwirth, Laurent Michel, Christian Schulte)
Chapter 14. Finite Domain Constraint Programming Systems (Christian Schulte, Mats Carlsson)
Chapter 15. Operations Research Methods in Constraint Programming (John Hooker)
Chapter 16. Continuous and Interval Constraints(Frederic Benhamou, Laurent Granvilliers)
Chapter 17. Constraints over Structured Domains
(Carmen Gervet)
Chapter 18. Randomness and Structure (Carla Gomes, Toby Walsh)
Chapter 19. Temporal CSPs (Manolis Koubarakis)
Chapter 20. Distributed Constraint Programming
(Boi Faltings)
Chapter 21. Uncertainty and Change (Kenneth N. Brown, Ian Miguel)
Chapter 22. Constraint-Based Scheduling and Planning
(Philippe Baptiste, Philippe Laborie, Claude Le Pape, Wim Nuijten)
Chapter 23. Vehicle Routing (Philip Kilby, Paul Shaw)
Chapter 24. Configuration (Ulrich Junker)
Chapter 25. Constraint Applications in Networks
(Helmut Simonis)
Chapter 26. Bioinformatics and Constraints (Rolf Backofen, David Gilbert)
1,527 citations
TL;DR: Because lithiation-induced volume expansion, plasticity, and pulverization of electrode materials are the major mechanical effects that plague the performance and lifetime of high-capacity anodes in lithium-ion batteries, these observations provide important mechanistic insight for the design of advanced batteries.
Abstract: We report the creation of a nanoscale electrochemical device inside a transmission electron microscope--consisting of a single tin dioxide (SnO(2)) nanowire anode, an ionic liquid electrolyte, and a bulk lithium cobalt dioxide (LiCoO(2)) cathode--and the in situ observation of the lithiation of the SnO(2) nanowire during electrochemical charging. Upon charging, a reaction front propagated progressively along the nanowire, causing the nanowire to swell, elongate, and spiral. The reaction front is a "Medusa zone" containing a high density of mobile dislocations, which are continuously nucleated and absorbed at the moving front. This dislocation cloud indicates large in-plane misfit stresses and is a structural precursor to electrochemically driven solid-state amorphization. Because lithiation-induced volume expansion, plasticity, and pulverization of electrode materials are the major mechanical effects that plague the performance and lifetime of high-capacity anodes in lithium-ion batteries, our observations provide important mechanistic insight for the design of advanced batteries.
1,398 citations