Cargando…

Evolutionary Computation in Combinatorial Optimization 9th European Conference, EvoCOP 2009, Tübingen, Germany, April 15-17, 2009, Proceedings /

This book constitutes the refereed proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2009, held in Tübingen, Germany, in April 2009. The 21 revised full papers presented were carefully reviewed and selected from 53 submissions. The papers p...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Cotta, Carlos (Editor ), Cowling, Peter I. (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
Edición:1st ed. 2009.
Colección:Theoretical Computer Science and General Issues, 5482
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-642-01009-5
003 DE-He213
005 20230405235933.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 |a 9783642010095  |9 978-3-642-01009-5 
024 7 |a 10.1007/978-3-642-01009-5  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM037000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Evolutionary Computation in Combinatorial Optimization  |h [electronic resource] :  |b 9th European Conference, EvoCOP 2009, Tübingen, Germany, April 15-17, 2009, Proceedings /  |c edited by Carlos Cotta, Peter I. Cowling. 
250 |a 1st ed. 2009. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2009. 
300 |a XIV, 253 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 5482 
505 0 |a A Critical Element-Guided Perturbation Strategy for Iterated Local Search -- A Genetic Algorithm for Net Present Value Maximization for Resource Constrained Projects -- A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse -- A New Binary Description of the Blocks Relocation Problem and Benefits in a Look Ahead Heuristic -- A Plasmid Based Transgenetic Algorithm for the Biobjective Minimum Spanning Tree Problem -- A Tabu Search Algorithm with Direct Representation for Strip Packing -- An ACO Approach to Planning -- An Artificial Immune System for the Multi-Mode Resource-Constrained Project Scheduling Problem -- Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows -- Binary Exponential Back Off for Tabu Tenure in Hyperheuristics -- Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms -- Divide-And-Evolve Facing State-of-the-Art Temporal Planners during the 6 th International Planning Competition -- Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm -- Finding Balanced Incomplete Block Designs with Metaheuristics -- Guided Ejection Search for the Job Shop Scheduling Problem -- Improving Performance in Combinatorial Optimisation Using Averaging and Clustering -- Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks -- Metropolis and Symmetric Functions: A Swan Song -- Robustness Analysis in Evolutionary Multi-Objective Optimization Applied to VAR Planning in Electrical Distribution Networks -- Staff Scheduling with Particle Swarm Optimisation and Evolution Strategies -- University Course Timetabling with Genetic Algorithm: A Laboratory Excercises Case Study. 
520 |a This book constitutes the refereed proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2009, held in Tübingen, Germany, in April 2009. The 21 revised full papers presented were carefully reviewed and selected from 53 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economical, and scientific domains. Prominent examples of metaheuristics are evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms and ant colony optimization. 
650 0 |a Computer science. 
650 0 |a Algorithms. 
650 0 |a Numerical analysis. 
650 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Bioinformatics. 
650 1 4 |a Theory of Computation. 
650 2 4 |a Algorithms. 
650 2 4 |a Numerical Analysis. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Computational and Systems Biology. 
700 1 |a Cotta, Carlos.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Cowling, Peter I.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783642010101 
776 0 8 |i Printed edition:  |z 9783642010088 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 5482 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-642-01009-5  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)