Evolutionary Computation in Combinatorial Optimization
Editat de Peter I. Cowling, Peter Merzen Limba Engleză Paperback – 25 mar 2010
Preț: 322.80 lei
Preț vechi: 403.50 lei
-20%
Puncte Express: 484
Preț estimativ în valută:
57.04€ • 66.11$ • 49.74£
57.04€ • 66.11$ • 49.74£
Carte tipărită la comandă
Livrare economică 15-29 mai
Specificații
ISBN-13: 9783642121388
ISBN-10: 3642121381
Pagini: 312
Ilustrații: XII, 290 p. 67 illus.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.48 kg
Ediția:2010
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642121381
Pagini: 312
Ilustrații: XII, 290 p. 67 illus.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.48 kg
Ediția:2010
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
Professional/practitionerCuprins
Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling.- Heuristic and Exact Methods for the Discrete (r |p)-Centroid Problem.- On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme.- A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study.- Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems.- A Genetic Algorithm to Minimize Chromatic Entropy.- Evolutionary Approaches to the Three-dimensional Multi-pipe Routing Problem: A Comparative Study Using Direct Encodings.- A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks.- Ant Colony Optimization for Tree Decompositions.- Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Times.- Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures.- Characterizing Fault-Tolerance of Genetic Algorithms in Desktop Grid Systems.- The Office-Space-Allocation Problem in Strongly Hierarchized Organizations.- A Study of Memetic Search with Multi-parent Combination for UBQP.- Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealing.- A Memetic Algorithm for Workforce Distribution in Dynamic Multi-Skill Call Centres.- Geometric Generalization of the Nelder-Mead Algorithm.- Guided Ejection Search for the Pickup and Delivery Problem with Time Windows.- An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Principles.- Multilevel Variable Neighborhood Search for Periodic Routing Problems.- Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive.- A New Primal-Dual Genetic Algorithm: Case Study for the Winner Determination Problem.- Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem.- Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problem.
Caracteristici
Fast track conference proceeding Unique visibility State of the art research