04422nam 22006975 450 991048486200332120230406052942.03-540-33179-410.1007/11730095(CKB)1000000000232898(SSID)ssj0000317578(PQKBManifestationID)11267309(PQKBTitleCode)TC0000317578(PQKBWorkID)10292681(PQKB)11566960(DE-He213)978-3-540-33179-7(MiAaPQ)EBC3067554(PPN)123132940(EXLCZ)99100000000023289820100301d2006 u| 0engurnn#008mamaatxtccrEvolutionary Computation in Combinatorial Optimization[electronic resource] 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings /edited by Jens Gottlieb, Günther R. Raidl1st ed. 2006.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2006.1 online resource (XII, 296 p.)Theoretical Computer Science and General Issues,2512-2029 ;3906Bibliographic Level Mode of Issuance: Monograph3-540-33178-6 Includes bibliographical references and author index.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.Theoretical Computer Science and General Issues,2512-2029 ;3906Computer scienceAlgorithmsNumerical analysisComputer science—MathematicsDiscrete mathematicsTheory of ComputationAlgorithmsNumerical AnalysisDiscrete Mathematics in Computer ScienceComputer science.Algorithms.Numerical analysis.Computer science—Mathematics.Discrete mathematics.Theory of Computation.Algorithms.Numerical Analysis.Discrete Mathematics in Computer Science.005.4/32Gottlieb Jensedthttp://id.loc.gov/vocabulary/relators/edtRaidl Günther Redthttp://id.loc.gov/vocabulary/relators/edtEvoCOP (Conference)BOOK9910484862003321Evolutionary Computation in Combinatorial Optimization2824693UNINA