Vai al contenuto principale della pagina
Titolo: | Evolutionary computation in combinatorial optimization : 6th European conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006 : proceedings / / Jens Gottlieb, Gunther R. Raidl (eds.) |
Pubblicazione: | Berlin ; ; New York, : Springer, c2006 |
Edizione: | 1st ed. 2006. |
Descrizione fisica: | 1 online resource (XII, 296 p.) |
Disciplina: | 005.4/32 |
Soggetto topico: | Evolutionary computation |
Evolutionary programming (Computer science) | |
Combinatorial optimization | |
Altri autori: | GottliebJens RaidlGunther |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and author index. |
Nota di contenuto: | Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem -- The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling -- Evolving the Structure of the Particle Swarm Optimization Algorithms -- A Tabu Search Algorithm for Optimization of Gas Distribution Networks -- Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm -- Parametrized GRASP Heuristics for Three-Index Assignment -- A Memetic Algorithm with Bucket Elimination for the Still Life Problem -- Effects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA -- Particle Swarm for the Traveling Salesman Problem -- Hierarchical Cellular Genetic Algorithm -- Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation -- Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach -- A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems -- New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm -- Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems -- A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem -- The Core Concept for the Multidimensional Knapsack Problem -- Multiobjective Scheduling of Jobs with Incompatible Families on Parallel Batch Machines -- A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem -- A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems -- Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning -- A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems -- An Efficient Hybrid Search Algorithm for Various Optimization Problems -- A Hybrid VNS/Tabu Search Algorithm for Apportioning the European Parliament. |
Altri titoli varianti: | EvoCOP 2006 |
Titolo autorizzato: | Evolutionary computation in combinatorial optimization |
ISBN: | 3-540-33179-4 |
Formato: | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 9910484862003321 |
Lo trovi qui: | Univ. Federico II |
Opac: | Controlla la disponibilità qui |