Evolutionary Computation in Combinatorial Optimization 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Raidl, Günther R. (Επιμελητής έκδοσης), Gottlieb, Jens (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
• Σειρά: Lecture Notes in Computer Science, 3448
• Θέματα: Computer science.; Computers.; Algorithms.; Numerical analysis.; Computer science > Mathematics.; Computer Science.; Computation by Abstract Devices.; Algorithm Analysis and Problem Complexity.; Numeric Computing.; Discrete Mathematics in Computer Science.

Πίνακας περιεχομένων:

• 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.