Cantitate/Preț
Produs

Evolutionary Computation in Combinatorial Optimization

Editat de Günther R. Raidl, Jens Gottlieb
en Limba Engleză Paperback – 21 mar 2005

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (3) 32055 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 24 mar 2006 32055 lei  6-8 săpt.
  Springer – 21 mar 2005 32059 lei  6-8 săpt.
  Springer – 26 mar 2004 37246 lei  6-8 săpt.

Preț: 32059 lei

Preț vechi: 40073 lei
-20% Nou

Puncte Express: 481

Preț estimativ în valută:
5675 6607$ 4956£

Carte tipărită la comandă

Livrare economică 22 ianuarie-05 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540253372
ISBN-10: 3540253378
Pagini: 288
Ilustrații: XI, 271 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.44 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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 AgentModel for Binary Constraint Satisfaction Problems.

Caracteristici

Includes supplementary material: sn.pub/extras