Listing 1 - 10 of 20 | << page >> |
Sort by
|
Choose an application
Simulated annealing (Mathematics) --- Algorithm, Annealing --- Algorithm, Probabilistic exchange --- Annealing, Monte Carlo --- Annealing, Simulated --- Annealing algorithm --- Cooling, Statistical --- Exchange algorithm, Probabilistic --- Hill climbing, Probabilistic --- Monte Carlo annealing --- Probabilistic exchange algorithm --- Probabilistic hill climbing --- Relaxation, Stochastic --- Statistical cooling --- Stochastic relaxation --- Combinatorial optimization
Choose an application
The book contains 15 chapters presenting recent contributions of top researchers working with Simulated Annealing (SA). Although it represents a small sample of the research activity on SA, the book will certainly serve as a valuable tool for researchers interested in getting involved in this multidisciplinary field. In fact, one of the salient features is that the book is highly multidisciplinary in terms of application areas since it assembles experts from the fields of Biology, Telecommunications, Geology, Electronics and Medicine.
Simulated annealing (Mathematics) --- Algorithm, Annealing --- Algorithm, Probabilistic exchange --- Annealing, Monte Carlo --- Annealing, Simulated --- Annealing algorithm --- Cooling, Statistical --- Exchange algorithm, Probabilistic --- Hill climbing, Probabilistic --- Monte Carlo annealing --- Probabilistic exchange algorithm --- Probabilistic hill climbing --- Relaxation, Stochastic --- Statistical cooling --- Stochastic relaxation --- Combinatorial optimization --- Mathematical modelling
Choose an application
This book provides the readers with the knowledge of Simulated Annealing and its vast applications in the various branches of engineering. We encourage readers to explore the application of Simulated Annealing in their work for the task of optimization.
Simulated annealing (Mathematics) --- Algorithm, Annealing --- Algorithm, Probabilistic exchange --- Annealing, Monte Carlo --- Annealing, Simulated --- Annealing algorithm --- Cooling, Statistical --- Exchange algorithm, Probabilistic --- Hill climbing, Probabilistic --- Monte Carlo annealing --- Probabilistic exchange algorithm --- Probabilistic hill climbing --- Relaxation, Stochastic --- Statistical cooling --- Stochastic relaxation --- Combinatorial optimization --- Mathematical modelling
Choose an application
Simulated annealing (Mathematics). --- Simulated annealing (Mathematics) --- 519.8 --- Algorithm, Annealing --- Algorithm, Probabilistic exchange --- Annealing, Monte Carlo --- Annealing, Simulated --- Annealing algorithm --- Cooling, Statistical --- Exchange algorithm, Probabilistic --- Hill climbing, Probabilistic --- Monte Carlo annealing --- Probabilistic exchange algorithm --- Probabilistic hill climbing --- Relaxation, Stochastic --- Statistical cooling --- Stochastic relaxation --- Combinatorial optimization --- 519.8 Operational research --- Operational research --- Computer science --- Numerical methods of optimisation --- Discrete mathematics --- Programmation mathematique --- Optimisation combinatoire
Choose an application
Simulated Annealing is a probabilistic meta-heuristic that is based on statistical mechanics: while at high temperatures molecules in a liquid move freely, the slow reduction of temperature decreases the thermal mobility of the molecules. The final state forms a pure crystal which also corresponds to a state of minimum energy. We encourage readers to explore SA in their work, mainly because it is simple and because it can yield very good results.
Simulated annealing (Mathematics) --- Algorithm, Annealing --- Algorithm, Probabilistic exchange --- Annealing, Monte Carlo --- Annealing, Simulated --- Annealing algorithm --- Cooling, Statistical --- Exchange algorithm, Probabilistic --- Hill climbing, Probabilistic --- Monte Carlo annealing --- Probabilistic exchange algorithm --- Probabilistic hill climbing --- Relaxation, Stochastic --- Statistical cooling --- Stochastic relaxation --- Combinatorial optimization --- Dynamics & statics
Choose an application
This book presents state of the art contributes to Simulated Annealing (SA) that is a well-known probabilistic meta-heuristic. It is used to solve discrete and continuous optimization problems. The significant advantage of SA over other solution methods has made it a practical solution method for solving complex optimization problems. Book is consisted of 13 chapters, classified in single and multiple objectives applications and it provides the reader with the knowledge of SA and several applications. We encourage readers to explore SA in their work, mainly because it is simple and can determine extremely very good results.
Simulated annealing (Mathematics) --- Algorithm, Annealing --- Algorithm, Probabilistic exchange --- Annealing, Monte Carlo --- Annealing, Simulated --- Annealing algorithm --- Cooling, Statistical --- Exchange algorithm, Probabilistic --- Hill climbing, Probabilistic --- Monte Carlo annealing --- Probabilistic exchange algorithm --- Probabilistic hill climbing --- Relaxation, Stochastic --- Statistical cooling --- Stochastic relaxation --- Combinatorial optimization --- Mathematical modelling
Choose an application
Optimization problems occurring regularly in chemistry, vary from selecting the best wavelength design for optimal spectroscopic concentration predictions to geometry optimization of atomic clusters and protein folding. Numerous optimization tactics have been explored to solve these problems. While most optimizers maintain the ability to locate global optima for simple problems, few are robust against local optima convergence with regard to difficult or large scale optimization problems. Simulated annealing (SA) has shown a great tolerance to local optima convergence and is often called a glob
Chemistry --- Simulated annealing (Mathematics) --- Algorithm, Annealing --- Algorithm, Probabilistic exchange --- Annealing, Monte Carlo --- Annealing, Simulated --- Annealing algorithm --- Cooling, Statistical --- Exchange algorithm, Probabilistic --- Hill climbing, Probabilistic --- Monte Carlo annealing --- Probabilistic exchange algorithm --- Probabilistic hill climbing --- Relaxation, Stochastic --- Statistical cooling --- Stochastic relaxation --- Combinatorial optimization --- Mathematics.
Choose an application
Computer science --- Numerical methods of optimisation --- Simulated annealing (Mathematics) --- 519.6 --- 681.3*G16 --- Algorithm, Annealing --- Algorithm, Probabilistic exchange --- Annealing, Monte Carlo --- Annealing, Simulated --- Annealing algorithm --- Cooling, Statistical --- Exchange algorithm, Probabilistic --- Hill climbing, Probabilistic --- Monte Carlo annealing --- Probabilistic exchange algorithm --- Probabilistic hill climbing --- Relaxation, Stochastic --- Statistical cooling --- Stochastic relaxation --- Combinatorial optimization --- Computational mathematics. Numerical analysis. Computer programming --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Simulated annealing (Mathematics). --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming
Choose an application
Quantum annealing employs quantum fluctuations in frustrated systems or networks to anneal the system down to its ground state, or more generally to its so-called minimum cost state. Often this procedure turns out to be more effective, in multivariable optimization problems, than its classical counterpart utilizing tunable thermal fluctuations. This volume is divided into three parts. Part I is an extensive tutorial introduction familiarizing the reader with the background material necessary to follow the core of the book. Part II gives a comprehensive account of the fundamentals and applications of the quantum annealing method, and Part III compares quantum annealing with other related optimization methods. This is the first book entirely devoted to quantum annealing and will be both an invaluable primer and guidebook for all advanced students and researchers in this important field.
Simulated annealing (Mathematics) --- Spin glasses. --- Fluctuations (Physics) --- Quantum theory. --- Verres de spin --- Fluctuations (Physique) --- Théorie quantique --- Spin glasses --- Quantum theory --- Applied Physics --- Atomic Physics --- Physics --- Engineering & Applied Sciences --- Physical Sciences & Mathematics --- Quantum dynamics --- Quantum mechanics --- Quantum physics --- Variations (Physics) --- Glasses, Magnetic --- Glasses, Spin --- Magnetic glasses --- Algorithm, Annealing --- Algorithm, Probabilistic exchange --- Annealing, Monte Carlo --- Annealing, Simulated --- Annealing algorithm --- Cooling, Statistical --- Exchange algorithm, Probabilistic --- Hill climbing, Probabilistic --- Monte Carlo annealing --- Probabilistic exchange algorithm --- Probabilistic hill climbing --- Relaxation, Stochastic --- Statistical cooling --- Stochastic relaxation --- Physics. --- Mathematical optimization. --- Condensed matter. --- Theoretical, Mathematical and Computational Physics. --- Condensed Matter Physics. --- Optimization. --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Mathematical physics. --- Condensed materials --- Condensed media --- Condensed phase --- Materials, Condensed --- Media, Condensed --- Phase, Condensed --- Liquids --- Matter --- Solids --- Physical mathematics --- Mathematics
Choose an application
Although planning and scheduling optimization have been explored in the literature for many years now, it still remains a hot topic in the current scientific research. The changing market trends, globalization, technical and technological progress, and sustainability considerations make it necessary to deal with new optimization challenges in modern manufacturing, engineering, and healthcare systems. This book provides an overview of the recent advances in different areas connected with operations research models and other applications of intelligent computing techniques used for planning and scheduling optimization. The wide range of theoretical and practical research findings reported in this book confirms that the planning and scheduling problem is a complex issue that is present in different industrial sectors and organizations and opens promising and dynamic perspectives of research and development.
Technology: general issues --- supply chain optimization --- oil and gas supply chain --- maintenance scheduling --- operation planning --- energy --- order picking --- wave planning --- warehouses --- distribution centers --- mixed integer programming --- non-linear programming --- Hadi-Vencheh model --- multiple criteria ABC inventory classification --- nonlinear weighted product model --- building material distributors --- central composite design (CCD) --- Box-Behnken design (BBD) --- optimal cost --- customer service level --- forecasting --- order planning --- inventory management --- resource-constrained project scheduling problem --- discounted cash flow maximization --- milestones payments --- simulated annealing algorithm --- slotting --- storage strategies --- stackability --- SKU --- product family --- heuristic --- metaheuristics --- scheduling --- injection molding --- hospital catering --- production scheduling --- flexible job shop problem --- mathematical model --- genetic algorithm --- local search method --- iterated local search algorithm --- competitive hub location problem --- network design --- food systems --- rural development --- mathematical programming --- crow search --- process planning --- operation sequencing --- precedence constraints --- manufacturing scheduling --- smart manufacturing --- intelligent manufacturing systems --- scheduling requirements --- cyber-physical production systems --- postman delivery --- vehicle routing problem --- particle swarm optimization algorithm --- differential evolution algorithm --- multi-criteria optimization --- simulation optimization --- production control --- multiple flexible job shop scheduling --- priority rules --- smart health care systems --- planning --- logistic systems --- benchmark --- workload balancing --- identical parallel machines --- normalized sum of square for workload deviations --- maximum completion time --- minimum completion time --- terminal location --- intermodal transportation --- simulated annealing --- mixed integer program --- incomplete networks --- supply chain optimization --- oil and gas supply chain --- maintenance scheduling --- operation planning --- energy --- order picking --- wave planning --- warehouses --- distribution centers --- mixed integer programming --- non-linear programming --- Hadi-Vencheh model --- multiple criteria ABC inventory classification --- nonlinear weighted product model --- building material distributors --- central composite design (CCD) --- Box-Behnken design (BBD) --- optimal cost --- customer service level --- forecasting --- order planning --- inventory management --- resource-constrained project scheduling problem --- discounted cash flow maximization --- milestones payments --- simulated annealing algorithm --- slotting --- storage strategies --- stackability --- SKU --- product family --- heuristic --- metaheuristics --- scheduling --- injection molding --- hospital catering --- production scheduling --- flexible job shop problem --- mathematical model --- genetic algorithm --- local search method --- iterated local search algorithm --- competitive hub location problem --- network design --- food systems --- rural development --- mathematical programming --- crow search --- process planning --- operation sequencing --- precedence constraints --- manufacturing scheduling --- smart manufacturing --- intelligent manufacturing systems --- scheduling requirements --- cyber-physical production systems --- postman delivery --- vehicle routing problem --- particle swarm optimization algorithm --- differential evolution algorithm --- multi-criteria optimization --- simulation optimization --- production control --- multiple flexible job shop scheduling --- priority rules --- smart health care systems --- planning --- logistic systems --- benchmark --- workload balancing --- identical parallel machines --- normalized sum of square for workload deviations --- maximum completion time --- minimum completion time --- terminal location --- intermodal transportation --- simulated annealing --- mixed integer program --- incomplete networks
Listing 1 - 10 of 20 | << page >> |
Sort by
|