My Account Log in

1 option

Evolutionary Computation in Combinatorial Optimization : 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings / edited by Günther R. Raidl, Jens Gottlieb.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Raidl, Günther R., editor.
Gottlieb, Jens, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 3448.
Theoretical Computer Science and General Issues ; 3448
Language:
English
Subjects (All):
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.
Local Subjects:
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Numeric Computing.
Discrete Mathematics in Computer Science.
Physical Description:
1 online resource (XI, 271 pages).
Edition:
First edition 2005.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
System Details:
text file PDF
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-540-31996-2
9783540319962
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account