04372nam 22006975 450 99646570330331620230222051721.010.1007/b107115(CKB)1000000000212887(SSID)ssj0000317577(PQKBManifestationID)11224125(PQKBTitleCode)TC0000317577(PQKBWorkID)10292680(PQKB)11670139(DE-He213)978-3-540-31996-2(MiAaPQ)EBC3067985(PPN)123093368(EXLCZ)99100000000021288720100402d2005 u| 0engurnn#008mamaatxtccrEvolutionary Computation in Combinatorial Optimization[electronic resource] 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings /edited by Günther R. Raidl, Jens Gottlieb1st ed. 2005.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2005.1 online resource (XI, 271 p.)Theoretical Computer Science and General Issues,2512-2029 ;3448Bibliographic Level Mode of Issuance: Monograph3-540-31996-4 3-540-25337-8 Includes bibliographical references and index.An External Partial Permutations Memory for Ant Colony Optimization -- A Novel Application of Evolutionary Computing in Process Systems Engineering -- Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework -- An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem -- EvoGeneS, a New Evolutionary Approach to Graph Generation -- On the Application of Evolutionary Algorithms to the Consensus Tree Problem -- Analyzing Fitness Landscapes for the Optimal Golomb Ruler Problem -- Immune Algorithms with Aging Operators for the String Folding Problem and the Protein Folding Problem -- Multiobjective Quadratic Assignment Problem Solved by an Explicit Building Block Search Algorithm – MOMGA-IIa -- Lot-Sizing in a Foundry Using Genetic Algorithm and Repair Functions -- Estimation of Distribution Algorithms with Mutation -- Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution -- Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring -- Application of the Grouping Genetic Algorithm to University Course Timetabling -- Self-Adapting Evolutionary Parameters: Encoding Aspects for Combinatorial Optimization Problems -- Population Training Heuristics -- Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem -- The Use of Meta-heuristics to Solve Economic Lot Scheduling Problem -- Making the Edge-Set Encoding Fly by Controlling the Bias of Its Crossover Operator -- Ant Algorithm for the Graph Matching Problem -- An Adaptive Genetic Algorithm for the Minimal Switching Graph Problem -- An Improved Simulated Annealing Method for the Combinatorial Sub-problem of the Profit-Based Unit Commitment Problem -- A New Hybrid GA/SA Algorithm for the Job Shop Scheduling Problem -- An Agent Model for Binary Constraint Satisfaction Problems.Theoretical Computer Science and General Issues,2512-2029 ;3448Computer 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.006.3/3Raidl Günther Redthttp://id.loc.gov/vocabulary/relators/edtGottlieb Jensedthttp://id.loc.gov/vocabulary/relators/edtEvoCOP (Conference)BOOK996465703303316Evolutionary Computation in Combinatorial Optimization2824693UNISA