Advances in metaheuristics / / Luca Di Gaspero, Andrea Schaerf, Thomas Stutzle, editors |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | New York, : Springer, c2013 |
Descrizione fisica | 1 online resource (192 p.) |
Disciplina | 519.6 |
Altri autori (Persone) |
Di GasperoLuca
SchaerfAndrea StutzleThomas |
Collana | Operations research/Computer science interfaces series |
Soggetto topico |
Operations research
Mathematical optimization |
ISBN | 1-4614-6322-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Finite First Hitting Time versus Stochastic convergence in Particle Swarm Optimisation -- Using Performance Profiles for the Analysis and Design of Benchmark Experiments -- Real-World Parameter Tuning using Factorial Design with Parameter Decomposition -- Evolving Pacing Strategies for Team Pursuit Track Cycling -- A Dual Mutation Operator to Solve the Multi-objective Production Planning of Perishable Goods -- Brain cine-MRI Registration using MLSDO Dynamic Optimization Algorithm -- GRASP with Path Relinking for the Two-Echelon Vehicle Routing Problem -- A Hybrid (1+1)-Evolutionary Strategy for the Open Vehicle Routing Problem -- A Timeslot-Filling Heuristic Approach to Construct High-School Timetables -- A GRASP for Supply Chain Optimization with Financial Constraints per Production Unit. |
Record Nr. | UNINA-9910734094903321 |
New York, : Springer, c2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Ant colony optimization / / Marco Dorigo, Thomas Stutzle |
Autore | Dorigo Marco |
Edizione | [1st ed.] |
Pubbl/distr/stampa | Cambridge, Mass., : MIT Press, c2004 |
Descrizione fisica | 1 online resource (321 p.) |
Disciplina | 519.6 |
Altri autori (Persone) | StutzleThomas |
Soggetto topico |
Mathematical optimization
Ants - Behavior - Mathematical models |
ISBN |
0-262-29244-0
0-262-25603-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Contents; Preface; Acknowledgments; 1 - From Real to Artificial Ants; 2 - The Ant Colony Optimization Metaheuristic; 3 - Ant Colony Optimization Algorithms for the Traveling Salesman Problem; 4 - Ant Colony Optimization Theory; 5 - Ant Colony Optimization for NP-Hard Problems; 6 - AntNet: An ACO Algorithm for Data Network Routing; 7 - Conclusions and Prospects for the Future; Appendix: Sources of Information about the ACO Field; References; Index |
Record Nr. | UNINA-9910818709503321 |
Dorigo Marco | ||
Cambridge, Mass., : MIT Press, c2004 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Engineering stochastic local search algorithms : designing, implementing and analyzing effective heuristics ; second international workshop, SLS 2009, Brussels, Belgium, September 3-4, 2009 ; proceedings / / Thomas Stutzle, Mauro Birattari, Holger H. Hoos (eds.) |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2009 |
Descrizione fisica | 1 online resource (X, 155 p.) |
Disciplina | 005.11 |
Altri autori (Persone) |
BirattariMauro
HoosHolger H StutzleThomas |
Collana | Lecture notes in computer science |
Soggetto topico |
Computer algorithms
Electronic information resource searching Heuristic programming Search theory Stochastic programming |
ISBN | 3-642-03751-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | High-Performance Local Search for Task Scheduling with Human Resource Allocation -- High-Performance Local Search for Task Scheduling with Human Resource Allocation -- On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms -- Estimating Bounds on Expected Plateau Size in MAXSAT Problems -- A Theoretical Analysis of the k-Satisfiability Search Space -- Loopy Substructural Local Search for the Bayesian Optimization Algorithm -- Running Time Analysis of ACO Systems for Shortest Path Problems -- Techniques and Tools for Local Search Landscape Visualization and Analysis -- Short Papers -- High-Performance Local Search for Solving Real-Life Inventory Routing Problems -- A Detailed Analysis of Two Metaheuristics for the Team Orienteering Problem -- On the Explorative Behavior of MAX–MIN Ant System -- A Study on Dominance-Based Local Search Approaches for Multiobjective Combinatorial Optimization -- A Memetic Algorithm for the Multidimensional Assignment Problem -- Autonomous Control Approach for Local Search -- EasyGenetic: A Template Metaprogramming Framework for Genetic Master-Slave Algorithms -- Adaptive Operator Selection for Iterated Local Search -- Improved Robustness through Population Variance in Ant Colony Optimization -- Mixed-Effects Modeling of Optimisation Algorithm Performance. |
Altri titoli varianti | SLS 2009 |
Record Nr. | UNINA-9910485017403321 |
Berlin ; ; New York, : Springer, c2009 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Learning and intelligent optimization : designing, implementing and analyzing effective heuristics : third international conference, LION 2009 3, Trento, Italy, January 14-18, 2009 : selected papers / / Thomas Stutzle (ed.) |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer-Verlag, 2009 |
Descrizione fisica | 1 online resource (XII, 273 p.) |
Disciplina | 006.3 |
Altri autori (Persone) | StutzleThomas |
Collana | Lecture notes in computer science |
Soggetto topico |
Heuristic programming
Artificial intelligence |
ISBN | 3-642-11169-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Evolutionary Dynamics of Extremal Optimization -- Evolutionary Dynamics of Extremal Optimization -- A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing -- Expeditive Extensions of Evolutionary Bayesian Probabilistic Neural Networks -- New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory -- Beam-ACO Based on Stochastic Sampling: A Case Study on the TSP with Time Windows -- Flexible Stochastic Local Search for Haplotype Inference -- A Knowledge Discovery Approach to Understanding Relationships between Scheduling Problem Structure and Heuristic Performance -- Fitness Landscape Analysis for the Resource Constrained Project Scheduling Problem -- An ACO-Based Reactive Framework for Ant Colony Optimization: First Experiments on Constraint Satisfaction Problems -- Selection of Heuristics for the Job-Shop Scheduling Problem Based on the Prediction of Gaps in Machines -- Position-Guided Tabu Search Algorithm for the Graph Coloring Problem -- Corridor Selection and Fine Tuning for the Corridor Method -- Dynamic Multi-Armed Bandits and Extreme Value-Based Rewards for Adaptive Operator Selection in Evolutionary Algorithms -- Comparison of Coarsening Schemes for Multilevel Graph Partitioning -- Cooperative Strategies and Reactive Search: A Hybrid Model Proposal -- Study of the Influence of the Local Search Method in Memetic Algorithms for Large Scale Continuous Optimization Problems -- MALIOB Workshop Papers -- Neural Network Pairwise Interaction Fields for Protein Model Quality Assessment -- A Graph-Based Semi-supervised Algorithm for Protein Function Prediction from Interaction Maps -- Substitution Matrices and Mutual Information Approaches to Modeling Evolution. |
Record Nr. | UNINA-9910484556403321 |
Berlin ; ; Heidelberg, : Springer-Verlag, 2009 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Stochastic local search : foundations and applications / / Holger H. Hoos, Thomas Stutzle |
Autore | Hoos Holger H |
Pubbl/distr/stampa | San Francisco, CA, : Morgan Kaufmann Publishers, c2005 |
Descrizione fisica | 1 online resource (677 p.) |
Disciplina | 519.6 |
Altri autori (Persone) | StutzleThomas |
Collana | The Morgan Kaufmann Series in Artificial Intelligence |
Soggetto topico |
Algorithms
Combinatorial analysis Stochastic programming |
ISBN |
1-281-01505-9
9786611015053 0-08-049824-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Front Cover; Stochastic Local Search: Foundations and Applications; Copyright Page; Contents; Prologue; Part I: Foundations; Chapter 1. Introduction; 1.1 Combinatorial Problems; 1.2 Two Prototypical Combinatorial Problems; 1.3 Computational Complexity; 1.4 Search Paradigms; 1.5 Stochastic Local Search; 1.6 Further Readings and Related Work; 1.7 Summary; Exercises; Chapter 2. SLS Methods; 2.1 Iterative Improvement (Revisited); 2.2 'Simple' SLS Methods; 2.3 Hybrid SLS Methods; 2.4 Population-Based SLS Methods; 2.5 Further Readings and Related Work; 2.6 Summary; Exercises
Chapter 3. Generalised Local Search Machines3.1 The Basic GLSM Model; 3.2 State, Transition and Machine Types; 3.3 Modelling SLS Methods Using GLSMs; 3.4 Extensions of the Basic GLSM Model; 3.5 Further Readings and Related Work; 3.6 Summary; Exercises; Chapter 4. Empirical Analysis of SLS Algorithms; 4.1 Las Vegas Algorithms; 4.2 Run-Time Distributions; 4.3 RTD-Based Analysis of LVA Behaviour; 4.4 Characterising and Improving LVA Behaviour; 4.5 Further Readings and Related Work; 4.6 Summary; Exercises; Chapter 5. Search Space Structure and SLS Performance 5.1 Fundamental Search Space Properties5.2 Search Landscapes and Local Minima; 5.3 Fitness-Distance Correlation; 5.4 Ruggedness; 5.5 Plateaus; 5.6 Barriers and Basins; 5.7 Further Readings and Related Work; 5.8 Summary; Part II: Applications; Chapter 6. Propositional Satisfiability and Constraint Satisfaction; 6.1 The Satisfiability Problem; 6.2 The GSAT Architecture; 6.3 The WalkSAT Architecture; 6.4 Dynamic Local Search Algorithms for SAT; 6.5 Constraint Satisfaction Problems; 6.6 SLS Algorithms for CSPs; 6.7 Further Readings and Related Work; 6.8 Summary; Exercises Chapter 7. MAX-SAT and MAX-CSP7.1 The MAX-SAT Problem; 7.2 SLS Algorithms for MAX-SAT; 7.3 SLS Algorithms for MAX-CSP; 7.4 Further Readings and Related Work; 7.5 Summary; Exercises; Chapter 8. Travelling Salesman Problems; 8.1 TSP Applications and Benchmark Instances; 8.2 'Simple' SLS Algorithms for the TSP; 8.3 Iterated Local Search Algorithms for the TSP; 8.4 Population-Based SLS Algorithms for the TSP; 8.5 Further Readings and Related Work; 8.6 Summary; Exercises; Chapter 9. Scheduling Problems; 9.1 Models and General Considerations; 9.2 Single-Machine Scheduling; 9.3 Flow Shop Scheduling 9.4 Group Shop Problems9.5 Further Readings and Related Work; 9.6 Summary; Exercises; Chapter 10. Other Combinatorial Problems; 10.1 Graph Colouring; 10.2 The Quadratic Assignment Problem; 10.3 Set Covering; 10.4 Combinatorial Auctions; 10.5 DNA Code Design; 10.6 Further Readings and Related Work; 10.7 Summary; Exercises; Epilogue; Glossary; Bibliography; Index |
Record Nr. | UNINA-9910828817503321 |
Hoos Holger H | ||
San Francisco, CA, : Morgan Kaufmann Publishers, c2005 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|