{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":36,"n_cols":5,"rows_kept":36,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[11,4,11,5],[12,2,12,3],[12,4,12,5],[13,2,13,3],[13,4,13,5],[14,2,14,3],[15,2,15,3],[19,2,19,3],[20,2,20,3],[21,2,21,3],[22,2,22,3],[23,2,23,3],[24,2,24,3],[28,2,28,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA990001846500403321"]
[null,null,"Autore",null,"Tommasina, Cesare"]
[null,null,"Titolo",null,"Caso speciale di stima di un fabbricato civile / Cesare Tommasina"]
[null,null,"Pubbl/distr/stampa",null,"Torino : Tip. Lit. Camilla e Bartolero di N. Bartolero, 1903"]
[null,null,"Descrizione fisica",null,"14 p. ; 27 cm"]
[null,null,"Disciplina",null,"333.337"]
[null,null,"Locazione",null,"FAGBC"]
[null,null,"Collocazione",null,"60 MISC. B 59/3"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNINA9910830885403321"]
[null,null,"Autore",null,"Haupt Randy L"]
[null,null,"Titolo",null,"Practical genetic algorithms [[electronic resource] /] / Randy L. Haupt, Sue Ellen Haupt"]
[null,null,"Pubbl/distr/stampa",null,"Hoboken, N.J., : John Wiley, c2004"]
[null,null,"ISBN",null,"1-280-54212-8"]
[{"$nulls":4},"9786610542123"]
[{"$nulls":4},"0-471-67175-4"]
[{"$nulls":4},"0-471-67174-6"]
[null,null,"Edizione",null,"[2nd ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (273 p.)"]
[null,null,"Disciplina",null,"519.62"]
[null,null,"Soggetti",null,"Genetic algorithms"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","\"A Wiley-Interscience publication.\""]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"PRACTICAL GENETIC ALGORITHMS; CONTENTS; Preface; Preface to First Edition; List of Symbols; 1 Introduction to Optimization; 1.1 Finding the Best Solution; 1.1.1 What Is Optimization?; 1.1.2 Root Finding versus Optimization; 1.1.3 Categories of Optimization; 1.2 Minimum-Seeking Algorithms; 1.2.1 Exhaustive Search; 1.2.2 Analytical Optimization; 1.2.3 Nelder-Mead Downhill Simplex Method; 1.2.4 Optimization Based on Line Minimization; 1.3 Natural Optimization Methods; 1.4 Biological Optimization: Natural Selection; 1.5 The Genetic Algorithm; Bibliography; Exercises"]
[{"$nulls":4},"2 The Binary Genetic Algorithm2.1 Genetic Algorithms: Natural Selection on a Computer; 2.2 Components of a Binary Genetic Algorithm; 2.2.1 Selecting the Variables and the Cost Function; 2.2.2 Variable Encoding and Decoding; 2.2.3 The Population; 2.2.4 Natural Selection; 2.2.5 Selection; 2.2.6 Mating; 2.2.7 Mutations; 2.2.8 The Next Generation; 2.2.9 Convergence; 2.3 A Parting Look; Bibliography; Exercises; 3 The Continuous Genetic Algorithm; 3.1 Components of a Continuous Genetic Algorithm; 3.1.1 The Example Variables and Cost Function; 3.1.2 Variable Encoding, Precision, and Bounds"]
[{"$nulls":4},"3.1.3 Initial Population3.1.4 Natural Selection; 3.1.5 Pairing; 3.1.6 Mating; 3.1.7 Mutations; 3.1.8 The Next Generation; 3.1.9 Convergence; 3.2 A Parting Look; Bibliography; Exercises; 4 Basic Applications; 4.1 \"Mary Had a Little Lamb\"; 4.2 Algorithmic Creativity-Genetic Art; 4.3 Word Guess; 4.4 Locating an Emergency Response Unit; "]
[{"$nulls":4},"4.5 Antenna Array Design; 4.6 The Evolution of Horses; 4.5 Summary; Bibliography; 5 An Added Level of Sophistication; 5.1 Handling Expensive Cost Functions; 5.2 Multiple Objective Optimization; 5.2.1 Sum of Weighted Cost Functions; 5.2.2 Pareto Optimization"]
[{"$nulls":4},"5.3 Hybrid GA5.4 Gray Codes; 5.5 Gene Size; 5.6 Convergence; 5.7 Alternative Crossovers for Binary GAs; 5.8 Population; 5.9 Mutation; 5.10 Permutation Problems; 5.11 Selecting GA Parameters; 5.12 Continuous versus Binary GA; 5.13 Messy Genetic Algorithms; 5.14 Parallel Genetic Algorithms; 5.14.1 Advantages of Parallel GAs; 5.14.2 Strategies for Parallel GAs; 5.14.3 Expected Speedup; 5.14.4 An Example Parallel GA; 5.14.5 How Parallel GAs Are Being Used; Bibliography; Exercises; 6 Advanced Applications; 6.1 Traveling Salesperson Problem; 6.2 Locating an Emergency Response Unit Revisited"]
[{"$nulls":4},"6.3 Decoding a Secret Message6.4 Robot Trajectory Planning; 6.5 Stealth Design; 6.6 Building Dynamic Inverse Models-The Linear Case; 6.7 Building Dynamic Inverse Models-The Nonlinear Case; 6.8 Combining GAs with Simulations-Air Pollution Receptor Modeling; 6.9 Optimizing Artificial Neural Nets with GAs; 6.10 Solving High-Order Nonlinear Partial Differential Equations; Bibliography; 7 More Natural Optimization Algorithms; 7.1 Simulated Annealing; 7.2 Particle Swarm Optimization (PSO); 7.3 Ant Colony Optimization (ACO); 7.4 Genetic Programming (GP); 7.5 Cultural Algorithms"]
[{"$nulls":4},"7.6 Evolutionary Strategies"]
[null,null,null,"Sommario/riassunto","* This book deals with the fundamentals of genetic algorithms and their applications in a variety of different areas of engineering and science* Most significant update to the second edition is the MATLAB codes that accompany the text* Provides a thorough discussion of hybrid genetic algorithms* Features more examples than first edition"]