Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Ant colony optimization [[electronic resource] /] / Marco Dorigo, Thomas Stützle
| Ant colony optimization [[electronic resource] /] / Marco Dorigo, Thomas Stützle |
| Autore | Dorigo Marco |
| Pubbl/distr/stampa | Cambridge, Mass., : MIT Press, c2004 |
| Descrizione fisica | 1 online resource (321 p.) |
| Disciplina | 519.6 |
| Altri autori (Persone) | StützleThomas |
| Soggetto topico |
Mathematical optimization
Ants - Behavior - Mathematical models |
| Soggetto genere / forma | Electronic books. |
| 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-9910451739103321 |
Dorigo Marco
|
||
| Cambridge, Mass., : MIT Press, c2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Ant colony optimization / / Marco Dorigo, Thomas Stützle
| Ant colony optimization / / Marco Dorigo, Thomas Stützle |
| Autore | Dorigo Marco |
| Pubbl/distr/stampa | Cambridge, Mass., : MIT Press, ©2004 |
| Descrizione fisica | 1 online resource (321 p.) |
| Disciplina | 519.6 |
| Altri autori (Persone) | StützleThomas |
| Soggetto topico |
Mathematical optimization
Ants - Behavior - Mathematical models |
| Soggetto non controllato | COMPUTER SCIENCE/General |
| 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-9910777451803321 |
|
Dorigo Marco
|
||
| Cambridge, Mass., : MIT Press, ©2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Evolutionary computation in combinatorial optimization : 23rd European Conference, EvoCOP 2023, held as part of EvoStar 2023, Brno, Czech Republic, April 12-14, 2023, proceedings / / edited by Leslie Pérez Cáceres and Thomas Stützle
| Evolutionary computation in combinatorial optimization : 23rd European Conference, EvoCOP 2023, held as part of EvoStar 2023, Brno, Czech Republic, April 12-14, 2023, proceedings / / edited by Leslie Pérez Cáceres and Thomas Stützle |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
| Descrizione fisica | 1 online resource (258 pages) |
| Disciplina | 929.374 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Evolutionary computation
Evolutionary programming (Computer science) |
| ISBN |
9783031300356
9783031300349 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Fairer comparisons for Travelling Salesman Problem solutions using Hash Functions -- Application of Adapt-CMSA to the Two-Echelon Electric Vehicle Routing Problem with Simultaneous Pickup and Deliveries -- Real-World Vehicle Routing using Adaptive Large Neighborhood Search -- A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning -- A memetic algorithm for deinterleaving pulse trains -- Application of Negative Learning Ant Colony Optimization to the Far From Most String Problem -- Monte Carlo Tree Search with Adaptive Simulation: a Case Study on Weighted Vertex Coloring -- Evolutionary Strategies for the Design of Binary Linear Codes -- A Policy-Based Learning Beam Search for Combinatorial Optimization -- Cooperative Coevolutionary Genetic Programming Hyper Heuristic for Budget Constrained Dynamic Multi-workflow Scheduling in Cloud Computing -- OneMax is not the Easiest Function for Fitness Improvements -- The Cost of Randomness in Evolutionary Algorithms: Crossover Can Save Random Bits -- Multi-objectivization Relaxes Multi-funnel Structures in Singleobjective NK-landscapes -- Decision/Objective Space Trajectory Networks for Multi-objective Combinatorial Optimisation -- On the e_ect of solution representation and neighborhood definition in AutoML Fitness Landscapes. |
| Record Nr. | UNISA-996517751003316 |
| Cham, Switzerland : , : Springer, , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Evolutionary computation in combinatorial optimization : 23rd European Conference, EvoCOP 2023, held as part of EvoStar 2023, Brno, Czech Republic, April 12-14, 2023, proceedings / / edited by Leslie Pérez Cáceres and Thomas Stützle
| Evolutionary computation in combinatorial optimization : 23rd European Conference, EvoCOP 2023, held as part of EvoStar 2023, Brno, Czech Republic, April 12-14, 2023, proceedings / / edited by Leslie Pérez Cáceres and Thomas Stützle |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
| Descrizione fisica | 1 online resource (258 pages) |
| Disciplina | 929.374 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Evolutionary computation
Evolutionary programming (Computer science) |
| ISBN |
9783031300356
9783031300349 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Fairer comparisons for Travelling Salesman Problem solutions using Hash Functions -- Application of Adapt-CMSA to the Two-Echelon Electric Vehicle Routing Problem with Simultaneous Pickup and Deliveries -- Real-World Vehicle Routing using Adaptive Large Neighborhood Search -- A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning -- A memetic algorithm for deinterleaving pulse trains -- Application of Negative Learning Ant Colony Optimization to the Far From Most String Problem -- Monte Carlo Tree Search with Adaptive Simulation: a Case Study on Weighted Vertex Coloring -- Evolutionary Strategies for the Design of Binary Linear Codes -- A Policy-Based Learning Beam Search for Combinatorial Optimization -- Cooperative Coevolutionary Genetic Programming Hyper Heuristic for Budget Constrained Dynamic Multi-workflow Scheduling in Cloud Computing -- OneMax is not the Easiest Function for Fitness Improvements -- The Cost of Randomness in Evolutionary Algorithms: Crossover Can Save Random Bits -- Multi-objectivization Relaxes Multi-funnel Structures in Singleobjective NK-landscapes -- Decision/Objective Space Trajectory Networks for Multi-objective Combinatorial Optimisation -- On the e_ect of solution representation and neighborhood definition in AutoML Fitness Landscapes. |
| Record Nr. | UNINA-9910686772303321 |
| Cham, Switzerland : , : Springer, , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
GECCO '19 : Proceedings of the Genetic and Evolutionary Computation Conference / / Manuel López-Ibáñez, Anne Auger, Thomas Stützle
| GECCO '19 : Proceedings of the Genetic and Evolutionary Computation Conference / / Manuel López-Ibáñez, Anne Auger, Thomas Stützle |
| Autore | López-Ibáñez Manuel |
| Pubbl/distr/stampa | New York : , : Association for Computing Machinery, , 2019 |
| Descrizione fisica | 1 online resource (1545 pages) |
| Disciplina | 004.35 |
| Soggetto topico |
Parallel processing (Electronic computers)
Parallel computers |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910412328503321 |
|
López-Ibáñez Manuel
|
||
| New York : , : Association for Computing Machinery, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Matheuristics : Algorithms and Implementations / / by Vittorio Maniezzo, Marco Antonio Boschetti, Thomas Stützle
| Matheuristics : Algorithms and Implementations / / by Vittorio Maniezzo, Marco Antonio Boschetti, Thomas Stützle |
| Autore | Maniezzo Vittorio |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (222 pages) |
| Disciplina | 005.1 |
| Collana | EURO Advanced Tutorials on Operational Research |
| Soggetto topico |
Production management
Operations research Management science Algorithms Computer science - Mathematics Mathematical optimization Operations Management Operations Research, Management Science Mathematical Applications in Computer Science Optimization |
| ISBN | 3-030-70277-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Part I: Contextual Issues -- 1. The Generalized Assignment Problem -- 2. Automatic Design for Matheuristics -- Part II: Metaheuristic Hybrids -- 3. Single Solution Metaheuristics -- 4. Population-Based metaheuristics -- Part III: Original Matheuristics -- 5. Diving Heuristics -- 6. Very Large-Scale Neighborhood Search -- 7. Decomposition Based Heuristics -- 8. Corridor Method -- 9. Kernel Search -- 10. Fore-and-Back. |
| Record Nr. | UNINA-9910484357503321 |
|
Maniezzo Vittorio
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Stochastic local search [[electronic resource] ] : foundations and applications / / Holger H. Hoos, Thomas Stützle
| Stochastic local search [[electronic resource] ] : foundations and applications / / Holger H. Hoos, Thomas Stützle |
| Autore | Hoos Holger H |
| Pubbl/distr/stampa | San Francisco, CA, : Morgan Kaufmann Publishers, c2005 |
| Descrizione fisica | 1 online resource (677 p.) |
| Disciplina |
005.1
519.6 |
| Altri autori (Persone) | StützleThomas |
| Collana | The Morgan Kaufmann Series in Artificial Intelligence |
| Soggetto topico |
Algorithms
Combinatorial analysis Stochastic programming |
| Soggetto genere / forma | Electronic books. |
| 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-9910511400103321 |
|
Hoos Holger H
|
||
| San Francisco, CA, : Morgan Kaufmann Publishers, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Stochastic local search [[electronic resource] ] : foundations and applications / / Holger H. Hoos, Thomas Stützle
| Stochastic local search [[electronic resource] ] : foundations and applications / / Holger H. Hoos, Thomas Stützle |
| Autore | Hoos Holger H |
| Pubbl/distr/stampa | San Francisco, CA, : Morgan Kaufmann Publishers, c2005 |
| Descrizione fisica | 1 online resource (677 p.) |
| Disciplina |
005.1
519.6 |
| Altri autori (Persone) | StützleThomas |
| 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-9910784531303321 |
|
Hoos Holger H
|
||
| San Francisco, CA, : Morgan Kaufmann Publishers, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||