Vai al contenuto principale della pagina
Titolo: | Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 10th European Conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010, Proceedings / / edited by Peter I. Cowling, Peter Merz |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Edizione: | 1st ed. 2010. |
Descrizione fisica: | 1 online resource (XII, 290 p. 67 illus.) |
Disciplina: | 005.1 |
Soggetto topico: | Algorithms |
Computer science | |
Pattern recognition systems | |
Computer vision | |
Computer science—Mathematics | |
Discrete mathematics | |
Theory of Computation | |
Automated Pattern Recognition | |
Computer Vision | |
Discrete Mathematics in Computer Science | |
Classificazione: | 54.10 |
31.12 | |
31.76 | |
30.10 | |
DAT 718f | |
MAT 913f | |
MAT 919f | |
SS 4800 | |
Persona (resp. second.): | CowlingPeter I |
MerzPeter | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | 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. |
Titolo autorizzato: | Evolutionary Computation in Combinatorial Optimization |
ISBN: | 1-280-38599-5 |
9786613563910 | |
3-642-12139-X | |
Formato: | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996465302503316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |